Execution Chart

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

Trace from the execution

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

--------------------
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 1716890853068

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-010A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-28 10:07:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 10:07:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 10:07:34] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-05-28 10:07:34] [INFO ] Transformed 253 places.
[2024-05-28 10:07:34] [INFO ] Transformed 243 transitions.
[2024-05-28 10:07:34] [INFO ] Found NUPN structural information;
[2024-05-28 10:07:34] [INFO ] Parsed PT model containing 253 places and 243 transitions and 1086 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 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 18 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 10:07:34] [INFO ] Computed 91 invariants in 16 ms
[2024-05-28 10:07:34] [INFO ] Implicit Places using invariants in 308 ms returned []
[2024-05-28 10:07:34] [INFO ] Invariant cache hit.
[2024-05-28 10:07:35] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-05-28 10:07:35] [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 10:07:38] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 9 ms to minimize.
[2024-05-28 10:07:38] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-28 10:07:38] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-28 10:07:38] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:07:38] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-28 10:07:39] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:07:39] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-28 10:07:39] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 10:07:39] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 10:07:40] [INFO ] Deduced a trap composed of 8 places in 33 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 10:07:40] [INFO ] Deduced a trap composed of 15 places in 37 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 10:07:43] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-28 10:07:43] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-28 10:07:44] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-28 10:07:44] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 10:07:44] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:07:44] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-28 10:07:44] [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 10:07:45] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 5 ms to minimize.
[2024-05-28 10:07:45] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-28 10:07:45] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-28 10:07:45] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-28 10:07:45] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-28 10:07:46] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-28 10:07:46] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-28 10:07:47] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:07:47] [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 10:07:49] [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 10:07:51] [INFO ] Deduced a trap composed of 9 places in 26 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 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 23665 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 45095ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 45110ms
Finished structural reductions in LTL mode , in 1 iterations and 45752 ms. Remains : 253/253 places, 243/243 transitions.
Support contains 61 out of 253 places after structural reductions.
[2024-05-28 10:08:20] [INFO ] Flatten gal took : 55 ms
[2024-05-28 10:08:20] [INFO ] Flatten gal took : 25 ms
[2024-05-28 10:08:20] [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 27304 steps (48 resets) in 1112 ms. (24 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 2 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 2 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 51 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 10:08:21] [INFO ] Computed 90 invariants in 2 ms
[2024-05-28 10:08:21] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-28 10:08:21] [INFO ] Invariant cache hit.
[2024-05-28 10:08:21] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2024-05-28 10:08:21] [INFO ] Redundant transitions in 46 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 10:08:21] [INFO ] Computed 90 invariants in 3 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 10:08:23] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-28 10:08:23] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:08:23] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:08:23] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-28 10:08:23] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:08:23] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 4 ms to minimize.
[2024-05-28 10:08:23] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-28 10:08:23] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-28 10:08:23] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 2 ms to minimize.
[2024-05-28 10:08:24] [INFO ] Deduced a trap composed of 7 places in 28 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 10:08:26] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-28 10:08:26] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-28 10:08:26] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-28 10:08:27] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:08:27] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-28 10:08:27] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-28 10:08:27] [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 10:08:28] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 10:08:28] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-28 10:08:28] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 10:08:28] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-05-28 10:08:28] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 10:08:29] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 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 10:08:31] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:08:32] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 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 10:08:33] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-28 10:08:33] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-28 10:08:33] [INFO ] Deduced a trap composed of 12 places in 28 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 10:08:35] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 10:08:36] [INFO ] Deduced a trap composed of 16 places in 31 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 10:08:38] [INFO ] Deduced a trap composed of 14 places in 45 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 10:08:39] [INFO ] Deduced a trap composed of 8 places in 37 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 10:08:40] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 10:08:40] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 10:08:41] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:08:41] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 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 10:08:43] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-28 10:08:44] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-28 10:08:44] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 10:08:44] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 10:08:44] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-28 10:08:44] [INFO ] Deduced a trap composed of 17 places in 33 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 10:08:45] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:08:46] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-28 10:08:46] [INFO ] Deduced a trap composed of 14 places in 32 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
[2024-05-28 10:08:51] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/488 variables, 1/634 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 634 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30029 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]
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, 46/385 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 239/488 variables, 249/634 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 238/872 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 10:08:56] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2024-05-28 10:08:56] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 2/874 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 0/874 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 874 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30017 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: 48/48 constraints]
After SMT, in 60093ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 60107ms
Starting structural reductions in SI_LTL mode, iteration 1 : 249/253 places, 239/243 transitions.
Applied a total of 0 rules in 20 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 60584 ms. Remains : 249/253 places, 239/243 transitions.
Stuttering acceptance computed with spot in 265 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 1594 steps with 2 reset in 27 ms.
FORMULA ShieldIIPs-PT-010A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010A-LTLFireability-00 finished in 60947 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 10 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 10:09:22] [INFO ] Computed 91 invariants in 1 ms
[2024-05-28 10:09:22] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-28 10:09:22] [INFO ] Invariant cache hit.
[2024-05-28 10:09:22] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-05-28 10:09:22] [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 10:09:25] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:09:25] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:09:25] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-28 10:09:25] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-28 10:09:26] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2024-05-28 10:09:26] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:09:26] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 10:09:26] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-28 10:09:26] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-28 10:09:27] [INFO ] Deduced a trap composed of 8 places in 23 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 10:09:27] [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 10:09:30] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-28 10:09:30] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-28 10:09:30] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-28 10:09:31] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 10:09:31] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 10:09:31] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:09:31] [INFO ] Deduced a trap composed of 9 places in 29 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 10:09:32] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:09:32] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:09:32] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:09:32] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 10:09:32] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:09:32] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 10:09:33] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 10:09:34] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-28 10:09:34] [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 10:09:36] [INFO ] Deduced a trap composed of 9 places in 25 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 10:09:37] [INFO ] Deduced a trap composed of 9 places in 36 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 20505 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 23539 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 44091ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 44094ms
Finished structural reductions in LTL mode , in 1 iterations and 44479 ms. Remains : 253/253 places, 243/243 transitions.
Stuttering acceptance computed with spot in 424 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 369 steps with 0 reset in 6 ms.
FORMULA ShieldIIPs-PT-010A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010A-LTLFireability-02 finished in 44928 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 7 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2024-05-28 10:10:07] [INFO ] Invariant cache hit.
[2024-05-28 10:10:07] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-28 10:10:07] [INFO ] Invariant cache hit.
[2024-05-28 10:10:07] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-05-28 10:10:07] [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 10:10:10] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-28 10:10:10] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:10:10] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-28 10:10:10] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-28 10:10:10] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-28 10:10:11] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:10:11] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 10:10:11] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-28 10:10:11] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-28 10:10:12] [INFO ] Deduced a trap composed of 8 places in 18 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 10:10:12] [INFO ] Deduced a trap composed of 15 places in 27 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 10:10:15] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-28 10:10:15] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-28 10:10:15] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-28 10:10:16] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-28 10:10:16] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 10:10:16] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 10:10:16] [INFO ] Deduced a trap composed of 9 places in 29 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 10:10:17] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 10:10:17] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 10:10:17] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:10:17] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:10:17] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-28 10:10:17] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:10:18] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-28 10:10:19] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:10:19] [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 10:10:21] [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 10:10:23] [INFO ] Deduced a trap composed of 9 places in 28 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 20997 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 23728 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 44765ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 44768ms
Finished structural reductions in LTL mode , in 1 iterations and 45140 ms. Remains : 253/253 places, 243/243 transitions.
Stuttering acceptance computed with spot in 451 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 901 steps with 2 reset in 9 ms.
FORMULA ShieldIIPs-PT-010A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010A-LTLFireability-06 finished in 45627 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 22 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 10:10:52] [INFO ] Computed 90 invariants in 4 ms
[2024-05-28 10:10:52] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-28 10:10:52] [INFO ] Invariant cache hit.
[2024-05-28 10:10:53] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
[2024-05-28 10:10:53] [INFO ] Redundant transitions in 40 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 10:10:53] [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 10:10:54] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-28 10:10:54] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-28 10:10:54] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-28 10:10:54] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-28 10:10:54] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-28 10:10:54] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-28 10:10:54] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-28 10:10:55] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 2 ms to minimize.
[2024-05-28 10:10:55] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-05-28 10:10:55] [INFO ] Deduced a trap composed of 7 places in 24 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 10:10:58] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-28 10:10:58] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-28 10:10:58] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:10:58] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:10:58] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:10:58] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 10:10:58] [INFO ] Deduced a trap composed of 14 places in 46 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 10:10:59] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-28 10:10:59] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-28 10:11:00] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 10:11:00] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 10:11:00] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 10:11:00] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 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 10:11:03] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 10:11:04] [INFO ] Deduced a trap composed of 14 places in 40 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 10:11:05] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:11:05] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:11:05] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 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 10:11:06] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 10:11:07] [INFO ] Deduced a trap composed of 16 places in 24 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 10:11:10] [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 10:11:10] [INFO ] Deduced a trap composed of 8 places in 28 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 10:11:12] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-28 10:11:12] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-28 10:11:12] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-28 10:11:12] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 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 10:11:15] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-28 10:11:15] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:11:15] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-28 10:11:15] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 10:11:15] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-28 10:11:16] [INFO ] Deduced a trap composed of 17 places in 34 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 10:11:17] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 10:11:17] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-28 10:11:17] [INFO ] Deduced a trap composed of 14 places in 32 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
[2024-05-28 10:11:23] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
SMT process timed out in 30065ms, After SMT, problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 30069ms
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 30521 ms. Remains : 249/253 places, 239/243 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-010A-LTLFireability-07
Product exploration explored 100000 steps with 380 reset in 432 ms.
Product exploration explored 100000 steps with 369 reset in 486 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 168 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 56 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1107 steps (0 resets) in 12 ms. (85 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 94 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 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 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 9 ms. Remains 249 /249 variables (removed 0) and now considering 239/239 (removed 0) transitions.
[2024-05-28 10:11:24] [INFO ] Invariant cache hit.
[2024-05-28 10:11:25] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-28 10:11:25] [INFO ] Invariant cache hit.
[2024-05-28 10:11:25] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2024-05-28 10:11:25] [INFO ] Redundant transitions in 31 ms returned []
Running 238 sub problems to find dead transitions.
[2024-05-28 10:11:25] [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 10:11:26] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:11:26] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 10:11:26] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-28 10:11:26] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-28 10:11:26] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-28 10:11:26] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2024-05-28 10:11:26] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-28 10:11:27] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-28 10:11:27] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-05-28 10:11:27] [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 10:11:30] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-28 10:11:30] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 10:11:30] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-28 10:11:30] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-28 10:11:30] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:11:30] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:11:30] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:11:30] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-28 10:11:30] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 0 ms to minimize.
[2024-05-28 10:11:30] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-28 10:11:30] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:11:31] [INFO ] Deduced a trap composed of 8 places in 61 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 10:11:32] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-28 10:11:32] [INFO ] Deduced a trap composed of 12 places in 28 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 10:11:35] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-28 10:11:35] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-28 10:11:35] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 10:11:35] [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 10:11:37] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 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 10:11:38] [INFO ] Deduced a trap composed of 8 places in 27 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 10:11:41] [INFO ] Deduced a trap composed of 10 places in 26 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 10:11:42] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-28 10:11:42] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 10:11:42] [INFO ] Deduced a trap composed of 9 places in 34 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 10:11:44] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 10:11:45] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 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 25175 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 10:12:02] [INFO ] Deduced a trap composed of 8 places in 31 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 10:12:16] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 10:12:16] [INFO ] Deduced a trap composed of 14 places in 28 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 30018 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 55232ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 55236ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 55636 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 74 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 85 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 787 steps (0 resets) in 9 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 115 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 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 381 reset in 337 ms.
Product exploration explored 100000 steps with 369 reset in 366 ms.
Built C files in :
/tmp/ltsmin8648182864435039929
[2024-05-28 10:12:21] [INFO ] Computing symmetric may disable matrix : 239 transitions.
[2024-05-28 10:12:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:12:21] [INFO ] Computing symmetric may enable matrix : 239 transitions.
[2024-05-28 10:12:21] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:12:21] [INFO ] Computing Do-Not-Accords matrix : 239 transitions.
[2024-05-28 10:12:21] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:12:21] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8648182864435039929
Running compilation step : cd /tmp/ltsmin8648182864435039929;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 688 ms.
Running link step : cd /tmp/ltsmin8648182864435039929;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin8648182864435039929;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14259974278291238378.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 14 ms. Remains 249 /249 variables (removed 0) and now considering 239/239 (removed 0) transitions.
[2024-05-28 10:12:36] [INFO ] Invariant cache hit.
[2024-05-28 10:12:37] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-28 10:12:37] [INFO ] Invariant cache hit.
[2024-05-28 10:12:37] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2024-05-28 10:12:37] [INFO ] Redundant transitions in 32 ms returned []
Running 238 sub problems to find dead transitions.
[2024-05-28 10:12:37] [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 10:12:38] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-28 10:12:38] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:12:38] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2024-05-28 10:12:38] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-28 10:12:38] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-28 10:12:38] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-28 10:12:38] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-28 10:12:39] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-28 10:12:39] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 2 ms to minimize.
[2024-05-28 10:12:39] [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 10:12:41] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-05-28 10:12:42] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 2 ms to minimize.
[2024-05-28 10:12:42] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-28 10:12:42] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-28 10:12:42] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-28 10:12:42] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-28 10:12:42] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 10:12:42] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 10:12:42] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2024-05-28 10:12:42] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-28 10:12:42] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:12:42] [INFO ] Deduced a trap composed of 8 places in 33 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 10:12:44] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:12:44] [INFO ] Deduced a trap composed of 12 places in 35 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 10:12:47] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 10:12:47] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:12:47] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-28 10:12:47] [INFO ] Deduced a trap composed of 8 places in 28 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 10:12:48] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 4 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 10:12:50] [INFO ] Deduced a trap composed of 8 places in 27 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 10:12:53] [INFO ] Deduced a trap composed of 10 places in 28 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 10:12:54] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2024-05-28 10:12:54] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 10:12:54] [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 10:12:56] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 2 ms to minimize.
[2024-05-28 10:12:57] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 7 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 24638 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 10:13:13] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 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 10:13:27] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-28 10:13:27] [INFO ] Deduced a trap composed of 14 places in 45 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 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: 39/39 constraints]
After SMT, in 54700ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 54702ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 55095 ms. Remains : 249/249 places, 239/239 transitions.
Built C files in :
/tmp/ltsmin9429058000320164205
[2024-05-28 10:13:32] [INFO ] Computing symmetric may disable matrix : 239 transitions.
[2024-05-28 10:13:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:13:32] [INFO ] Computing symmetric may enable matrix : 239 transitions.
[2024-05-28 10:13:32] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:13:32] [INFO ] Computing Do-Not-Accords matrix : 239 transitions.
[2024-05-28 10:13:32] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:13:32] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9429058000320164205
Running compilation step : cd /tmp/ltsmin9429058000320164205;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 571 ms.
Running link step : cd /tmp/ltsmin9429058000320164205;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin9429058000320164205;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3742760272508323250.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 10:13:47] [INFO ] Flatten gal took : 17 ms
[2024-05-28 10:13:47] [INFO ] Flatten gal took : 15 ms
[2024-05-28 10:13:47] [INFO ] Time to serialize gal into /tmp/LTL1831666049470422941.gal : 5 ms
[2024-05-28 10:13:47] [INFO ] Time to serialize properties into /tmp/LTL14589088111206340388.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1831666049470422941.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8703479706467136153.hoa' '-atoms' '/tmp/LTL14589088111206340388.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL14589088111206340388.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8703479706467136153.hoa
Detected timeout of ITS tools.
[2024-05-28 10:14:02] [INFO ] Flatten gal took : 15 ms
[2024-05-28 10:14:02] [INFO ] Flatten gal took : 15 ms
[2024-05-28 10:14:02] [INFO ] Time to serialize gal into /tmp/LTL571071126146438132.gal : 4 ms
[2024-05-28 10:14:02] [INFO ] Time to serialize properties into /tmp/LTL3112666529757134020.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL571071126146438132.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3112666529757134020.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((G(F("(p166==0)"))))
Formula 0 simplified : FG!"(p166==0)"
Detected timeout of ITS tools.
[2024-05-28 10:14:17] [INFO ] Flatten gal took : 14 ms
[2024-05-28 10:14:17] [INFO ] Applying decomposition
[2024-05-28 10:14:17] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph181541984249900924.txt' '-o' '/tmp/graph181541984249900924.bin' '-w' '/tmp/graph181541984249900924.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph181541984249900924.bin' '-l' '-1' '-v' '-w' '/tmp/graph181541984249900924.weights' '-q' '0' '-e' '0.001'
[2024-05-28 10:14:17] [INFO ] Decomposing Gal with order
[2024-05-28 10:14:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 10:14:17] [INFO ] Removed a total of 155 redundant transitions.
[2024-05-28 10:14:17] [INFO ] Flatten gal took : 52 ms
[2024-05-28 10:14:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 152 labels/synchronizations in 10 ms.
[2024-05-28 10:14:17] [INFO ] Time to serialize gal into /tmp/LTL18193975284776067853.gal : 5 ms
[2024-05-28 10:14:17] [INFO ] Time to serialize properties into /tmp/LTL17449335157086680910.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18193975284776067853.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17449335157086680910.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F("(i6.i1.u60.p166==0)"))))
Formula 0 simplified : FG!"(i6.i1.u60.p166==0)"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-010A-LTLFireability-07 finished in 219803 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 2 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 10:14:32] [INFO ] Computed 91 invariants in 2 ms
[2024-05-28 10:14:32] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-28 10:14:32] [INFO ] Invariant cache hit.
[2024-05-28 10:14:33] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-05-28 10:14:33] [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 10:14:36] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:14:36] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:14:36] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:14:36] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 3 ms to minimize.
[2024-05-28 10:14:36] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 11 ms to minimize.
[2024-05-28 10:14:36] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2024-05-28 10:14:36] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-28 10:14:36] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-28 10:14:36] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-28 10:14:37] [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 10:14:37] [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 10:14:41] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-28 10:14:41] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-28 10:14:41] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 10:14:41] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 10:14:41] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 10:14:42] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 10:14:42] [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 10:14:43] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-28 10:14:43] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:14:43] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-28 10:14:43] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:14:43] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-28 10:14:43] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-28 10:14:43] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-28 10:14:44] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-05-28 10:14:44] [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 10:14:46] [INFO ] Deduced a trap composed of 9 places in 28 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 10:14:48] [INFO ] Deduced a trap composed of 9 places in 25 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 20915 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 23724 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 44695ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 44702ms
Finished structural reductions in LTL mode , in 1 iterations and 45080 ms. Remains : 253/253 places, 243/243 transitions.
Stuttering acceptance computed with spot in 299 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 19668 steps with 35 reset in 106 ms.
FORMULA ShieldIIPs-PT-010A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010A-LTLFireability-08 finished in 45517 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 3 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2024-05-28 10:15:18] [INFO ] Invariant cache hit.
[2024-05-28 10:15:18] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-28 10:15:18] [INFO ] Invariant cache hit.
[2024-05-28 10:15:18] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-05-28 10:15:18] [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 10:15:21] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-28 10:15:21] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-28 10:15:21] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-28 10:15:21] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-05-28 10:15:21] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:15:21] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:15:22] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:15:22] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 10:15:22] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-28 10:15:23] [INFO ] Deduced a trap composed of 8 places in 30 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 10:15:23] [INFO ] Deduced a trap composed of 15 places in 31 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 10:15:26] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:15:26] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-28 10:15:26] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 10:15:27] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 10:15:27] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:15:27] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 10:15:27] [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 10:15:28] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-28 10:15:28] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-28 10:15:28] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:15:28] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 10:15:28] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-28 10:15:28] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 10:15:29] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 10:15:30] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:15:30] [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 10:15:32] [INFO ] Deduced a trap composed of 9 places in 24 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 10:15:34] [INFO ] Deduced a trap composed of 9 places in 32 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 21003 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 24033 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 45074ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 45077ms
Finished structural reductions in LTL mode , in 1 iterations and 45442 ms. Remains : 253/253 places, 243/243 transitions.
Stuttering acceptance computed with spot in 175 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 0 ms.
FORMULA ShieldIIPs-PT-010A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010A-LTLFireability-09 finished in 45640 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 2 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2024-05-28 10:16:03] [INFO ] Invariant cache hit.
[2024-05-28 10:16:03] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-28 10:16:03] [INFO ] Invariant cache hit.
[2024-05-28 10:16:04] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-05-28 10:16:04] [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 10:16:07] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 10:16:07] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-28 10:16:07] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-28 10:16:07] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-05-28 10:16:07] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-05-28 10:16:07] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-28 10:16:07] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:16:07] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-28 10:16:07] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-28 10:16:08] [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 10:16:08] [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 10:16:12] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:16:12] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-28 10:16:12] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-28 10:16:12] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 10:16:12] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 10:16:13] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-28 10:16:13] [INFO ] Deduced a trap composed of 9 places in 27 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 10:16:14] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 10:16:14] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-28 10:16:14] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:16:14] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-28 10:16:14] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-28 10:16:14] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 10:16:14] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 10:16:15] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-28 10:16:15] [INFO ] Deduced a trap composed of 11 places in 24 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 10:16:17] [INFO ] Deduced a trap composed of 9 places in 24 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 10:16:19] [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 20853 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 23807 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 44705ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 44707ms
Finished structural reductions in LTL mode , in 1 iterations and 45067 ms. Remains : 253/253 places, 243/243 transitions.
Stuttering acceptance computed with spot in 113 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 458 ms.
Product exploration explored 100000 steps with 50000 reset in 488 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 19 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 46164 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 4 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2024-05-28 10:16:49] [INFO ] Invariant cache hit.
[2024-05-28 10:16:50] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-28 10:16:50] [INFO ] Invariant cache hit.
[2024-05-28 10:16:50] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-05-28 10:16:50] [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 10:16:53] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-28 10:16:53] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-28 10:16:53] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:16:53] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-28 10:16:53] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2024-05-28 10:16:53] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 10:16:53] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2024-05-28 10:16:53] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 10:16:54] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-28 10:16:54] [INFO ] Deduced a trap composed of 8 places in 29 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 10:16:55] [INFO ] Deduced a trap composed of 15 places in 32 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 10:16:58] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 10:16:58] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-28 10:16:58] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:16:58] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 10:16:58] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-28 10:16:59] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-28 10:16:59] [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 10:17:00] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-28 10:17:00] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-28 10:17:00] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-28 10:17:00] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:17:00] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-28 10:17:00] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-28 10:17:00] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 10:17:01] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-28 10:17:01] [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 10:17:04] [INFO ] Deduced a trap composed of 9 places in 24 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 10:17:05] [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 20641 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 23724 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 44409ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 44412ms
Finished structural reductions in LTL mode , in 1 iterations and 44789 ms. Remains : 253/253 places, 243/243 transitions.
Stuttering acceptance computed with spot in 119 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 1 ms.
FORMULA ShieldIIPs-PT-010A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010A-LTLFireability-11 finished in 44923 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 5 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2024-05-28 10:17:34] [INFO ] Invariant cache hit.
[2024-05-28 10:17:35] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-28 10:17:35] [INFO ] Invariant cache hit.
[2024-05-28 10:17:35] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-05-28 10:17:35] [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 10:17:38] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-28 10:17:38] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-05-28 10:17:38] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-28 10:17:38] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2024-05-28 10:17:38] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-28 10:17:38] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:17:38] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-28 10:17:38] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-28 10:17:39] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-28 10:17:39] [INFO ] Deduced a trap composed of 8 places in 27 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 10:17:40] [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 10:17:43] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-28 10:17:43] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-28 10:17:43] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-28 10:17:43] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 10:17:44] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-28 10:17:44] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 10:17:44] [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 10:17:45] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-28 10:17:45] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-28 10:17:45] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-28 10:17:45] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-28 10:17:45] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-28 10:17:45] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 10:17:45] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-28 10:17:46] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:17:47] [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 10:17:49] [INFO ] Deduced a trap composed of 9 places in 24 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 10:17:50] [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 20959 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 23502 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 44526ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 44528ms
Finished structural reductions in LTL mode , in 1 iterations and 44929 ms. Remains : 253/253 places, 243/243 transitions.
Stuttering acceptance computed with spot in 106 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 41041 steps with 507 reset in 122 ms.
FORMULA ShieldIIPs-PT-010A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010A-LTLFireability-12 finished in 45171 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 3 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2024-05-28 10:18:20] [INFO ] Invariant cache hit.
[2024-05-28 10:18:20] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-28 10:18:20] [INFO ] Invariant cache hit.
[2024-05-28 10:18:20] [INFO ] Implicit Places using invariants and state equation in 218 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 10:18:20] [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 10:18:23] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-28 10:18:23] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:18:23] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-28 10:18:23] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2024-05-28 10:18:23] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-05-28 10:18:23] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-28 10:18:24] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-28 10:18:24] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-28 10:18:24] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-05-28 10:18:24] [INFO ] Deduced a trap composed of 8 places in 28 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 10:18:25] [INFO ] Deduced a trap composed of 15 places in 31 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 10:18:28] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-28 10:18:28] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2024-05-28 10:18:28] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 10:18:29] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 10:18:29] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:18:29] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-28 10:18:29] [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 10:18:30] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-28 10:18:30] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 10:18:30] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-28 10:18:30] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-28 10:18:30] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-28 10:18:30] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-05-28 10:18:30] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 10:18:31] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-05-28 10:18:32] [INFO ] Deduced a trap composed of 11 places in 22 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 10:18:34] [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 10:18:35] [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 20901 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 23598 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 44542ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 44545ms
Finished structural reductions in LTL mode , in 1 iterations and 44930 ms. Remains : 253/253 places, 243/243 transitions.
Stuttering acceptance computed with spot in 214 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 45169 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 1 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 0 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 10 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 10:19:05] [INFO ] Computed 91 invariants in 2 ms
[2024-05-28 10:19:05] [INFO ] Implicit Places using invariants in 127 ms returned [237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 129 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 145 ms. Remains : 250/253 places, 241/243 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-010A-LTLFireability-15
Stuttering criterion allowed to conclude after 535 steps with 0 reset in 5 ms.
FORMULA ShieldIIPs-PT-010A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010A-LTLFireability-15 finished in 192 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 10:19:05] [INFO ] Flatten gal took : 27 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4454602337806278732
[2024-05-28 10:19:05] [INFO ] Computing symmetric may disable matrix : 243 transitions.
[2024-05-28 10:19:05] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:19:05] [INFO ] Computing symmetric may enable matrix : 243 transitions.
[2024-05-28 10:19:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:19:05] [INFO ] Applying decomposition
[2024-05-28 10:19:05] [INFO ] Computing Do-Not-Accords matrix : 243 transitions.
[2024-05-28 10:19:05] [INFO ] Flatten gal took : 13 ms
[2024-05-28 10:19:05] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:19:05] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4454602337806278732
Running compilation step : cd /tmp/ltsmin4454602337806278732;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10281659577805400547.txt' '-o' '/tmp/graph10281659577805400547.bin' '-w' '/tmp/graph10281659577805400547.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10281659577805400547.bin' '-l' '-1' '-v' '-w' '/tmp/graph10281659577805400547.weights' '-q' '0' '-e' '0.001'
[2024-05-28 10:19:05] [INFO ] Decomposing Gal with order
[2024-05-28 10:19:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 10:19:05] [INFO ] Removed a total of 160 redundant transitions.
[2024-05-28 10:19:05] [INFO ] Flatten gal took : 18 ms
[2024-05-28 10:19:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 156 labels/synchronizations in 11 ms.
[2024-05-28 10:19:05] [INFO ] Time to serialize gal into /tmp/LTLFireability4371783111841344746.gal : 5 ms
[2024-05-28 10:19:05] [INFO ] Time to serialize properties into /tmp/LTLFireability16073969270513778539.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4371783111841344746.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16073969270513778539.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("(i6.i0.u60.p166!=1)"))))
Formula 0 simplified : FG!"(i6.i0.u60.p166!=1)"
Compilation finished in 577 ms.
Running link step : cd /tmp/ltsmin4454602337806278732;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin4454602337806278732;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: Initializing POR dependencies: labels 244, guards 243
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.024: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.024: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.464: LTL layer: formula: [](<>((LTLAPp0==true)))
pins2lts-mc-linux64( 2/ 8), 0.464: "[](<>((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.465: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.559: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.688: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.710: There are 246 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.710: State length is 254, there are 246 groups
pins2lts-mc-linux64( 0/ 8), 0.710: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.710: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.710: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.710: Visible groups: 0 / 246, labels: 1 / 246
pins2lts-mc-linux64( 0/ 8), 0.710: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.710: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.760: [Blue] ~120 levels ~960 states ~2712 transitions
pins2lts-mc-linux64( 6/ 8), 0.799: [Blue] ~226 levels ~1920 states ~6776 transitions
pins2lts-mc-linux64( 6/ 8), 0.924: [Blue] ~425 levels ~3840 states ~17040 transitions
pins2lts-mc-linux64( 6/ 8), 1.015: [Blue] ~463 levels ~7680 states ~22616 transitions
pins2lts-mc-linux64( 6/ 8), 1.139: [Blue] ~463 levels ~15360 states ~34640 transitions
pins2lts-mc-linux64( 3/ 8), 1.394: [Blue] ~704 levels ~30720 states ~71160 transitions
pins2lts-mc-linux64( 4/ 8), 1.787: [Blue] ~651 levels ~61440 states ~126080 transitions
pins2lts-mc-linux64( 3/ 8), 2.583: [Blue] ~826 levels ~122880 states ~292968 transitions
pins2lts-mc-linux64( 3/ 8), 4.002: [Blue] ~826 levels ~245760 states ~613792 transitions
pins2lts-mc-linux64( 3/ 8), 6.224: [Blue] ~826 levels ~491520 states ~1166280 transitions
pins2lts-mc-linux64( 4/ 8), 10.886: [Blue] ~651 levels ~983040 states ~2071768 transitions
pins2lts-mc-linux64( 4/ 8), 18.606: [Blue] ~651 levels ~1966080 states ~4299648 transitions
pins2lts-mc-linux64( 3/ 8), 34.583: [Blue] ~849 levels ~3932160 states ~9249184 transitions
pins2lts-mc-linux64( 3/ 8), 67.248: [Blue] ~849 levels ~7864320 states ~18792416 transitions
pins2lts-mc-linux64( 3/ 8), 135.537: [Blue] ~849 levels ~15728640 states ~38895688 transitions
pins2lts-mc-linux64( 4/ 8), 276.282: [Blue] ~651 levels ~31457280 states ~78142328 transitions
pins2lts-mc-linux64( 3/ 8), 561.201: [Blue] ~849 levels ~62914560 states ~167578832 transitions
pins2lts-mc-linux64( 2/ 8), 914.854: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 915.035:
pins2lts-mc-linux64( 0/ 8), 915.035: Explored 86022441 states 178631423 transitions, fanout: 2.077
pins2lts-mc-linux64( 0/ 8), 915.035: Total exploration time 914.320 sec (914.130 sec minimum, 914.205 sec on average)
pins2lts-mc-linux64( 0/ 8), 915.035: States per second: 94084, Transitions per second: 195371
pins2lts-mc-linux64( 0/ 8), 915.035:
pins2lts-mc-linux64( 0/ 8), 915.035: State space has 86038928 states, 64054217 are accepting
pins2lts-mc-linux64( 0/ 8), 915.035: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 915.035: blue states: 86022441 (99.98%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 915.035: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 915.035: all-red states: 64054217 (74.45%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 915.035:
pins2lts-mc-linux64( 0/ 8), 915.035: Total memory used for local state coloring: 0.1MB
pins2lts-mc-linux64( 0/ 8), 915.035:
pins2lts-mc-linux64( 0/ 8), 915.035: Queue width: 8B, total height: 4879, memory: 0.04MB
pins2lts-mc-linux64( 0/ 8), 915.035: Tree memory: 912.4MB, 11.1 B/state, compr.: 1.1%
pins2lts-mc-linux64( 0/ 8), 915.035: Tree fill ratio (roots/leafs): 64.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 915.035: Stored 244 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 915.035: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 915.035: Est. total memory use: 912.5MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4454602337806278732;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4454602337806278732;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
ITS-tools command line returned an error code 137
[2024-05-28 10:42:33] [INFO ] Applying decomposition
[2024-05-28 10:42:33] [INFO ] Flatten gal took : 14 ms
[2024-05-28 10:42:33] [INFO ] Decomposing Gal with order
[2024-05-28 10:42:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 10:42:33] [INFO ] Removed a total of 170 redundant transitions.
[2024-05-28 10:42:33] [INFO ] Flatten gal took : 20 ms
[2024-05-28 10:42:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 7 ms.
[2024-05-28 10:42:33] [INFO ] Time to serialize gal into /tmp/LTLFireability17207292917831172692.gal : 3 ms
[2024-05-28 10:42:33] [INFO ] Time to serialize properties into /tmp/LTLFireability4459756282199303400.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17207292917831172692.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4459756282199303400.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("(u68.p166!=1)"))))
Formula 0 simplified : FG!"(u68.p166!=1)"
ITS-tools command line returned an error code 137
[2024-05-28 10:52:29] [INFO ] Flatten gal took : 15 ms
[2024-05-28 10:52:29] [INFO ] Input system was already deterministic with 243 transitions.
[2024-05-28 10:52:29] [INFO ] Transformed 253 places.
[2024-05-28 10:52:29] [INFO ] Transformed 243 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 10:52:29] [INFO ] Time to serialize gal into /tmp/LTLFireability12590125722528344283.gal : 3 ms
[2024-05-28 10:52:29] [INFO ] Time to serialize properties into /tmp/LTLFireability17953503420404400175.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12590125722528344283.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17953503420404400175.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("(p166!=1)"))))
Formula 0 simplified : FG!"(p166!=1)"
ITS-tools command line returned an error code 137
Total runtime 3361133 ms.

BK_STOP 1716894215450

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ShieldIIPs-PT-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 r356-tall-171683760300084"
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 ;