MCC'2024- Execution of r355-tall-171683758000084

About the Execution of GreatSPN+red for ShieldIIPs-PT-010A

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
11403.004	3600000.00	12508111.00	1970.70	FFFFFFF?FFTFFFFF	normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Apr 11 14:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 11 14:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 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 84K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716887963075

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-010A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 09:19:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 09:19:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 09:19:24] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2024-05-28 09:19:24] [INFO ] Transformed 253 places.
[2024-05-28 09:19:24] [INFO ] Transformed 243 transitions.
[2024-05-28 09:19:24] [INFO ] Found NUPN structural information;
[2024-05-28 09:19:24] [INFO ] Parsed PT model containing 253 places and 243 transitions and 1086 arcs in 200 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldIIPs-PT-010A-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010A-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010A-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010A-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 61 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Applied a total of 0 rules in 22 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
// Phase 1: matrix 243 rows 253 cols
[2024-05-28 09:19:24] [INFO ] Computed 91 invariants in 19 ms
[2024-05-28 09:19:25] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-05-28 09:19:25] [INFO ] Invariant cache hit.
[2024-05-28 09:19:25] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-05-28 09:19:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:19:28] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 10 ms to minimize.
[2024-05-28 09:19:28] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 2 ms to minimize.
[2024-05-28 09:19:28] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:19:29] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:19:29] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:19:29] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:19:29] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-05-28 09:19:29] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 2 ms to minimize.
[2024-05-28 09:19:29] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:19:30] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 10/354 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:19:30] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 243/496 variables, 253/608 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:19:33] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:19:33] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:19:34] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:19:34] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:19:34] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:19:34] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:19:35] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 7/615 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:19:35] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:19:36] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:19:36] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:19:36] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:19:36] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 2 ms to minimize.
[2024-05-28 09:19:36] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:19:36] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:19:37] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:19:37] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 9/624 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:19:39] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 1/625 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:19:41] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 1/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 13 (OVERLAPS) 0/496 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 626 constraints, problems are : Problem set: 0 solved, 242 unsolved in 21542 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 29/373 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 243/496 variables, 253/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 242/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (OVERLAPS) 0/496 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 496/496 variables, and 868 constraints, problems are : Problem set: 0 solved, 242 unsolved in 25407 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 29/29 constraints]
After SMT, in 47063ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 47080ms
Finished structural reductions in LTL mode , in 1 iterations and 47746 ms. Remains : 253/253 places, 243/243 transitions.
Support contains 61 out of 253 places after structural reductions.
[2024-05-28 09:20:12] [INFO ] Flatten gal took : 55 ms
[2024-05-28 09:20:12] [INFO ] Flatten gal took : 25 ms
[2024-05-28 09:20:12] [INFO ] Input system was already deterministic with 243 transitions.
Support contains 56 out of 253 places (down from 61) after GAL structural reductions.
RANDOM walk for 33499 steps (59 resets) in 1233 ms. (27 steps per ms) remains 0/29 properties
FORMULA ShieldIIPs-PT-010A-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U (p1||G(!p2)))))'
Support contains 4 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 252 transition count 241
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 250 transition count 241
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 249 transition count 240
Applied a total of 5 rules in 50 ms. Remains 249 /253 variables (removed 4) and now considering 240/243 (removed 3) transitions.
// Phase 1: matrix 240 rows 249 cols
[2024-05-28 09:20:13] [INFO ] Computed 90 invariants in 2 ms
[2024-05-28 09:20:13] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-28 09:20:13] [INFO ] Invariant cache hit.
[2024-05-28 09:20:14] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2024-05-28 09:20:14] [INFO ] Redundant transitions in 49 ms returned [232]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 238 sub problems to find dead transitions.
// Phase 1: matrix 239 rows 249 cols
[2024-05-28 09:20:14] [INFO ] Computed 90 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 90/339 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:20:15] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:20:15] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:20:15] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:20:15] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:20:15] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:20:15] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 4 ms to minimize.
[2024-05-28 09:20:15] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:20:15] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:20:16] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:20:16] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 10/349 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 239/488 variables, 249/598 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:20:19] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:20:19] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:20:19] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:20:19] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:20:19] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:20:19] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-28 09:20:19] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 7/605 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:20:20] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:20:20] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-28 09:20:21] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:20:21] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-28 09:20:21] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 2 ms to minimize.
[2024-05-28 09:20:21] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 6/611 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:20:24] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:20:24] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 2/613 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:20:25] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:20:26] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:20:26] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 3/616 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:20:27] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:20:28] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 2/618 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:20:31] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 1/619 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:20:31] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/488 variables, 1/620 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:20:33] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:20:33] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:20:33] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 2 ms to minimize.
[2024-05-28 09:20:33] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/488 variables, 4/624 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:20:36] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:20:36] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:20:36] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:20:36] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:20:36] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:20:37] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/488 variables, 6/630 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:20:38] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:20:38] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:20:38] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/488 variables, 3/633 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/488 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 488/488 variables, and 633 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30022 ms.
Refiners :[Domain max(s): 249/249 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 90/339 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 45/384 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 239/488 variables, 249/633 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 238/871 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:21:00] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/488 variables, 1/872 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/488 variables, and 872 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30023 ms.
Refiners :[Domain max(s): 249/249 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 46/46 constraints]
After SMT, in 60094ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 60097ms
Starting structural reductions in SI_LTL mode, iteration 1 : 249/253 places, 239/243 transitions.
Applied a total of 0 rules in 12 ms. Remains 249 /249 variables (removed 0) and now considering 239/239 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60603 ms. Remains : 249/253 places, 239/243 transitions.
Stuttering acceptance computed with spot in 299 ms :[(AND (NOT p1) p2), true, p2, (AND (NOT p1) p2)]
Running random walk in product with property : ShieldIIPs-PT-010A-LTLFireability-00
Entered a terminal (fully accepting) state of product in 437 steps with 0 reset in 11 ms.
FORMULA ShieldIIPs-PT-010A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010A-LTLFireability-00 finished in 60978 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((F(p0)&&X(G(p1))))))))'
Support contains 4 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Applied a total of 0 rules in 4 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
// Phase 1: matrix 243 rows 253 cols
[2024-05-28 09:21:14] [INFO ] Computed 91 invariants in 2 ms
[2024-05-28 09:21:14] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-28 09:21:14] [INFO ] Invariant cache hit.
[2024-05-28 09:21:14] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-05-28 09:21:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:21:17] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:21:18] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:21:18] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:21:18] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:21:18] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:21:18] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:21:18] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:21:18] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:21:18] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-28 09:21:19] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 10/354 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:21:19] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 243/496 variables, 253/608 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:21:22] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:21:22] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:21:23] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:21:23] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:21:23] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:21:23] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:21:24] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 7/615 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:21:24] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:21:24] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:21:24] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:21:25] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:21:25] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:21:25] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:21:25] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:21:26] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:21:26] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 9/624 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:21:28] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 1/625 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:21:30] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 1/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 13 (OVERLAPS) 0/496 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 626 constraints, problems are : Problem set: 0 solved, 242 unsolved in 20773 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 29/373 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 243/496 variables, 253/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 242/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (OVERLAPS) 0/496 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 496/496 variables, and 868 constraints, problems are : Problem set: 0 solved, 242 unsolved in 24367 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 29/29 constraints]
After SMT, in 45192ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 45195ms
Finished structural reductions in LTL mode , in 1 iterations and 45611 ms. Remains : 253/253 places, 243/243 transitions.
Stuttering acceptance computed with spot in 324 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ShieldIIPs-PT-010A-LTLFireability-02
Entered a terminal (fully accepting) state of product in 359 steps with 0 reset in 7 ms.
FORMULA ShieldIIPs-PT-010A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010A-LTLFireability-02 finished in 45961 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U X((X(F(p1))||(X(!p3)&&p2))))))'
Support contains 10 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Applied a total of 0 rules in 8 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2024-05-28 09:22:00] [INFO ] Invariant cache hit.
[2024-05-28 09:22:00] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-28 09:22:00] [INFO ] Invariant cache hit.
[2024-05-28 09:22:00] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-05-28 09:22:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:22:03] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:22:04] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:22:04] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:22:04] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-28 09:22:04] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2024-05-28 09:22:04] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:22:04] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:22:04] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:22:04] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:22:05] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 10/354 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:22:05] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 243/496 variables, 253/608 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:22:08] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:22:08] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:22:09] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:22:09] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:22:09] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:22:09] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:22:10] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 7/615 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:22:10] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:22:10] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:22:11] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:22:11] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:22:11] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:22:11] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:22:11] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-28 09:22:12] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:22:12] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 9/624 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:22:14] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 1/625 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:22:16] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 1/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 13 (OVERLAPS) 0/496 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 626 constraints, problems are : Problem set: 0 solved, 242 unsolved in 21126 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 29/373 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 243/496 variables, 253/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 242/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (OVERLAPS) 0/496 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 496/496 variables, and 868 constraints, problems are : Problem set: 0 solved, 242 unsolved in 24196 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 29/29 constraints]
After SMT, in 45364ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 45366ms
Finished structural reductions in LTL mode , in 1 iterations and 45740 ms. Remains : 253/253 places, 243/243 transitions.
Stuttering acceptance computed with spot in 584 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p3)), (NOT p1), (AND (NOT p1) p3), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p3)), (AND (NOT p1) p3), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-010A-LTLFireability-06
Stuttering criterion allowed to conclude after 2251 steps with 9 reset in 16 ms.
FORMULA ShieldIIPs-PT-010A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010A-LTLFireability-06 finished in 46376 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 1 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 252 transition count 241
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 250 transition count 241
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 249 transition count 240
Applied a total of 5 rules in 19 ms. Remains 249 /253 variables (removed 4) and now considering 240/243 (removed 3) transitions.
// Phase 1: matrix 240 rows 249 cols
[2024-05-28 09:22:46] [INFO ] Computed 90 invariants in 1 ms
[2024-05-28 09:22:47] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-28 09:22:47] [INFO ] Invariant cache hit.
[2024-05-28 09:22:47] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
[2024-05-28 09:22:47] [INFO ] Redundant transitions in 33 ms returned [232]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 238 sub problems to find dead transitions.
// Phase 1: matrix 239 rows 249 cols
[2024-05-28 09:22:47] [INFO ] Computed 90 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 90/339 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:22:48] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-28 09:22:48] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:22:48] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:22:49] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:22:49] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:22:49] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:22:49] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:22:49] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-05-28 09:22:49] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 1 ms to minimize.
[2024-05-28 09:22:50] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 10/349 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 239/488 variables, 249/598 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:22:52] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:22:52] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-28 09:22:52] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:22:52] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:22:52] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:22:52] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:22:53] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 7/605 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:22:54] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:22:54] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:22:54] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:22:54] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-05-28 09:22:54] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:22:54] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 6/611 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:22:57] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-28 09:22:58] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 2/613 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:22:59] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:22:59] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:22:59] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 3/616 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:23:01] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:23:02] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 2/618 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:23:04] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 1/619 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:23:05] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/488 variables, 1/620 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:23:06] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:23:06] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:23:06] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:23:07] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/488 variables, 4/624 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:23:09] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:23:09] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:23:09] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:23:10] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:23:10] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-28 09:23:10] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/488 variables, 6/630 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:23:11] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:23:12] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:23:12] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/488 variables, 3/633 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/488 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 488/488 variables, and 633 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30016 ms.
Refiners :[Domain max(s): 249/249 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 90/339 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 45/384 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 239/488 variables, 249/633 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 238/871 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:23:34] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/488 variables, 1/872 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/488 variables, and 872 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30024 ms.
Refiners :[Domain max(s): 249/249 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 46/46 constraints]
After SMT, in 60072ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 60074ms
Starting structural reductions in SI_LTL mode, iteration 1 : 249/253 places, 239/243 transitions.
Applied a total of 0 rules in 8 ms. Remains 249 /249 variables (removed 0) and now considering 239/239 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60684 ms. Remains : 249/253 places, 239/243 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-010A-LTLFireability-07
Product exploration explored 100000 steps with 359 reset in 395 ms.
Product exploration explored 100000 steps with 373 reset in 444 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 84 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 60 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 741 steps (0 resets) in 10 ms. (67 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 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 249/249 places, 239/239 transitions.
Applied a total of 0 rules in 10 ms. Remains 249 /249 variables (removed 0) and now considering 239/239 (removed 0) transitions.
[2024-05-28 09:23:48] [INFO ] Invariant cache hit.
[2024-05-28 09:23:49] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-28 09:23:49] [INFO ] Invariant cache hit.
[2024-05-28 09:23:49] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2024-05-28 09:23:49] [INFO ] Redundant transitions in 30 ms returned []
Running 238 sub problems to find dead transitions.
[2024-05-28 09:23:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 90/339 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:23:50] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:23:50] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:23:50] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:23:50] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:23:50] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:23:50] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:23:50] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:23:51] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 2 ms to minimize.
[2024-05-28 09:23:51] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2024-05-28 09:23:51] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 10/349 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 239/488 variables, 249/598 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:23:54] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:23:54] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:23:54] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:23:54] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:23:54] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:23:54] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:23:54] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:23:54] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:23:54] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-05-28 09:23:54] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:23:54] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:23:54] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 12/610 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:23:56] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:23:56] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 2/612 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:23:59] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:23:59] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:23:59] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:23:59] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 4/616 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:24:01] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 1/617 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:24:02] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 1/618 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:24:05] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 1/619 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:24:06] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:24:06] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:24:06] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/488 variables, 3/622 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:24:08] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:24:09] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/488 variables, 2/624 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/488 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 14 (OVERLAPS) 0/488 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 624 constraints, problems are : Problem set: 0 solved, 238 unsolved in 24993 ms.
Refiners :[Domain max(s): 249/249 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 90/339 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 36/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 239/488 variables, 249/624 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 238/862 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:24:26] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/488 variables, 1/863 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:24:41] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:24:41] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/488 variables, and 865 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30020 ms.
Refiners :[Domain max(s): 249/249 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 39/39 constraints]
After SMT, in 55044ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 55048ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 55452 ms. Remains : 249/249 places, 239/239 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 98 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 1953 steps (2 resets) in 24 ms. (78 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 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 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 378 reset in 322 ms.
Product exploration explored 100000 steps with 371 reset in 356 ms.
Support contains 1 out of 249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 249/249 places, 239/239 transitions.
Applied a total of 0 rules in 7 ms. Remains 249 /249 variables (removed 0) and now considering 239/239 (removed 0) transitions.
[2024-05-28 09:24:45] [INFO ] Invariant cache hit.
[2024-05-28 09:24:45] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-28 09:24:45] [INFO ] Invariant cache hit.
[2024-05-28 09:24:46] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2024-05-28 09:24:46] [INFO ] Redundant transitions in 25 ms returned []
Running 238 sub problems to find dead transitions.
[2024-05-28 09:24:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 90/339 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:24:47] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:24:47] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:24:47] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:24:47] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-28 09:24:47] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:24:47] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:24:47] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:24:47] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-05-28 09:24:47] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 2 ms to minimize.
[2024-05-28 09:24:48] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 10/349 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 239/488 variables, 249/598 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:24:50] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:24:50] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:24:50] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:24:50] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 2 ms to minimize.
[2024-05-28 09:24:51] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:24:51] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:24:51] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:24:51] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:24:51] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:24:51] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:24:51] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-28 09:24:51] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 12/610 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:24:53] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:24:53] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 2/612 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:24:55] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:24:56] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:24:56] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:24:56] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 4/616 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:24:57] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 1/617 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:24:59] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 1/618 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:25:02] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 1/619 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:25:02] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 0 ms to minimize.
[2024-05-28 09:25:03] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:25:03] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/488 variables, 3/622 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:25:04] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:25:06] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/488 variables, 2/624 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/488 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 14 (OVERLAPS) 0/488 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 624 constraints, problems are : Problem set: 0 solved, 238 unsolved in 24827 ms.
Refiners :[Domain max(s): 249/249 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 90/339 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 36/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 239/488 variables, 249/624 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 238/862 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:25:22] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/488 variables, 1/863 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:25:36] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:25:36] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/488 variables, and 865 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30009 ms.
Refiners :[Domain max(s): 249/249 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 39/39 constraints]
After SMT, in 54871ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 54873ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 55261 ms. Remains : 249/249 places, 239/239 transitions.
Treatment of property ShieldIIPs-PT-010A-LTLFireability-07 finished in 174072 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U G((p1||X(X(G(!p2)))))))'
Support contains 9 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Applied a total of 0 rules in 4 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
// Phase 1: matrix 243 rows 253 cols
[2024-05-28 09:25:40] [INFO ] Computed 91 invariants in 1 ms
[2024-05-28 09:25:41] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-28 09:25:41] [INFO ] Invariant cache hit.
[2024-05-28 09:25:41] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-05-28 09:25:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:25:44] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:25:44] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:25:44] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:25:44] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:25:44] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:25:44] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:25:44] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:25:44] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:25:44] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:25:45] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 10/354 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:25:45] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 243/496 variables, 253/608 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:25:49] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:25:49] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:25:49] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:25:49] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:25:49] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:25:50] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:25:50] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 7/615 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:25:51] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:25:51] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:25:51] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:25:51] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:25:51] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:25:51] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:25:51] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-28 09:25:52] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:25:52] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 9/624 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:25:55] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 1/625 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:25:56] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 1/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 13 (OVERLAPS) 0/496 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 626 constraints, problems are : Problem set: 0 solved, 242 unsolved in 20902 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 29/373 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 243/496 variables, 253/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 242/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (OVERLAPS) 0/496 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 496/496 variables, and 868 constraints, problems are : Problem set: 0 solved, 242 unsolved in 24364 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 29/29 constraints]
After SMT, in 45301ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 45303ms
Finished structural reductions in LTL mode , in 1 iterations and 45643 ms. Remains : 253/253 places, 243/243 transitions.
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p1) p2), p2, (AND p2 (NOT p1)), (AND (NOT p1) p2), p2, true, (AND (NOT p1) p2), (AND (NOT p1) p2)]
Running random walk in product with property : ShieldIIPs-PT-010A-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1564 steps with 2 reset in 12 ms.
FORMULA ShieldIIPs-PT-010A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010A-LTLFireability-08 finished in 45973 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)&&F((G(p1)||G(F(p2)))))))'
Support contains 5 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Applied a total of 0 rules in 2 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2024-05-28 09:26:26] [INFO ] Invariant cache hit.
[2024-05-28 09:26:27] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-28 09:26:27] [INFO ] Invariant cache hit.
[2024-05-28 09:26:27] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-05-28 09:26:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:26:30] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:26:30] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:26:30] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:26:30] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:26:30] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-05-28 09:26:30] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:26:30] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:26:31] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-28 09:26:31] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:26:31] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 10/354 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:26:32] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 243/496 variables, 253/608 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:26:35] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:26:35] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:26:35] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:26:35] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:26:35] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-28 09:26:36] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:26:36] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 7/615 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:26:37] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:26:37] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:26:37] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:26:37] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:26:37] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:26:37] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:26:37] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:26:38] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:26:39] [INFO ] Deduced a trap composed of 11 places in 16 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 9/624 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:26:41] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 1/625 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:26:43] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 1/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 13 (OVERLAPS) 0/496 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 626 constraints, problems are : Problem set: 0 solved, 242 unsolved in 21261 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 29/373 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 243/496 variables, 253/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 242/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (OVERLAPS) 0/496 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 496/496 variables, and 868 constraints, problems are : Problem set: 0 solved, 242 unsolved in 24923 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 29/29 constraints]
After SMT, in 46222ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 46224ms
Finished structural reductions in LTL mode , in 1 iterations and 46609 ms. Remains : 253/253 places, 243/243 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-010A-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-010A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010A-LTLFireability-09 finished in 46781 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 (!p1||G(!p0)))))'
Support contains 6 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Applied a total of 0 rules in 4 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2024-05-28 09:27:13] [INFO ] Invariant cache hit.
[2024-05-28 09:27:13] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-28 09:27:13] [INFO ] Invariant cache hit.
[2024-05-28 09:27:14] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-05-28 09:27:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:27:17] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:27:17] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:27:17] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:27:17] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-28 09:27:17] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:27:17] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:27:17] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:27:17] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:27:17] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:27:18] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 10/354 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:27:18] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 243/496 variables, 253/608 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:27:22] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:27:22] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:27:22] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:27:22] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:27:22] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:27:23] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:27:23] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 7/615 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:27:24] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:27:24] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:27:24] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:27:24] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:27:24] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:27:24] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:27:24] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:27:25] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:27:26] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 9/624 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:27:28] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 1/625 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:27:30] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 1/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 13 (OVERLAPS) 0/496 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 626 constraints, problems are : Problem set: 0 solved, 242 unsolved in 22109 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 29/373 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 243/496 variables, 253/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 242/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (OVERLAPS) 0/496 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 496/496 variables, and 868 constraints, problems are : Problem set: 0 solved, 242 unsolved in 25345 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 29/29 constraints]
After SMT, in 47496ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 47501ms
Finished structural reductions in LTL mode , in 1 iterations and 47877 ms. Remains : 253/253 places, 243/243 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (AND p1 p0), (AND p1 p0)]
Running random walk in product with property : ShieldIIPs-PT-010A-LTLFireability-10
Product exploration explored 100000 steps with 50000 reset in 465 ms.
Product exploration explored 100000 steps with 50000 reset in 491 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 17 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-010A-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-010A-LTLFireability-10 finished in 48967 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||G(p1))))'
Support contains 2 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Applied a total of 0 rules in 3 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2024-05-28 09:28:02] [INFO ] Invariant cache hit.
[2024-05-28 09:28:02] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-28 09:28:02] [INFO ] Invariant cache hit.
[2024-05-28 09:28:03] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-05-28 09:28:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:28:06] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:28:06] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:28:06] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:28:06] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-28 09:28:06] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:28:06] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:28:06] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:28:06] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:28:06] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 2 ms to minimize.
[2024-05-28 09:28:07] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 10/354 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:28:07] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 243/496 variables, 253/608 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:28:11] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:28:11] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:28:11] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:28:11] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:28:11] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:28:12] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:28:12] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 7/615 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:28:13] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:28:13] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:28:13] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-28 09:28:13] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:28:13] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:28:13] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:28:13] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:28:14] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:28:14] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 9/624 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:28:17] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 1/625 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:28:18] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 1/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 13 (OVERLAPS) 0/496 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 626 constraints, problems are : Problem set: 0 solved, 242 unsolved in 21329 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 29/373 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 243/496 variables, 253/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 242/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (OVERLAPS) 0/496 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 496/496 variables, and 868 constraints, problems are : Problem set: 0 solved, 242 unsolved in 24968 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 29/29 constraints]
After SMT, in 46344ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 46347ms
Finished structural reductions in LTL mode , in 1 iterations and 46693 ms. Remains : 253/253 places, 243/243 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-010A-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-010A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010A-LTLFireability-11 finished in 46837 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F(p1))))'
Support contains 6 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Applied a total of 0 rules in 3 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2024-05-28 09:28:49] [INFO ] Invariant cache hit.
[2024-05-28 09:28:49] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-28 09:28:49] [INFO ] Invariant cache hit.
[2024-05-28 09:28:49] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-05-28 09:28:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:28:52] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:28:53] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:28:53] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-05-28 09:28:53] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:28:53] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:28:53] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:28:53] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:28:53] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-28 09:28:53] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:28:54] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 10/354 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:28:54] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 243/496 variables, 253/608 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:28:58] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:28:58] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:28:58] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:28:58] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:28:58] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:28:58] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2024-05-28 09:28:59] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 7/615 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:28:59] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:29:00] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:29:00] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:29:00] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:29:00] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-28 09:29:00] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:29:00] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:29:01] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:29:01] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 9/624 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:29:04] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 1/625 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:29:05] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 1/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 13 (OVERLAPS) 0/496 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 626 constraints, problems are : Problem set: 0 solved, 242 unsolved in 21695 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 29/373 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 243/496 variables, 253/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 242/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (OVERLAPS) 0/496 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 496/496 variables, and 868 constraints, problems are : Problem set: 0 solved, 242 unsolved in 25740 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 29/29 constraints]
After SMT, in 47472ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 47478ms
Finished structural reductions in LTL mode , in 1 iterations and 47832 ms. Remains : 253/253 places, 243/243 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-010A-LTLFireability-12
Stuttering criterion allowed to conclude after 19409 steps with 216 reset in 67 ms.
FORMULA ShieldIIPs-PT-010A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010A-LTLFireability-12 finished in 48053 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((X(p1)&&p0))||(p2 U p3))))'
Support contains 10 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Applied a total of 0 rules in 5 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2024-05-28 09:29:37] [INFO ] Invariant cache hit.
[2024-05-28 09:29:37] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-28 09:29:37] [INFO ] Invariant cache hit.
[2024-05-28 09:29:37] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-05-28 09:29:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:29:41] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:29:41] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:29:41] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:29:41] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:29:41] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:29:41] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:29:41] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:29:41] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-28 09:29:41] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-28 09:29:42] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 10/354 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:29:42] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 243/496 variables, 253/608 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:29:46] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:29:46] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:29:46] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:29:46] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:29:46] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:29:47] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:29:47] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 7/615 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:29:47] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:29:48] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:29:48] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:29:48] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:29:48] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:29:48] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:29:48] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:29:49] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:29:49] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 9/624 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:29:52] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 1/625 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:29:53] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 1/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 13 (OVERLAPS) 0/496 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 626 constraints, problems are : Problem set: 0 solved, 242 unsolved in 21459 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 29/373 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 243/496 variables, 253/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 242/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (OVERLAPS) 0/496 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 496/496 variables, and 868 constraints, problems are : Problem set: 0 solved, 242 unsolved in 25090 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 29/29 constraints]
After SMT, in 46588ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 46590ms
Finished structural reductions in LTL mode , in 1 iterations and 46953 ms. Remains : 253/253 places, 243/243 transitions.
Stuttering acceptance computed with spot in 212 ms :[true, (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p3)]
Running random walk in product with property : ShieldIIPs-PT-010A-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-010A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010A-LTLFireability-14 finished in 47193 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 253 transition count 242
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 252 transition count 242
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 251 transition count 241
Applied a total of 4 rules in 14 ms. Remains 251 /253 variables (removed 2) and now considering 241/243 (removed 2) transitions.
// Phase 1: matrix 241 rows 251 cols
[2024-05-28 09:30:24] [INFO ] Computed 91 invariants in 1 ms
[2024-05-28 09:30:24] [INFO ] Implicit Places using invariants in 170 ms returned [237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 176 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 250/253 places, 241/243 transitions.
Applied a total of 0 rules in 6 ms. Remains 250 /250 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 197 ms. Remains : 250/253 places, 241/243 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-010A-LTLFireability-15
Stuttering criterion allowed to conclude after 585 steps with 0 reset in 7 ms.
FORMULA ShieldIIPs-PT-010A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010A-LTLFireability-15 finished in 253 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)))'
[2024-05-28 09:30:25] [INFO ] Flatten gal took : 20 ms
[2024-05-28 09:30:25] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-05-28 09:30:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 253 places, 243 transitions and 1086 arcs took 4 ms.
Total runtime 660993 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldIIPs-PT-010A

IS_COLORED=
IS_NUPN=

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

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

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

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

Process ID: 2382
MODEL NAME: /home/mcc/execution/411/model
253 places, 243 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ShieldIIPs-PT-010A, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r355-tall-171683758000084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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