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-171683761400572.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 ShieldPPPt-PT-003B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761400572
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 14:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 11 14:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 14:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 14:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 56K 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 ShieldPPPt-PT-003B-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717003059171

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-003B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-29 17:17:40] [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-29 17:17:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 17:17:40] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2024-05-29 17:17:40] [INFO ] Transformed 237 places.
[2024-05-29 17:17:40] [INFO ] Transformed 216 transitions.
[2024-05-29 17:17:40] [INFO ] Found NUPN structural information;
[2024-05-29 17:17:40] [INFO ] Parsed PT model containing 237 places and 216 transitions and 540 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldPPPt-PT-003B-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-003B-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-003B-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 216/216 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 213 transition count 192
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 213 transition count 192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 212 transition count 191
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 212 transition count 191
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 211 transition count 190
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 211 transition count 190
Applied a total of 52 rules in 65 ms. Remains 211 /237 variables (removed 26) and now considering 190/216 (removed 26) transitions.
// Phase 1: matrix 190 rows 211 cols
[2024-05-29 17:17:40] [INFO ] Computed 34 invariants in 20 ms
[2024-05-29 17:17:40] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-05-29 17:17:41] [INFO ] Invariant cache hit.
[2024-05-29 17:17:41] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
Running 189 sub problems to find dead transitions.
[2024-05-29 17:17:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 1/211 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 17:17:42] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 16 ms to minimize.
[2024-05-29 17:17:42] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:17:42] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-29 17:17:42] [INFO ] Deduced a trap composed of 20 places in 18 ms of which 1 ms to minimize.
[2024-05-29 17:17:43] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:17:43] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-29 17:17:43] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:17:43] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-29 17:17:43] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:17:43] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:17:43] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-29 17:17:43] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-29 17:17:43] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:17:43] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:17:43] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:17:43] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-29 17:17:43] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-05-29 17:17:43] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:17:43] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:17:43] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 17:17:44] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-29 17:17:44] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 8 ms to minimize.
[2024-05-29 17:17:44] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-29 17:17:44] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-29 17:17:44] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:17:44] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:17:44] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 1 ms to minimize.
[2024-05-29 17:17:44] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-29 17:17:44] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 9/63 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 17:17:46] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:17:46] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 17:17:46] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-29 17:17:46] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 17:17:47] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:17:47] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 17:17:49] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 17:17:50] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 10 (OVERLAPS) 190/401 variables, 211/282 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/401 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 12 (OVERLAPS) 0/401 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 282 constraints, problems are : Problem set: 0 solved, 189 unsolved in 13608 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 1/211 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 37/71 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 17:17:55] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 190/401 variables, 211/283 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 189/472 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 17:17:57] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:17:58] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-29 17:17:58] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-29 17:17:58] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-29 17:17:58] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-29 17:17:59] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2024-05-29 17:17:59] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-29 17:17:59] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 8/480 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 17:18:01] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 17:18:04] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 17:18:08] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/401 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/401 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 12 (OVERLAPS) 0/401 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 483 constraints, problems are : Problem set: 0 solved, 189 unsolved in 22725 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 49/49 constraints]
After SMT, in 36382ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 36405ms
Starting structural reductions in LTL mode, iteration 1 : 211/237 places, 190/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36926 ms. Remains : 211/237 places, 190/216 transitions.
Support contains 35 out of 211 places after structural reductions.
[2024-05-29 17:18:17] [INFO ] Flatten gal took : 37 ms
[2024-05-29 17:18:17] [INFO ] Flatten gal took : 15 ms
[2024-05-29 17:18:17] [INFO ] Input system was already deterministic with 190 transitions.
Support contains 34 out of 211 places (down from 35) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 25 to 24
RANDOM walk for 11693 steps (2 resets) in 304 ms. (38 steps per ms) remains 0/24 properties
Computed a total of 50 stabilizing places and 50 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' '!(X(G(p0)))'
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 190/190 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 203 transition count 182
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 203 transition count 182
Applied a total of 16 rules in 11 ms. Remains 203 /211 variables (removed 8) and now considering 182/190 (removed 8) transitions.
// Phase 1: matrix 182 rows 203 cols
[2024-05-29 17:18:18] [INFO ] Computed 34 invariants in 6 ms
[2024-05-29 17:18:18] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-29 17:18:18] [INFO ] Invariant cache hit.
[2024-05-29 17:18:18] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-29 17:18:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:18:19] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:18:20] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:18:20] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-29 17:18:20] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-29 17:18:20] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:18:20] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:18:20] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-29 17:18:20] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 2 ms to minimize.
[2024-05-29 17:18:20] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:18:20] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:18:20] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-29 17:18:20] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:18:20] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:18:20] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-05-29 17:18:20] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 2 ms to minimize.
[2024-05-29 17:18:20] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-29 17:18:20] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:18:20] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:18:21] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:18:21] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:18:21] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 182/385 variables, 203/258 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:18:23] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-29 17:18:23] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:18:25] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-29 17:18:26] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (OVERLAPS) 0/385 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 262 constraints, problems are : Problem set: 0 solved, 181 unsolved in 10454 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 25/59 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:18:30] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 182/385 variables, 203/263 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 181/444 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:18:32] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
[2024-05-29 17:18:32] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-29 17:18:32] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-29 17:18:32] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-05-29 17:18:33] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:18:33] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-29 17:18:33] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-29 17:18:33] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-29 17:18:33] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-29 17:18:33] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-29 17:18:33] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-29 17:18:34] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 12/456 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:18:36] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-29 17:18:37] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 2/458 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:18:42] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/385 variables, 1/459 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:18:44] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/385 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:18:47] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/385 variables, 1/461 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/385 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 14 (OVERLAPS) 0/385 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 385/385 variables, and 461 constraints, problems are : Problem set: 0 solved, 181 unsolved in 25943 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 43/43 constraints]
After SMT, in 36418ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 36420ms
Starting structural reductions in LTL mode, iteration 1 : 203/211 places, 182/190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36633 ms. Remains : 203/211 places, 182/190 transitions.
Stuttering acceptance computed with spot in 226 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLFireability-00
Entered a terminal (fully accepting) state of product in 74 steps with 0 reset in 3 ms.
FORMULA ShieldPPPt-PT-003B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-003B-LTLFireability-00 finished in 36926 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)&&F(G(p1)))))'
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 190/190 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 210 transition count 144
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 165 transition count 144
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 90 place count 165 transition count 123
Deduced a syphon composed of 21 places in 7 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 132 place count 144 transition count 123
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 138 place count 138 transition count 117
Iterating global reduction 2 with 6 rules applied. Total rules applied 144 place count 138 transition count 117
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 144 place count 138 transition count 114
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 150 place count 135 transition count 114
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 240 place count 90 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 241 place count 90 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 243 place count 89 transition count 67
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 259 place count 81 transition count 67
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 261 place count 79 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 262 place count 78 transition count 65
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 262 place count 78 transition count 63
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 266 place count 76 transition count 63
Applied a total of 266 rules in 57 ms. Remains 76 /211 variables (removed 135) and now considering 63/190 (removed 127) transitions.
// Phase 1: matrix 63 rows 76 cols
[2024-05-29 17:18:55] [INFO ] Computed 33 invariants in 2 ms
[2024-05-29 17:18:55] [INFO ] Implicit Places using invariants in 55 ms returned [58, 62]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 58 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/211 places, 63/190 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 72 transition count 61
Applied a total of 4 rules in 4 ms. Remains 72 /74 variables (removed 2) and now considering 61/63 (removed 2) transitions.
// Phase 1: matrix 61 rows 72 cols
[2024-05-29 17:18:55] [INFO ] Computed 31 invariants in 1 ms
[2024-05-29 17:18:55] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-29 17:18:55] [INFO ] Invariant cache hit.
[2024-05-29 17:18:55] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 72/211 places, 61/190 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 274 ms. Remains : 72/211 places, 61/190 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLFireability-02
Stuttering criterion allowed to conclude after 69165 steps with 0 reset in 365 ms.
FORMULA ShieldPPPt-PT-003B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-003B-LTLFireability-02 finished in 768 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 190/190 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 203 transition count 182
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 203 transition count 182
Applied a total of 16 rules in 7 ms. Remains 203 /211 variables (removed 8) and now considering 182/190 (removed 8) transitions.
// Phase 1: matrix 182 rows 203 cols
[2024-05-29 17:18:56] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 17:18:56] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-29 17:18:56] [INFO ] Invariant cache hit.
[2024-05-29 17:18:56] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-29 17:18:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:18:57] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-29 17:18:57] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:18:57] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-29 17:18:57] [INFO ] Deduced a trap composed of 19 places in 17 ms of which 1 ms to minimize.
[2024-05-29 17:18:57] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-29 17:18:57] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-05-29 17:18:57] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-05-29 17:18:57] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:18:57] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-05-29 17:18:57] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
[2024-05-29 17:18:58] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 2 ms to minimize.
[2024-05-29 17:18:58] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:18:58] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-29 17:18:58] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
[2024-05-29 17:18:58] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-29 17:18:58] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:18:58] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2024-05-29 17:18:58] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-29 17:18:58] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:18:58] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:18:59] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-29 17:18:59] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-29 17:18:59] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 182/385 variables, 203/260 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:19:00] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:19:02] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:19:03] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:19:03] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:19:06] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/385 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/385 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:19:08] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/385 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/385 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 14 (OVERLAPS) 0/385 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 266 constraints, problems are : Problem set: 0 solved, 181 unsolved in 15921 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 29/63 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:19:12] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 182/385 variables, 203/267 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 181/448 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:19:15] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-29 17:19:15] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-29 17:19:15] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-29 17:19:15] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-29 17:19:15] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:19:16] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
[2024-05-29 17:19:16] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 7/455 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:19:18] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-29 17:19:19] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
[2024-05-29 17:19:19] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 3/458 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:19:24] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/385 variables, 1/459 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/385 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 12 (OVERLAPS) 0/385 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 385/385 variables, and 459 constraints, problems are : Problem set: 0 solved, 181 unsolved in 20396 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 41/41 constraints]
After SMT, in 36344ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 36347ms
Starting structural reductions in LTL mode, iteration 1 : 203/211 places, 182/190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36558 ms. Remains : 203/211 places, 182/190 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 184 ms.
Product exploration explored 100000 steps with 50000 reset in 190 ms.
Computed a total of 47 stabilizing places and 47 stable transitions
Computed a total of 47 stabilizing places and 47 stable transitions
Detected a total of 47/203 stabilizing places and 47/182 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 60 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-003B-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-003B-LTLFireability-03 finished in 37120 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(((F(p0) U G(p1))||G(p2))))'
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 190/190 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 210 transition count 146
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 86 place count 167 transition count 146
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 86 place count 167 transition count 125
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 128 place count 146 transition count 125
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 133 place count 141 transition count 120
Iterating global reduction 2 with 5 rules applied. Total rules applied 138 place count 141 transition count 120
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 138 place count 141 transition count 117
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 144 place count 138 transition count 117
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 240 place count 90 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 241 place count 90 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 243 place count 89 transition count 67
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 259 place count 81 transition count 67
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 261 place count 79 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 262 place count 78 transition count 65
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 262 place count 78 transition count 63
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 266 place count 76 transition count 63
Applied a total of 266 rules in 23 ms. Remains 76 /211 variables (removed 135) and now considering 63/190 (removed 127) transitions.
// Phase 1: matrix 63 rows 76 cols
[2024-05-29 17:19:33] [INFO ] Computed 33 invariants in 0 ms
[2024-05-29 17:19:33] [INFO ] Implicit Places using invariants in 73 ms returned [58, 62]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 74 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/211 places, 63/190 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 72 transition count 61
Applied a total of 4 rules in 3 ms. Remains 72 /74 variables (removed 2) and now considering 61/63 (removed 2) transitions.
// Phase 1: matrix 61 rows 72 cols
[2024-05-29 17:19:33] [INFO ] Computed 31 invariants in 0 ms
[2024-05-29 17:19:33] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-29 17:19:33] [INFO ] Invariant cache hit.
[2024-05-29 17:19:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 17:19:33] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 72/211 places, 61/190 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 220 ms. Remains : 72/211 places, 61/190 transitions.
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLFireability-04
Product exploration explored 100000 steps with 1 reset in 265 ms.
Stack based approach found an accepted trace after 375 steps with 0 reset with depth 376 and stack size 374 in 2 ms.
FORMULA ShieldPPPt-PT-003B-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-003B-LTLFireability-04 finished in 538 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(F(p0))))'
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 190/190 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 203 transition count 182
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 203 transition count 182
Applied a total of 16 rules in 8 ms. Remains 203 /211 variables (removed 8) and now considering 182/190 (removed 8) transitions.
// Phase 1: matrix 182 rows 203 cols
[2024-05-29 17:19:33] [INFO ] Computed 34 invariants in 3 ms
[2024-05-29 17:19:33] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-29 17:19:33] [INFO ] Invariant cache hit.
[2024-05-29 17:19:34] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-29 17:19:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:19:35] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:19:35] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:19:35] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:19:35] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-29 17:19:35] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:19:35] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:19:35] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:19:35] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-29 17:19:35] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:19:35] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:19:35] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-29 17:19:35] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:19:35] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:19:36] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-29 17:19:36] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:19:36] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-29 17:19:36] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-29 17:19:36] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-29 17:19:36] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-29 17:19:36] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:19:36] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-05-29 17:19:37] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:19:38] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:19:38] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (OVERLAPS) 182/385 variables, 203/261 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:19:40] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-29 17:19:40] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (OVERLAPS) 0/385 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 263 constraints, problems are : Problem set: 0 solved, 181 unsolved in 10067 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 26/60 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/385 variables, 203/263 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 181/444 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:19:46] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
[2024-05-29 17:19:46] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
[2024-05-29 17:19:46] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-29 17:19:46] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-29 17:19:46] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-29 17:19:46] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-29 17:19:46] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-29 17:19:47] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:19:47] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-29 17:19:47] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-29 17:19:47] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 11/455 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:19:49] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 1/456 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:19:52] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-29 17:19:52] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 2/458 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:19:57] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/385 variables, 1/459 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/385 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 12 (OVERLAPS) 0/385 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 385/385 variables, and 459 constraints, problems are : Problem set: 0 solved, 181 unsolved in 20589 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 41/41 constraints]
After SMT, in 30685ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 30688ms
Starting structural reductions in LTL mode, iteration 1 : 203/211 places, 182/190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30972 ms. Remains : 203/211 places, 182/190 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLFireability-05
Product exploration explored 100000 steps with 33333 reset in 117 ms.
Product exploration explored 100000 steps with 33333 reset in 118 ms.
Computed a total of 46 stabilizing places and 46 stable transitions
Computed a total of 46 stabilizing places and 46 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 14 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-003B-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-003B-LTLFireability-05 finished in 31413 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 2 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 190/190 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 211 transition count 146
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 45 rules applied. Total rules applied 89 place count 167 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 90 place count 166 transition count 145
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 90 place count 166 transition count 123
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 134 place count 144 transition count 123
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 140 place count 138 transition count 117
Iterating global reduction 3 with 6 rules applied. Total rules applied 146 place count 138 transition count 117
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 146 place count 138 transition count 114
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 152 place count 135 transition count 114
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 248 place count 87 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 249 place count 87 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 251 place count 86 transition count 64
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 267 place count 78 transition count 64
Applied a total of 267 rules in 73 ms. Remains 78 /211 variables (removed 133) and now considering 64/190 (removed 126) transitions.
// Phase 1: matrix 64 rows 78 cols
[2024-05-29 17:20:05] [INFO ] Computed 34 invariants in 0 ms
[2024-05-29 17:20:05] [INFO ] Implicit Places using invariants in 340 ms returned [71]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 342 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/211 places, 64/190 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 77 transition count 62
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 75 transition count 62
Applied a total of 4 rules in 6 ms. Remains 75 /77 variables (removed 2) and now considering 62/64 (removed 2) transitions.
// Phase 1: matrix 62 rows 75 cols
[2024-05-29 17:20:05] [INFO ] Computed 33 invariants in 4 ms
[2024-05-29 17:20:05] [INFO ] Implicit Places using invariants in 50 ms returned [58, 62]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 50 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 73/211 places, 62/190 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 71 transition count 60
Applied a total of 4 rules in 3 ms. Remains 71 /73 variables (removed 2) and now considering 60/62 (removed 2) transitions.
// Phase 1: matrix 60 rows 71 cols
[2024-05-29 17:20:05] [INFO ] Computed 31 invariants in 0 ms
[2024-05-29 17:20:05] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-29 17:20:05] [INFO ] Invariant cache hit.
[2024-05-29 17:20:05] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-29 17:20:05] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 71/211 places, 60/190 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 646 ms. Remains : 71/211 places, 60/190 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLFireability-06
Stuttering criterion allowed to conclude after 27631 steps with 0 reset in 58 ms.
FORMULA ShieldPPPt-PT-003B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-003B-LTLFireability-06 finished in 808 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(G(p1)))))'
Support contains 2 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 190/190 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 202 transition count 181
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 202 transition count 181
Applied a total of 18 rules in 5 ms. Remains 202 /211 variables (removed 9) and now considering 181/190 (removed 9) transitions.
// Phase 1: matrix 181 rows 202 cols
[2024-05-29 17:20:05] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 17:20:06] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-29 17:20:06] [INFO ] Invariant cache hit.
[2024-05-29 17:20:06] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2024-05-29 17:20:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:20:07] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-29 17:20:07] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-29 17:20:07] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:20:07] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 1 ms to minimize.
[2024-05-29 17:20:07] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:20:07] [INFO ] Deduced a trap composed of 16 places in 17 ms of which 0 ms to minimize.
[2024-05-29 17:20:07] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:20:07] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-29 17:20:07] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-29 17:20:07] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:20:07] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2024-05-29 17:20:08] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:20:08] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-29 17:20:08] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-29 17:20:08] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:20:08] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:20:08] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:20:08] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-29 17:20:08] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-29 17:20:08] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (OVERLAPS) 181/383 variables, 202/256 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:20:10] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:20:11] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-29 17:20:11] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:20:13] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/383 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:20:16] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/383 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 12 (OVERLAPS) 0/383 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 261 constraints, problems are : Problem set: 0 solved, 180 unsolved in 13949 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 25/59 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:20:21] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 181/383 variables, 202/262 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 180/442 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:20:23] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:20:23] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:20:23] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-29 17:20:23] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-05-29 17:20:23] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 2 ms to minimize.
[2024-05-29 17:20:23] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-29 17:20:24] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-29 17:20:24] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-29 17:20:24] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-05-29 17:20:24] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 10/452 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:20:26] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:20:28] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 11 (OVERLAPS) 0/383 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 454 constraints, problems are : Problem set: 0 solved, 180 unsolved in 15922 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 38/38 constraints]
After SMT, in 29884ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 29886ms
Starting structural reductions in LTL mode, iteration 1 : 202/211 places, 181/190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30076 ms. Remains : 202/211 places, 181/190 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-003B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-003B-LTLFireability-07 finished in 30243 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 190/190 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 210 transition count 144
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 91 place count 165 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 164 transition count 143
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 92 place count 164 transition count 122
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 134 place count 143 transition count 122
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 140 place count 137 transition count 116
Iterating global reduction 3 with 6 rules applied. Total rules applied 146 place count 137 transition count 116
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 146 place count 137 transition count 114
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 150 place count 135 transition count 114
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 246 place count 87 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 247 place count 87 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 249 place count 86 transition count 64
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 265 place count 78 transition count 64
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 267 place count 76 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 268 place count 75 transition count 62
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 268 place count 75 transition count 60
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 272 place count 73 transition count 60
Applied a total of 272 rules in 31 ms. Remains 73 /211 variables (removed 138) and now considering 60/190 (removed 130) transitions.
// Phase 1: matrix 60 rows 73 cols
[2024-05-29 17:20:36] [INFO ] Computed 33 invariants in 1 ms
[2024-05-29 17:20:36] [INFO ] Implicit Places using invariants in 158 ms returned [56, 60]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 168 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/211 places, 60/190 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 69 transition count 58
Applied a total of 4 rules in 2 ms. Remains 69 /71 variables (removed 2) and now considering 58/60 (removed 2) transitions.
// Phase 1: matrix 58 rows 69 cols
[2024-05-29 17:20:36] [INFO ] Computed 31 invariants in 2 ms
[2024-05-29 17:20:36] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-29 17:20:36] [INFO ] Invariant cache hit.
[2024-05-29 17:20:36] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 69/211 places, 58/190 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 328 ms. Remains : 69/211 places, 58/190 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLFireability-09
Product exploration explored 100000 steps with 205 reset in 169 ms.
Product exploration explored 100000 steps with 209 reset in 218 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 935 steps (0 resets) in 13 ms. (66 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 172 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 58/58 transitions.
Applied a total of 0 rules in 1 ms. Remains 69 /69 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2024-05-29 17:20:37] [INFO ] Invariant cache hit.
[2024-05-29 17:20:37] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-29 17:20:37] [INFO ] Invariant cache hit.
[2024-05-29 17:20:37] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-05-29 17:20:37] [INFO ] Redundant transitions in 1 ms returned []
Running 54 sub problems to find dead transitions.
[2024-05-29 17:20:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 2/69 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 58/127 variables, 69/100 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 0/127 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 100 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1043 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 2/69 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 58/127 variables, 69/100 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 54/154 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 0/127 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 154 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1441 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
After SMT, in 2503ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 2504ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2636 ms. Remains : 69/69 places, 58/58 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1554 steps (0 resets) in 8 ms. (172 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 201 reset in 168 ms.
Product exploration explored 100000 steps with 195 reset in 215 ms.
Built C files in :
/tmp/ltsmin1033020148182820456
[2024-05-29 17:20:41] [INFO ] Computing symmetric may disable matrix : 58 transitions.
[2024-05-29 17:20:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:20:41] [INFO ] Computing symmetric may enable matrix : 58 transitions.
[2024-05-29 17:20:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:20:41] [INFO ] Computing Do-Not-Accords matrix : 58 transitions.
[2024-05-29 17:20:41] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:20:41] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1033020148182820456
Running compilation step : cd /tmp/ltsmin1033020148182820456;'/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 359 ms.
Running link step : cd /tmp/ltsmin1033020148182820456;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1033020148182820456;'/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/stateBased8333106074917998799.hoa' '--buchi-type=spotba'
LTSmin run took 1495 ms.
FORMULA ShieldPPPt-PT-003B-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPt-PT-003B-LTLFireability-09 finished in 6791 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 190/190 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 203 transition count 182
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 203 transition count 182
Applied a total of 16 rules in 4 ms. Remains 203 /211 variables (removed 8) and now considering 182/190 (removed 8) transitions.
// Phase 1: matrix 182 rows 203 cols
[2024-05-29 17:20:43] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 17:20:43] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-29 17:20:43] [INFO ] Invariant cache hit.
[2024-05-29 17:20:43] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-29 17:20:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:20:45] [INFO ] Deduced a trap composed of 16 places in 574 ms of which 1 ms to minimize.
[2024-05-29 17:20:45] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:20:45] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-29 17:20:45] [INFO ] Deduced a trap composed of 19 places in 16 ms of which 0 ms to minimize.
[2024-05-29 17:20:45] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:20:45] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:20:45] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:20:45] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 2 ms to minimize.
[2024-05-29 17:20:45] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:20:45] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-29 17:20:45] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2024-05-29 17:20:45] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-29 17:20:45] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:20:45] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-05-29 17:20:45] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:20:45] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:20:46] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:20:46] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:20:46] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-29 17:20:46] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:20:46] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:20:46] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-29 17:20:46] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:20:47] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (OVERLAPS) 182/385 variables, 203/261 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:20:50] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:20:50] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:20:52] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (OVERLAPS) 0/385 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 264 constraints, problems are : Problem set: 0 solved, 181 unsolved in 12355 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 27/61 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/385 variables, 203/264 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 181/445 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:20:57] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-29 17:20:57] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-29 17:20:58] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-29 17:20:58] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-29 17:20:58] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:20:58] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-29 17:20:58] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-29 17:20:58] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-05-29 17:20:58] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-29 17:20:59] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 5 ms to minimize.
[2024-05-29 17:20:59] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-29 17:20:59] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 12/457 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:21:01] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:21:03] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-05-29 17:21:04] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 2/460 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:21:06] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 1/461 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:21:12] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 4 ms to minimize.
[2024-05-29 17:21:13] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/385 variables, 2/463 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:21:15] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/385 variables, 1/464 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/385 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 14 (OVERLAPS) 0/385 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 385/385 variables, and 464 constraints, problems are : Problem set: 0 solved, 181 unsolved in 28506 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 46/46 constraints]
After SMT, in 40877ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 40879ms
Starting structural reductions in LTL mode, iteration 1 : 203/211 places, 182/190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41077 ms. Remains : 203/211 places, 182/190 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-003B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-003B-LTLFireability-10 finished in 41192 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)||(!p0&&F(G(p1)))))'
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 190/190 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 210 transition count 146
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 86 place count 167 transition count 146
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 86 place count 167 transition count 124
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 130 place count 145 transition count 124
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 137 place count 138 transition count 117
Iterating global reduction 2 with 7 rules applied. Total rules applied 144 place count 138 transition count 117
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 144 place count 138 transition count 114
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 150 place count 135 transition count 114
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 240 place count 90 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 241 place count 90 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 243 place count 89 transition count 67
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 259 place count 81 transition count 67
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 260 place count 81 transition count 67
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 262 place count 79 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 263 place count 78 transition count 65
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 263 place count 78 transition count 63
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 267 place count 76 transition count 63
Applied a total of 267 rules in 21 ms. Remains 76 /211 variables (removed 135) and now considering 63/190 (removed 127) transitions.
// Phase 1: matrix 63 rows 76 cols
[2024-05-29 17:21:24] [INFO ] Computed 33 invariants in 1 ms
[2024-05-29 17:21:24] [INFO ] Implicit Places using invariants in 54 ms returned [56, 60]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 55 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/211 places, 63/190 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 72 transition count 61
Applied a total of 4 rules in 2 ms. Remains 72 /74 variables (removed 2) and now considering 61/63 (removed 2) transitions.
// Phase 1: matrix 61 rows 72 cols
[2024-05-29 17:21:24] [INFO ] Computed 31 invariants in 1 ms
[2024-05-29 17:21:24] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-29 17:21:24] [INFO ] Invariant cache hit.
[2024-05-29 17:21:24] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 72/211 places, 61/190 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 186 ms. Remains : 72/211 places, 61/190 transitions.
Stuttering acceptance computed with spot in 117 ms :[p0, true, (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 172 ms.
Stack based approach found an accepted trace after 297 steps with 0 reset with depth 298 and stack size 297 in 0 ms.
FORMULA ShieldPPPt-PT-003B-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-003B-LTLFireability-11 finished in 490 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (F(p1) U (p0 U (X((X(p2) U p3))||p1))))))'
Support contains 6 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 190/190 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 204 transition count 183
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 204 transition count 183
Applied a total of 14 rules in 4 ms. Remains 204 /211 variables (removed 7) and now considering 183/190 (removed 7) transitions.
// Phase 1: matrix 183 rows 204 cols
[2024-05-29 17:21:24] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 17:21:24] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-29 17:21:24] [INFO ] Invariant cache hit.
[2024-05-29 17:21:24] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 182 sub problems to find dead transitions.
[2024-05-29 17:21:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:21:26] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-29 17:21:26] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-29 17:21:26] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-29 17:21:26] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-29 17:21:26] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-29 17:21:26] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-29 17:21:26] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:21:26] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:21:26] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-29 17:21:26] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:21:26] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:21:26] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:21:26] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-29 17:21:26] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:21:26] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:21:27] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-29 17:21:27] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-29 17:21:27] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:21:27] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-05-29 17:21:27] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:21:27] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-29 17:21:27] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:21:27] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:21:27] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-29 17:21:28] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:21:28] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 183/387 variables, 204/264 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:21:29] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:21:31] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:21:32] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:21:34] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 11 (OVERLAPS) 0/387 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 268 constraints, problems are : Problem set: 0 solved, 182 unsolved in 12377 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 30/64 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:21:38] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 183/387 variables, 204/269 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 182/451 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:21:40] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-29 17:21:40] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 2 ms to minimize.
[2024-05-29 17:21:40] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:21:40] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 2 ms to minimize.
[2024-05-29 17:21:41] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 5/456 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:21:42] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-29 17:21:43] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:21:44] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 3/459 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:21:46] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:21:48] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-29 17:21:49] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-29 17:21:49] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-29 17:21:49] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 4/464 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 12 (OVERLAPS) 0/387 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 464 constraints, problems are : Problem set: 0 solved, 182 unsolved in 19723 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 44/44 constraints]
After SMT, in 32114ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 32116ms
Starting structural reductions in LTL mode, iteration 1 : 204/211 places, 183/190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32324 ms. Remains : 204/211 places, 183/190 transitions.
Stuttering acceptance computed with spot in 326 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLFireability-12
Product exploration explored 100000 steps with 277 reset in 152 ms.
Stack based approach found an accepted trace after 1133 steps with 3 reset with depth 334 and stack size 334 in 3 ms.
FORMULA ShieldPPPt-PT-003B-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-003B-LTLFireability-12 finished in 32831 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(!p0) U (G((G(p1)||F(!p0)))||(p1&&(G(p1)||F(!p0)))))))))'
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 190/190 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 202 transition count 181
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 202 transition count 181
Applied a total of 18 rules in 6 ms. Remains 202 /211 variables (removed 9) and now considering 181/190 (removed 9) transitions.
// Phase 1: matrix 181 rows 202 cols
[2024-05-29 17:21:57] [INFO ] Computed 34 invariants in 2 ms
[2024-05-29 17:21:57] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-29 17:21:57] [INFO ] Invariant cache hit.
[2024-05-29 17:21:57] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2024-05-29 17:21:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:21:59] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:21:59] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-29 17:21:59] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:21:59] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 0 ms to minimize.
[2024-05-29 17:21:59] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:21:59] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-05-29 17:21:59] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:21:59] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-29 17:21:59] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:21:59] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-29 17:21:59] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-05-29 17:21:59] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-05-29 17:21:59] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-29 17:21:59] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-29 17:21:59] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:21:59] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:21:59] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-29 17:22:00] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:22:00] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:22:00] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (OVERLAPS) 181/383 variables, 202/256 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:22:01] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:22:02] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:22:03] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:22:05] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/383 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:22:08] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/383 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 12 (OVERLAPS) 0/383 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 261 constraints, problems are : Problem set: 0 solved, 180 unsolved in 14214 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 25/59 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:22:13] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 181/383 variables, 202/262 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 180/442 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:22:14] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-29 17:22:15] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2024-05-29 17:22:15] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-29 17:22:15] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 2 ms to minimize.
[2024-05-29 17:22:15] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-29 17:22:15] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 2 ms to minimize.
[2024-05-29 17:22:15] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-29 17:22:15] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-29 17:22:16] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-29 17:22:16] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 10/452 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:22:18] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:22:20] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 11 (OVERLAPS) 0/383 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 454 constraints, problems are : Problem set: 0 solved, 180 unsolved in 15709 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 38/38 constraints]
After SMT, in 29937ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 29939ms
Starting structural reductions in LTL mode, iteration 1 : 202/211 places, 181/190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30142 ms. Remains : 202/211 places, 181/190 transitions.
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), p0, (AND p0 (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLFireability-13
Product exploration explored 100000 steps with 25000 reset in 75 ms.
Product exploration explored 100000 steps with 25000 reset in 78 ms.
Computed a total of 46 stabilizing places and 46 stable transitions
Computed a total of 46 stabilizing places and 46 stable transitions
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 100 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), p0, (AND p0 (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 3243 steps (0 resets) in 45 ms. (70 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 196 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), p0, (AND p0 (NOT p1))]
Support contains 3 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 181/181 transitions.
Applied a total of 0 rules in 3 ms. Remains 202 /202 variables (removed 0) and now considering 181/181 (removed 0) transitions.
[2024-05-29 17:22:29] [INFO ] Invariant cache hit.
[2024-05-29 17:22:29] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-29 17:22:29] [INFO ] Invariant cache hit.
[2024-05-29 17:22:29] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2024-05-29 17:22:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:22:30] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:22:30] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:22:30] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:22:30] [INFO ] Deduced a trap composed of 19 places in 17 ms of which 0 ms to minimize.
[2024-05-29 17:22:30] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:22:30] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
[2024-05-29 17:22:30] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:22:30] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-29 17:22:31] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-29 17:22:31] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:22:31] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:22:31] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:22:31] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:22:31] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-29 17:22:31] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-29 17:22:31] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:22:31] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:22:31] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-29 17:22:31] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-29 17:22:31] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (OVERLAPS) 181/383 variables, 202/256 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:22:33] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:22:34] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:22:34] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:22:37] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/383 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:22:40] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/383 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 12 (OVERLAPS) 0/383 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 261 constraints, problems are : Problem set: 0 solved, 180 unsolved in 13912 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 25/59 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:22:44] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 181/383 variables, 202/262 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 180/442 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:22:46] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-29 17:22:46] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-29 17:22:46] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
[2024-05-29 17:22:46] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-29 17:22:46] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-29 17:22:46] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
[2024-05-29 17:22:47] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-29 17:22:47] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 2 ms to minimize.
[2024-05-29 17:22:47] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-29 17:22:47] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 10/452 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:22:49] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:22:51] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 11 (OVERLAPS) 0/383 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 454 constraints, problems are : Problem set: 0 solved, 180 unsolved in 15636 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 38/38 constraints]
After SMT, in 29561ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 29562ms
Finished structural reductions in LTL mode , in 1 iterations and 29760 ms. Remains : 202/202 places, 181/181 transitions.
Computed a total of 46 stabilizing places and 46 stable transitions
Computed a total of 46 stabilizing places and 46 stable transitions
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), p0, (AND p0 (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 1665 steps (0 resets) in 17 ms. (92 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 169 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 278 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), p0, (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 79 ms.
Product exploration explored 100000 steps with 25000 reset in 83 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), p0, (AND p0 (NOT p1))]
Support contains 3 out of 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 181/181 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 202 transition count 181
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 42 place count 202 transition count 192
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 56 place count 202 transition count 192
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 111 places in 0 ms
Iterating global reduction 1 with 55 rules applied. Total rules applied 111 place count 202 transition count 192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 112 place count 202 transition count 191
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 135 place count 179 transition count 168
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 2 with 23 rules applied. Total rules applied 158 place count 179 transition count 168
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 159 place count 179 transition count 168
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 161 place count 177 transition count 166
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 177 transition count 166
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 98 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 174 place count 177 transition count 210
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 185 place count 166 transition count 188
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 196 place count 166 transition count 188
Deduced a syphon composed of 87 places in 0 ms
Applied a total of 196 rules in 36 ms. Remains 166 /202 variables (removed 36) and now considering 188/181 (removed -7) transitions.
[2024-05-29 17:23:00] [INFO ] Redundant transitions in 5 ms returned []
Running 187 sub problems to find dead transitions.
// Phase 1: matrix 188 rows 166 cols
[2024-05-29 17:23:00] [INFO ] Computed 34 invariants in 3 ms
[2024-05-29 17:23:00] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-29 17:23:01] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:23:01] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
[2024-05-29 17:23:01] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-29 17:23:01] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
[2024-05-29 17:23:01] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
[2024-05-29 17:23:02] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-29 17:23:02] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
[2024-05-29 17:23:02] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
[2024-05-29 17:23:02] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-29 17:23:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
[2024-05-29 17:23:02] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-05-29 17:23:02] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
[2024-05-29 17:23:02] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-29 17:23:02] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-05-29 17:23:02] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
[2024-05-29 17:23:02] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
[2024-05-29 17:23:02] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-05-29 17:23:02] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
[2024-05-29 17:23:02] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-05-29 17:23:02] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 20/54 constraints. Problems are: Problem set: 112 solved, 75 unsolved
[2024-05-29 17:23:02] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
[2024-05-29 17:23:02] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-05-29 17:23:02] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
[2024-05-29 17:23:02] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD62 is UNSAT
[2024-05-29 17:23:02] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD63 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 5/59 constraints. Problems are: Problem set: 123 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/59 constraints. Problems are: Problem set: 123 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 188/354 variables, 166/225 constraints. Problems are: Problem set: 123 solved, 64 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 19/244 constraints. Problems are: Problem set: 123 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 0/244 constraints. Problems are: Problem set: 123 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/354 variables, 0/244 constraints. Problems are: Problem set: 123 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 244 constraints, problems are : Problem set: 123 solved, 64 unsolved in 3062 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 166/166 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 123 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 123 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 88/166 variables, 34/34 constraints. Problems are: Problem set: 123 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 25/59 constraints. Problems are: Problem set: 123 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/59 constraints. Problems are: Problem set: 123 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 188/354 variables, 166/225 constraints. Problems are: Problem set: 123 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 19/244 constraints. Problems are: Problem set: 123 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 64/308 constraints. Problems are: Problem set: 123 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 0/308 constraints. Problems are: Problem set: 123 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/354 variables, 0/308 constraints. Problems are: Problem set: 123 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 308 constraints, problems are : Problem set: 123 solved, 64 unsolved in 2721 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 166/166 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 64/187 constraints, Known Traps: 25/25 constraints]
After SMT, in 5836ms problems are : Problem set: 123 solved, 64 unsolved
Search for dead transitions found 123 dead transitions in 5838ms
Found 123 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 123 transitions
Dead transitions reduction (with SMT) removed 123 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 166/202 places, 65/181 transitions.
Graph (complete) has 217 edges and 166 vertex of which 79 are kept as prefixes of interest. Removing 87 places using SCC suffix rule.2 ms
Discarding 87 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 79 /166 variables (removed 87) and now considering 65/65 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 79/202 places, 65/181 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5890 ms. Remains : 79/202 places, 65/181 transitions.
Built C files in :
/tmp/ltsmin3312911868134281812
[2024-05-29 17:23:06] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3312911868134281812
Running compilation step : cd /tmp/ltsmin3312911868134281812;'/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 313 ms.
Running link step : cd /tmp/ltsmin3312911868134281812;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin3312911868134281812;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13894297267315751887.hoa' '--buchi-type=spotba'
LTSmin run took 525 ms.
FORMULA ShieldPPPt-PT-003B-LTLFireability-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPt-PT-003B-LTLFireability-13 finished in 70067 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(F(((p2&&F(p3))||p1))))))'
Support contains 5 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 190/190 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 210 transition count 146
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 86 place count 167 transition count 146
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 86 place count 167 transition count 123
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 132 place count 144 transition count 123
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 140 place count 136 transition count 115
Iterating global reduction 2 with 8 rules applied. Total rules applied 148 place count 136 transition count 115
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 148 place count 136 transition count 112
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 154 place count 133 transition count 112
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 240 place count 90 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 241 place count 90 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 243 place count 89 transition count 67
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 259 place count 81 transition count 67
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 261 place count 79 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 262 place count 78 transition count 65
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 262 place count 78 transition count 63
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 266 place count 76 transition count 63
Applied a total of 266 rules in 26 ms. Remains 76 /211 variables (removed 135) and now considering 63/190 (removed 127) transitions.
// Phase 1: matrix 63 rows 76 cols
[2024-05-29 17:23:07] [INFO ] Computed 33 invariants in 1 ms
[2024-05-29 17:23:07] [INFO ] Implicit Places using invariants in 51 ms returned [59, 63]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 52 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/211 places, 63/190 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 72 transition count 61
Applied a total of 4 rules in 3 ms. Remains 72 /74 variables (removed 2) and now considering 61/63 (removed 2) transitions.
// Phase 1: matrix 61 rows 72 cols
[2024-05-29 17:23:07] [INFO ] Computed 31 invariants in 1 ms
[2024-05-29 17:23:07] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-29 17:23:07] [INFO ] Invariant cache hit.
[2024-05-29 17:23:07] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 72/211 places, 61/190 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 186 ms. Remains : 72/211 places, 61/190 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLFireability-15
Product exploration explored 100000 steps with 250 reset in 169 ms.
Product exploration explored 100000 steps with 259 reset in 186 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p2 p1 p3), (X p2), (X p3), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT (AND p2 (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X p0), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 111 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter insensitive) to 3 states, 8 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3))]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 7743 steps (0 resets) in 66 ms. (115 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND p0 p2 p1 p3), (X p2), (X p3), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT (AND p2 (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X p0), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p1 p3 (NOT p2)))), (F (NOT (OR p0 p1 p3 (NOT p2)))), (F (NOT (OR p0 p1 p3))), (F (NOT (OR p0 p1 p2))), (F (NOT p2)), (F (NOT (OR (NOT p0) p1 p3))), (F (NOT p3)), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 19 factoid took 399 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter insensitive) to 3 states, 8 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 149 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3))]
Support contains 5 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 61/61 transitions.
Applied a total of 0 rules in 4 ms. Remains 72 /72 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-05-29 17:23:09] [INFO ] Invariant cache hit.
[2024-05-29 17:23:09] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-29 17:23:09] [INFO ] Invariant cache hit.
[2024-05-29 17:23:09] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-05-29 17:23:09] [INFO ] Redundant transitions in 1 ms returned []
Running 55 sub problems to find dead transitions.
[2024-05-29 17:23:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 4/72 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (OVERLAPS) 61/133 variables, 72/103 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 0/133 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 103 constraints, problems are : Problem set: 0 solved, 55 unsolved in 711 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 4/72 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (OVERLAPS) 61/133 variables, 72/103 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 0/133 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 158 constraints, problems are : Problem set: 0 solved, 55 unsolved in 804 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints]
After SMT, in 1521ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 1523ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1649 ms. Remains : 72/72 places, 61/61 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1 p2 p3), (X p2), (X p3), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 115 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter insensitive) to 3 states, 8 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3))]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 3424 steps (0 resets) in 29 ms. (114 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND p0 p1 p2 p3), (X p2), (X p3), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p1 p3 (NOT p2)))), (F (NOT (OR p0 p1 p3 (NOT p2)))), (F (NOT (OR p0 p1 p3))), (F (NOT (OR p0 p1 p2))), (F (NOT p2)), (F (NOT (OR (NOT p0) p1 p3))), (F (NOT p3)), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 19 factoid took 464 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter insensitive) to 3 states, 8 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 130 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 146 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 239 reset in 169 ms.
Product exploration explored 100000 steps with 224 reset in 190 ms.
Built C files in :
/tmp/ltsmin8707095871342294154
[2024-05-29 17:23:12] [INFO ] Computing symmetric may disable matrix : 61 transitions.
[2024-05-29 17:23:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:23:12] [INFO ] Computing symmetric may enable matrix : 61 transitions.
[2024-05-29 17:23:12] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:23:12] [INFO ] Computing Do-Not-Accords matrix : 61 transitions.
[2024-05-29 17:23:12] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:23:12] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8707095871342294154
Running compilation step : cd /tmp/ltsmin8707095871342294154;'/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 171 ms.
Running link step : cd /tmp/ltsmin8707095871342294154;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin8707095871342294154;'/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/stateBased12646023744714944009.hoa' '--buchi-type=spotba'
LTSmin run took 92 ms.
FORMULA ShieldPPPt-PT-003B-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPt-PT-003B-LTLFireability-15 finished in 5166 ms.
All properties solved by simple procedures.
Total runtime 332480 ms.

BK_STOP 1717003392781

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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="ShieldPPPt-PT-003B"
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 ShieldPPPt-PT-003B, 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-171683761400572"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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