fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r355-tall-171683758700420
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for ShieldPPPs-PT-005A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
12428.063 3600000.00 12778736.00 1507.30 FFFF?T??F????F?F normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 13 11:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 186K Apr 13 11:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 13 11:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 13 11:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 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 44K 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 ShieldPPPs-PT-005A-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-005A-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-005A-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-005A-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-005A-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-005A-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-005A-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-005A-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-005A-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-005A-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-005A-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-005A-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-005A-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-005A-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-005A-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-005A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716961505027

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-005A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 05:45:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 05:45:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 05:45:06] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2024-05-29 05:45:06] [INFO ] Transformed 158 places.
[2024-05-29 05:45:06] [INFO ] Transformed 133 transitions.
[2024-05-29 05:45:06] [INFO ] Found NUPN structural information;
[2024-05-29 05:45:06] [INFO ] Parsed PT model containing 158 places and 133 transitions and 506 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPs-PT-005A-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Applied a total of 0 rules in 14 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
// Phase 1: matrix 133 rows 158 cols
[2024-05-29 05:45:06] [INFO ] Computed 56 invariants in 7 ms
[2024-05-29 05:45:06] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-05-29 05:45:06] [INFO ] Invariant cache hit.
[2024-05-29 05:45:07] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-05-29 05:45:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 133/291 variables, 158/372 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-29 05:45:09] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 9 ms to minimize.
[2024-05-29 05:45:09] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 4 ms to minimize.
[2024-05-29 05:45:09] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 3/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 375 constraints, problems are : Problem set: 0 solved, 132 unsolved in 4401 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/291 variables, 158/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 132/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (OVERLAPS) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 507 constraints, problems are : Problem set: 0 solved, 132 unsolved in 10898 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
After SMT, in 15375ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 15398ms
Finished structural reductions in LTL mode , in 1 iterations and 15929 ms. Remains : 158/158 places, 133/133 transitions.
Support contains 48 out of 158 places after structural reductions.
[2024-05-29 05:45:22] [INFO ] Flatten gal took : 38 ms
[2024-05-29 05:45:22] [INFO ] Flatten gal took : 17 ms
[2024-05-29 05:45:22] [INFO ] Input system was already deterministic with 133 transitions.
Support contains 44 out of 158 places (down from 48) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 29 to 28
RANDOM walk for 40000 steps (101 resets) in 1159 ms. (34 steps per ms) remains 1/28 properties
BEST_FIRST walk for 40004 steps (12 resets) in 320 ms. (124 steps per ms) remains 1/1 properties
[2024-05-29 05:45:23] [INFO ] Invariant cache hit.
Problem AtomicPropp27 is UNSAT
After SMT solving in domain Real declared 2/291 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 24 ms.
Refiners :[Domain max(s): 0/158 constraints, Positive P Invariants (semi-flows): 0/56 constraints, State Equation: 0/158 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 43ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
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' '!(X(F(p0)))'
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Applied a total of 0 rules in 7 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2024-05-29 05:45:23] [INFO ] Invariant cache hit.
[2024-05-29 05:45:24] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-29 05:45:24] [INFO ] Invariant cache hit.
[2024-05-29 05:45:24] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-05-29 05:45:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 133/291 variables, 158/372 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-29 05:45:26] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:45:26] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:45:27] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 3/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 375 constraints, problems are : Problem set: 0 solved, 132 unsolved in 4706 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/291 variables, 158/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 132/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (OVERLAPS) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 507 constraints, problems are : Problem set: 0 solved, 132 unsolved in 10932 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
After SMT, in 15683ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 15684ms
Finished structural reductions in LTL mode , in 1 iterations and 15959 ms. Remains : 158/158 places, 133/133 transitions.
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-005A-LTLFireability-00
Stuttering criterion allowed to conclude after 324 steps with 0 reset in 9 ms.
FORMULA ShieldPPPs-PT-005A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-005A-LTLFireability-00 finished in 16243 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&F(p1)))))'
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Applied a total of 0 rules in 7 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2024-05-29 05:45:40] [INFO ] Invariant cache hit.
[2024-05-29 05:45:40] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-29 05:45:40] [INFO ] Invariant cache hit.
[2024-05-29 05:45:40] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-05-29 05:45:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 133/291 variables, 158/372 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-29 05:45:42] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:45:42] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:45:42] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 3/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 375 constraints, problems are : Problem set: 0 solved, 132 unsolved in 4099 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/291 variables, 158/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 132/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (OVERLAPS) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 507 constraints, problems are : Problem set: 0 solved, 132 unsolved in 10171 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
After SMT, in 14297ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 14300ms
Finished structural reductions in LTL mode , in 1 iterations and 14613 ms. Remains : 158/158 places, 133/133 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-005A-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-005A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-005A-LTLFireability-02 finished in 14812 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(G(p1)))))'
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Applied a total of 0 rules in 6 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2024-05-29 05:45:54] [INFO ] Invariant cache hit.
[2024-05-29 05:45:55] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-29 05:45:55] [INFO ] Invariant cache hit.
[2024-05-29 05:45:55] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-05-29 05:45:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 133/291 variables, 158/372 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-29 05:45:56] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-29 05:45:57] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:45:57] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 3/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 375 constraints, problems are : Problem set: 0 solved, 132 unsolved in 3834 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/291 variables, 158/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 132/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (OVERLAPS) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 507 constraints, problems are : Problem set: 0 solved, 132 unsolved in 10371 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
After SMT, in 14233ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 14235ms
Finished structural reductions in LTL mode , in 1 iterations and 14514 ms. Remains : 158/158 places, 133/133 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-005A-LTLFireability-03
Product exploration explored 100000 steps with 456 reset in 342 ms.
Product exploration explored 100000 steps with 423 reset in 419 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 p0) p1), (X (NOT p0)), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 97 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 362 steps (0 resets) in 14 ms. (24 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 137 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-29 05:46:11] [INFO ] Invariant cache hit.
[2024-05-29 05:46:11] [INFO ] [Real]Absence check using 56 positive place invariants in 11 ms returned sat
[2024-05-29 05:46:11] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2024-05-29 05:46:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 05:46:11] [INFO ] [Nat]Absence check using 56 positive place invariants in 11 ms returned sat
[2024-05-29 05:46:11] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-05-29 05:46:11] [INFO ] Computed and/alt/rep : 132/363/132 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-29 05:46:12] [INFO ] Added : 132 causal constraints over 27 iterations in 675 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Applied a total of 0 rules in 3 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2024-05-29 05:46:12] [INFO ] Invariant cache hit.
[2024-05-29 05:46:12] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-29 05:46:12] [INFO ] Invariant cache hit.
[2024-05-29 05:46:12] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-05-29 05:46:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 133/291 variables, 158/372 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-29 05:46:14] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:46:14] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-29 05:46:14] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 3/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 375 constraints, problems are : Problem set: 0 solved, 132 unsolved in 4126 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/291 variables, 158/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 132/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (OVERLAPS) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 507 constraints, problems are : Problem set: 0 solved, 132 unsolved in 10481 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
After SMT, in 14677ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 14685ms
Finished structural reductions in LTL mode , in 1 iterations and 15025 ms. Remains : 158/158 places, 133/133 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 193 steps (0 resets) in 5 ms. (32 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-29 05:46:27] [INFO ] Invariant cache hit.
[2024-05-29 05:46:28] [INFO ] [Real]Absence check using 56 positive place invariants in 13 ms returned sat
[2024-05-29 05:46:28] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2024-05-29 05:46:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 05:46:28] [INFO ] [Nat]Absence check using 56 positive place invariants in 10 ms returned sat
[2024-05-29 05:46:28] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-05-29 05:46:28] [INFO ] Computed and/alt/rep : 132/363/132 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-29 05:46:29] [INFO ] Added : 132 causal constraints over 27 iterations in 684 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 437 reset in 285 ms.
Stuttering criterion allowed to conclude after 68409 steps with 282 reset in 211 ms.
FORMULA ShieldPPPs-PT-005A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-005A-LTLFireability-03 finished in 34766 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 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 156 transition count 131
Applied a total of 4 rules in 20 ms. Remains 156 /158 variables (removed 2) and now considering 131/133 (removed 2) transitions.
// Phase 1: matrix 131 rows 156 cols
[2024-05-29 05:46:29] [INFO ] Computed 56 invariants in 12 ms
[2024-05-29 05:46:29] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-29 05:46:29] [INFO ] Invariant cache hit.
[2024-05-29 05:46:29] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2024-05-29 05:46:29] [INFO ] Redundant transitions in 5 ms returned []
Running 130 sub problems to find dead transitions.
[2024-05-29 05:46:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 131/287 variables, 156/368 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-29 05:46:32] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-29 05:46:33] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/287 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 370 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5775 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/287 variables, 156/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 130/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 500 constraints, problems are : Problem set: 0 solved, 130 unsolved in 6810 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
After SMT, in 12608ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 12610ms
Starting structural reductions in SI_LTL mode, iteration 1 : 156/158 places, 131/133 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12930 ms. Remains : 156/158 places, 131/133 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-005A-LTLFireability-04
Product exploration explored 100000 steps with 1675 reset in 311 ms.
Product exploration explored 100000 steps with 1655 reset in 235 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 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 55 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 142 steps (0 resets) in 5 ms. (23 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 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 131/131 transitions.
Applied a total of 0 rules in 10 ms. Remains 156 /156 variables (removed 0) and now considering 131/131 (removed 0) transitions.
[2024-05-29 05:46:43] [INFO ] Invariant cache hit.
[2024-05-29 05:46:43] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-29 05:46:43] [INFO ] Invariant cache hit.
[2024-05-29 05:46:43] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2024-05-29 05:46:43] [INFO ] Redundant transitions in 2 ms returned []
Running 130 sub problems to find dead transitions.
[2024-05-29 05:46:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 131/287 variables, 156/368 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-29 05:46:45] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-29 05:46:47] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/287 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 370 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5491 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/287 variables, 156/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 130/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 500 constraints, problems are : Problem set: 0 solved, 130 unsolved in 6816 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
After SMT, in 12351ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 12353ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12660 ms. Remains : 156/156 places, 131/131 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
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 82 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 143 steps (0 resets) in 5 ms. (23 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 87 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 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1637 reset in 218 ms.
Product exploration explored 100000 steps with 1616 reset in 237 ms.
Support contains 4 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 131/131 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 131/131 (removed 0) transitions.
[2024-05-29 05:46:57] [INFO ] Invariant cache hit.
[2024-05-29 05:46:57] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-29 05:46:57] [INFO ] Invariant cache hit.
[2024-05-29 05:46:57] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2024-05-29 05:46:57] [INFO ] Redundant transitions in 2 ms returned []
Running 130 sub problems to find dead transitions.
[2024-05-29 05:46:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 131/287 variables, 156/368 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-29 05:46:59] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-29 05:47:01] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/287 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 370 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5720 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/287 variables, 156/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 130/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 500 constraints, problems are : Problem set: 0 solved, 130 unsolved in 6813 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
After SMT, in 12562ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 12564ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12890 ms. Remains : 156/156 places, 131/131 transitions.
Treatment of property ShieldPPPs-PT-005A-LTLFireability-04 finished in 40578 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Applied a total of 0 rules in 1 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
// Phase 1: matrix 133 rows 158 cols
[2024-05-29 05:47:10] [INFO ] Computed 56 invariants in 1 ms
[2024-05-29 05:47:10] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-29 05:47:10] [INFO ] Invariant cache hit.
[2024-05-29 05:47:10] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-05-29 05:47:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 133/291 variables, 158/372 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-29 05:47:12] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 2 ms to minimize.
[2024-05-29 05:47:12] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-05-29 05:47:12] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 3/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 375 constraints, problems are : Problem set: 0 solved, 132 unsolved in 3913 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/291 variables, 158/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 132/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (OVERLAPS) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 507 constraints, problems are : Problem set: 0 solved, 132 unsolved in 10317 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
After SMT, in 14269ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 14270ms
Finished structural reductions in LTL mode , in 1 iterations and 14582 ms. Remains : 158/158 places, 133/133 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-005A-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 182 ms.
Product exploration explored 100000 steps with 50000 reset in 193 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-005A-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-005A-LTLFireability-05 finished in 15133 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 156 transition count 131
Applied a total of 4 rules in 7 ms. Remains 156 /158 variables (removed 2) and now considering 131/133 (removed 2) transitions.
// Phase 1: matrix 131 rows 156 cols
[2024-05-29 05:47:25] [INFO ] Computed 56 invariants in 4 ms
[2024-05-29 05:47:25] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-29 05:47:25] [INFO ] Invariant cache hit.
[2024-05-29 05:47:25] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2024-05-29 05:47:25] [INFO ] Redundant transitions in 3 ms returned []
Running 130 sub problems to find dead transitions.
[2024-05-29 05:47:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 131/287 variables, 156/368 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-29 05:47:27] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-29 05:47:29] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 7 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/287 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 370 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5485 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/287 variables, 156/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 130/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 500 constraints, problems are : Problem set: 0 solved, 130 unsolved in 6719 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
After SMT, in 12231ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 12232ms
Starting structural reductions in SI_LTL mode, iteration 1 : 156/158 places, 131/133 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12539 ms. Remains : 156/158 places, 131/133 transitions.
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-005A-LTLFireability-06
Product exploration explored 100000 steps with 512 reset in 280 ms.
Product exploration explored 100000 steps with 532 reset in 289 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 p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 104 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (108 resets) in 268 ms. (148 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (17 resets) in 228 ms. (174 steps per ms) remains 1/1 properties
[2024-05-29 05:47:39] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 9/12 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 144/156 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 144/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 131/287 variables, 156/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 368 constraints, problems are : Problem set: 0 solved, 1 unsolved in 122 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 3/287 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 12 ms.
Refiners :[Domain max(s): 3/156 constraints, Positive P Invariants (semi-flows): 0/56 constraints, State Equation: 0/156 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 165ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 202 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 131/131 transitions.
Applied a total of 0 rules in 6 ms. Remains 156 /156 variables (removed 0) and now considering 131/131 (removed 0) transitions.
[2024-05-29 05:47:39] [INFO ] Invariant cache hit.
[2024-05-29 05:47:39] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-29 05:47:39] [INFO ] Invariant cache hit.
[2024-05-29 05:47:39] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2024-05-29 05:47:39] [INFO ] Redundant transitions in 1 ms returned []
Running 130 sub problems to find dead transitions.
[2024-05-29 05:47:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 131/287 variables, 156/368 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-29 05:47:41] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-29 05:47:43] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/287 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 370 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5386 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/287 variables, 156/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 130/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 500 constraints, problems are : Problem set: 0 solved, 130 unsolved in 6757 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
After SMT, in 12170ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 12171ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12421 ms. Remains : 156/156 places, 131/131 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 164 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 64 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 881 steps (1 resets) in 9 ms. (88 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 89 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)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 506 reset in 239 ms.
Product exploration explored 100000 steps with 521 reset in 265 ms.
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 131/131 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 131/131 (removed 0) transitions.
[2024-05-29 05:47:53] [INFO ] Invariant cache hit.
[2024-05-29 05:47:53] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-29 05:47:53] [INFO ] Invariant cache hit.
[2024-05-29 05:47:53] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2024-05-29 05:47:53] [INFO ] Redundant transitions in 1 ms returned []
Running 130 sub problems to find dead transitions.
[2024-05-29 05:47:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 131/287 variables, 156/368 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-29 05:47:55] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-29 05:47:56] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/287 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 370 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5343 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/287 variables, 156/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 130/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 500 constraints, problems are : Problem set: 0 solved, 130 unsolved in 6683 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
After SMT, in 12063ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 12064ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12365 ms. Remains : 156/156 places, 131/131 transitions.
Treatment of property ShieldPPPs-PT-005A-LTLFireability-06 finished in 40040 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p1))&&p0)))'
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
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 2 place count 157 transition count 132
Applied a total of 2 rules in 6 ms. Remains 157 /158 variables (removed 1) and now considering 132/133 (removed 1) transitions.
// Phase 1: matrix 132 rows 157 cols
[2024-05-29 05:48:05] [INFO ] Computed 56 invariants in 1 ms
[2024-05-29 05:48:05] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-29 05:48:05] [INFO ] Invariant cache hit.
[2024-05-29 05:48:05] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
[2024-05-29 05:48:05] [INFO ] Redundant transitions in 1 ms returned []
Running 131 sub problems to find dead transitions.
[2024-05-29 05:48:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 56/212 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 132/289 variables, 157/370 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 0/289 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 370 constraints, problems are : Problem set: 0 solved, 131 unsolved in 3079 ms.
Refiners :[Domain max(s): 157/157 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 56/212 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 132/289 variables, 157/370 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 131/501 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 0/289 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 501 constraints, problems are : Problem set: 0 solved, 131 unsolved in 6743 ms.
Refiners :[Domain max(s): 157/157 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
After SMT, in 9873ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 9874ms
Starting structural reductions in SI_LTL mode, iteration 1 : 157/158 places, 132/133 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10302 ms. Remains : 157/158 places, 132/133 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-005A-LTLFireability-07
Product exploration explored 100000 steps with 1032 reset in 227 ms.
Product exploration explored 100000 steps with 1043 reset in 249 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 p1 p0), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 79 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 592 steps (0 resets) in 6 ms. (84 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 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 65 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 157 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 132/132 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2024-05-29 05:48:16] [INFO ] Invariant cache hit.
[2024-05-29 05:48:16] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-29 05:48:16] [INFO ] Invariant cache hit.
[2024-05-29 05:48:16] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2024-05-29 05:48:16] [INFO ] Redundant transitions in 0 ms returned []
Running 131 sub problems to find dead transitions.
[2024-05-29 05:48:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 56/212 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 132/289 variables, 157/370 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 0/289 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 370 constraints, problems are : Problem set: 0 solved, 131 unsolved in 2918 ms.
Refiners :[Domain max(s): 157/157 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 56/212 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 132/289 variables, 157/370 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 131/501 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 0/289 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 501 constraints, problems are : Problem set: 0 solved, 131 unsolved in 6741 ms.
Refiners :[Domain max(s): 157/157 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
After SMT, in 9697ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 9700ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9950 ms. Remains : 157/157 places, 132/132 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 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 50 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 393 steps (0 resets) in 6 ms. (56 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 73 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 58 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1047 reset in 247 ms.
Product exploration explored 100000 steps with 1054 reset in 265 ms.
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 132/132 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2024-05-29 05:48:27] [INFO ] Invariant cache hit.
[2024-05-29 05:48:27] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-29 05:48:27] [INFO ] Invariant cache hit.
[2024-05-29 05:48:27] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2024-05-29 05:48:27] [INFO ] Redundant transitions in 0 ms returned []
Running 131 sub problems to find dead transitions.
[2024-05-29 05:48:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 56/212 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 132/289 variables, 157/370 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 0/289 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 370 constraints, problems are : Problem set: 0 solved, 131 unsolved in 2896 ms.
Refiners :[Domain max(s): 157/157 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 56/212 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 132/289 variables, 157/370 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 131/501 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 0/289 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 501 constraints, problems are : Problem set: 0 solved, 131 unsolved in 6756 ms.
Refiners :[Domain max(s): 157/157 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
After SMT, in 9669ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 9671ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9905 ms. Remains : 157/157 places, 132/132 transitions.
Treatment of property ShieldPPPs-PT-005A-LTLFireability-07 finished in 32177 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(!p0)) U ((p0 U p1)&&X(G(p1)))))'
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Applied a total of 0 rules in 1 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
// Phase 1: matrix 133 rows 158 cols
[2024-05-29 05:48:37] [INFO ] Computed 56 invariants in 1 ms
[2024-05-29 05:48:37] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-29 05:48:37] [INFO ] Invariant cache hit.
[2024-05-29 05:48:37] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-05-29 05:48:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 133/291 variables, 158/372 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-29 05:48:39] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-29 05:48:39] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:48:40] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 3/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 375 constraints, problems are : Problem set: 0 solved, 132 unsolved in 3904 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/291 variables, 158/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 132/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (OVERLAPS) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 507 constraints, problems are : Problem set: 0 solved, 132 unsolved in 10472 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
After SMT, in 14396ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 14398ms
Finished structural reductions in LTL mode , in 1 iterations and 14634 ms. Remains : 158/158 places, 133/133 transitions.
Stuttering acceptance computed with spot in 268 ms :[(NOT p1), p0, (NOT p1), p0, true, (AND (NOT p1) p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-005A-LTLFireability-08
Product exploration explored 100000 steps with 25010 reset in 187 ms.
Product exploration explored 100000 steps with 24992 reset in 195 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 (OR p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT (OR p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 135 ms. Reduced automaton from 7 states, 16 edges and 2 AP (stutter sensitive) to 7 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[(NOT p1), p0, (NOT p1), p0, true, (AND (NOT p1) p0), (AND (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 1174 steps (1 resets) in 34 ms. (33 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (OR p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT (OR p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p1) (NOT p0)))), (F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR (NOT p1) p0)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p1 (NOT p0))))
Knowledge based reduction with 12 factoid took 305 ms. Reduced automaton from 7 states, 16 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-005A-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-005A-LTLFireability-08 finished in 16067 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(!p1)||G(!p2))&&p0))))'
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
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 2 place count 157 transition count 132
Applied a total of 2 rules in 17 ms. Remains 157 /158 variables (removed 1) and now considering 132/133 (removed 1) transitions.
// Phase 1: matrix 132 rows 157 cols
[2024-05-29 05:48:53] [INFO ] Computed 56 invariants in 1 ms
[2024-05-29 05:48:53] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-29 05:48:53] [INFO ] Invariant cache hit.
[2024-05-29 05:48:53] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2024-05-29 05:48:53] [INFO ] Redundant transitions in 0 ms returned []
Running 131 sub problems to find dead transitions.
[2024-05-29 05:48:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 56/212 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 132/289 variables, 157/370 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-29 05:48:56] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-29 05:48:56] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 6 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/289 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (OVERLAPS) 0/289 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 372 constraints, problems are : Problem set: 0 solved, 131 unsolved in 4783 ms.
Refiners :[Domain max(s): 157/157 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 56/212 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/289 variables, 157/372 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 131/503 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (OVERLAPS) 0/289 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 503 constraints, problems are : Problem set: 0 solved, 131 unsolved in 8995 ms.
Refiners :[Domain max(s): 157/157 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 2/2 constraints]
After SMT, in 13796ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 13797ms
Starting structural reductions in SI_LTL mode, iteration 1 : 157/158 places, 132/133 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14059 ms. Remains : 157/158 places, 132/133 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (AND p1 p2)), (AND p1 p2), (OR (AND (NOT p0) p1) (AND p1 p2))]
Running random walk in product with property : ShieldPPPs-PT-005A-LTLFireability-09
Product exploration explored 100000 steps with 412 reset in 330 ms.
Product exploration explored 100000 steps with 408 reset in 345 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (OR (AND (NOT p0) p1) (AND p1 p2)))), (X (NOT (AND p0 p1 p2))), (X p0), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p1 p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X p0)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 120 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (AND p1 p2)), (AND p1 p2), (OR (AND (NOT p0) p1) (AND p1 p2))]
RANDOM walk for 40000 steps (103 resets) in 430 ms. (92 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40003 steps (10 resets) in 238 ms. (167 steps per ms) remains 1/1 properties
[2024-05-29 05:49:09] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 16/22 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 135/157 variables, 49/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 135/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 132/289 variables, 157/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/289 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 370 constraints, problems are : Problem set: 0 solved, 1 unsolved in 91 ms.
Refiners :[Domain max(s): 157/157 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Problem apf7 is UNSAT
After SMT solving in domain Int declared 6/289 variables, and 6 constraints, problems are : Problem set: 1 solved, 0 unsolved in 15 ms.
Refiners :[Domain max(s): 6/157 constraints, Positive P Invariants (semi-flows): 0/56 constraints, State Equation: 0/157 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 111ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (OR (AND (NOT p0) p1) (AND p1 p2)))), (X (NOT (AND p0 p1 p2))), (X p0), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p1 p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X p0)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT p1))), (G (OR (NOT p2) (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT p0)), (F p1), (F (NOT (AND (OR (NOT p2) (NOT p1)) (OR p0 (NOT p1))))), (F p2), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p2 (NOT p0) (NOT p1))))]
Knowledge based reduction with 18 factoid took 392 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (AND p1 p2)), (AND p1 p2), (OR (AND (NOT p0) p1) (AND p1 p2))]
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (AND p1 p2)), (AND p1 p2), (OR (AND (NOT p0) p1) (AND p1 p2))]
Support contains 6 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 132/132 transitions.
Applied a total of 0 rules in 7 ms. Remains 157 /157 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2024-05-29 05:49:09] [INFO ] Invariant cache hit.
[2024-05-29 05:49:09] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-29 05:49:09] [INFO ] Invariant cache hit.
[2024-05-29 05:49:10] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2024-05-29 05:49:10] [INFO ] Redundant transitions in 0 ms returned []
Running 131 sub problems to find dead transitions.
[2024-05-29 05:49:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 56/212 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 132/289 variables, 157/370 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-29 05:49:13] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2024-05-29 05:49:13] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/289 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (OVERLAPS) 0/289 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 372 constraints, problems are : Problem set: 0 solved, 131 unsolved in 4861 ms.
Refiners :[Domain max(s): 157/157 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 56/212 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/289 variables, 157/372 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 131/503 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (OVERLAPS) 0/289 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 503 constraints, problems are : Problem set: 0 solved, 131 unsolved in 9089 ms.
Refiners :[Domain max(s): 157/157 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 2/2 constraints]
After SMT, in 13970ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 13973ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14205 ms. Remains : 157/157 places, 132/132 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) p1))), (X p0), (X (NOT (AND p2 p1))), (X (NOT (OR (AND p2 p1) (AND (NOT p0) p1)))), (X (NOT p1)), (X (NOT (AND p2 p0 p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND p2 p1)))), (X (X (NOT (OR (AND p2 p1) (AND (NOT p0) p1))))), (X (X (NOT p1))), (X (X (NOT (AND p2 p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 175 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (AND p1 p2)), (AND p1 p2), (OR (AND (NOT p0) p1) (AND p1 p2))]
RANDOM walk for 40000 steps (103 resets) in 250 ms. (159 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40004 steps (11 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
[2024-05-29 05:49:24] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 16/22 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 135/157 variables, 49/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 135/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 132/289 variables, 157/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/289 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 370 constraints, problems are : Problem set: 0 solved, 1 unsolved in 92 ms.
Refiners :[Domain max(s): 157/157 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Problem apf7 is UNSAT
After SMT solving in domain Int declared 6/289 variables, and 6 constraints, problems are : Problem set: 1 solved, 0 unsolved in 19 ms.
Refiners :[Domain max(s): 6/157 constraints, Positive P Invariants (semi-flows): 0/56 constraints, State Equation: 0/157 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 117ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) p1))), (X p0), (X (NOT (AND p2 p1))), (X (NOT (OR (AND p2 p1) (AND (NOT p0) p1)))), (X (NOT p1)), (X (NOT (AND p2 p0 p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND p2 p1)))), (X (X (NOT (OR (AND p2 p1) (AND (NOT p0) p1))))), (X (X (NOT p1))), (X (X (NOT (AND p2 p0 p1)))), (G (OR (NOT p2) (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT p0)), (F p1), (F (NOT (AND (OR (NOT p2) (NOT p1)) (OR p0 (NOT p1))))), (F p2), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p2 (NOT p0) (NOT p1))))]
Knowledge based reduction with 18 factoid took 339 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (AND p1 p2)), (AND p1 p2), (OR (AND (NOT p0) p1) (AND p1 p2))]
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (AND p1 p2)), (AND p1 p2), (OR (AND (NOT p0) p1) (AND p1 p2))]
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (AND p1 p2)), (AND p1 p2), (OR (AND (NOT p0) p1) (AND p1 p2))]
Product exploration explored 100000 steps with 392 reset in 293 ms.
Product exploration explored 100000 steps with 415 reset in 317 ms.
Support contains 6 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 132/132 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2024-05-29 05:49:25] [INFO ] Invariant cache hit.
[2024-05-29 05:49:25] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-29 05:49:26] [INFO ] Invariant cache hit.
[2024-05-29 05:49:26] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2024-05-29 05:49:26] [INFO ] Redundant transitions in 1 ms returned []
Running 131 sub problems to find dead transitions.
[2024-05-29 05:49:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 56/212 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 132/289 variables, 157/370 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-29 05:49:29] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:49:29] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/289 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (OVERLAPS) 0/289 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 372 constraints, problems are : Problem set: 0 solved, 131 unsolved in 4900 ms.
Refiners :[Domain max(s): 157/157 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 56/212 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/289 variables, 157/372 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 131/503 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (OVERLAPS) 0/289 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 503 constraints, problems are : Problem set: 0 solved, 131 unsolved in 8676 ms.
Refiners :[Domain max(s): 157/157 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 2/2 constraints]
After SMT, in 13632ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 13634ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13960 ms. Remains : 157/157 places, 132/132 transitions.
Treatment of property ShieldPPPs-PT-005A-LTLFireability-09 finished in 46192 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&G(p1))))'
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 156 transition count 131
Applied a total of 4 rules in 7 ms. Remains 156 /158 variables (removed 2) and now considering 131/133 (removed 2) transitions.
// Phase 1: matrix 131 rows 156 cols
[2024-05-29 05:49:39] [INFO ] Computed 56 invariants in 1 ms
[2024-05-29 05:49:39] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-29 05:49:40] [INFO ] Invariant cache hit.
[2024-05-29 05:49:40] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2024-05-29 05:49:40] [INFO ] Redundant transitions in 0 ms returned []
Running 130 sub problems to find dead transitions.
[2024-05-29 05:49:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 131/287 variables, 156/368 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-29 05:49:41] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-29 05:49:43] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/287 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 370 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5363 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/287 variables, 156/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 130/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 500 constraints, problems are : Problem set: 0 solved, 130 unsolved in 6879 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
After SMT, in 12265ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 12267ms
Starting structural reductions in SI_LTL mode, iteration 1 : 156/158 places, 131/133 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12511 ms. Remains : 156/158 places, 131/133 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-005A-LTLFireability-10
Product exploration explored 100000 steps with 271 reset in 247 ms.
Product exploration explored 100000 steps with 273 reset in 275 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 p1 p0), (X p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 101 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
RANDOM walk for 1087 steps (1 resets) in 11 ms. (90 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 7 factoid took 146 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 131/131 transitions.
Applied a total of 0 rules in 6 ms. Remains 156 /156 variables (removed 0) and now considering 131/131 (removed 0) transitions.
[2024-05-29 05:49:53] [INFO ] Invariant cache hit.
[2024-05-29 05:49:53] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-29 05:49:53] [INFO ] Invariant cache hit.
[2024-05-29 05:49:53] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2024-05-29 05:49:53] [INFO ] Redundant transitions in 1 ms returned []
Running 130 sub problems to find dead transitions.
[2024-05-29 05:49:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 131/287 variables, 156/368 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-29 05:49:55] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-29 05:49:57] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/287 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 370 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5507 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/287 variables, 156/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 130/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 500 constraints, problems are : Problem set: 0 solved, 130 unsolved in 6641 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
After SMT, in 12192ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 12193ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12438 ms. Remains : 156/156 places, 131/131 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 80 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
RANDOM walk for 1388 steps (2 resets) in 9 ms. (138 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 7 factoid took 162 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 270 reset in 275 ms.
Product exploration explored 100000 steps with 274 reset in 297 ms.
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 131/131 transitions.
Applied a total of 0 rules in 3 ms. Remains 156 /156 variables (removed 0) and now considering 131/131 (removed 0) transitions.
[2024-05-29 05:50:07] [INFO ] Invariant cache hit.
[2024-05-29 05:50:07] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-29 05:50:07] [INFO ] Invariant cache hit.
[2024-05-29 05:50:07] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2024-05-29 05:50:07] [INFO ] Redundant transitions in 0 ms returned []
Running 130 sub problems to find dead transitions.
[2024-05-29 05:50:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 131/287 variables, 156/368 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-29 05:50:09] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-29 05:50:11] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/287 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 370 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5264 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/287 variables, 156/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 130/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 500 constraints, problems are : Problem set: 0 solved, 130 unsolved in 6753 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
After SMT, in 12035ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 12036ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12285 ms. Remains : 156/156 places, 131/131 transitions.
Treatment of property ShieldPPPs-PT-005A-LTLFireability-10 finished in 39923 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(p1)||p0))&&F(p2)))'
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Applied a total of 0 rules in 1 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
// Phase 1: matrix 133 rows 158 cols
[2024-05-29 05:50:19] [INFO ] Computed 56 invariants in 1 ms
[2024-05-29 05:50:19] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-29 05:50:19] [INFO ] Invariant cache hit.
[2024-05-29 05:50:20] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-05-29 05:50:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 133/291 variables, 158/372 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-29 05:50:21] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-05-29 05:50:22] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2024-05-29 05:50:22] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 3/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 375 constraints, problems are : Problem set: 0 solved, 132 unsolved in 4084 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/291 variables, 158/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 132/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (OVERLAPS) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 507 constraints, problems are : Problem set: 0 solved, 132 unsolved in 10471 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
After SMT, in 14583ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 14585ms
Finished structural reductions in LTL mode , in 1 iterations and 14872 ms. Remains : 158/158 places, 133/133 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-005A-LTLFireability-11
Product exploration explored 100000 steps with 27844 reset in 175 ms.
Product exploration explored 100000 steps with 28004 reset in 180 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 p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 104 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 18 steps (0 resets) in 5 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 8 factoid took 135 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 67 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p2), (NOT p2)]
[2024-05-29 05:50:35] [INFO ] Invariant cache hit.
[2024-05-29 05:50:35] [INFO ] [Real]Absence check using 56 positive place invariants in 10 ms returned sat
[2024-05-29 05:50:35] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2024-05-29 05:50:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 05:50:35] [INFO ] [Nat]Absence check using 56 positive place invariants in 9 ms returned sat
[2024-05-29 05:50:36] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-29 05:50:36] [INFO ] Computed and/alt/rep : 132/363/132 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-29 05:50:36] [INFO ] Added : 132 causal constraints over 29 iterations in 812 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 1 out of 158 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Reduce places removed 1 places and 1 transitions.
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 2 place count 156 transition count 131
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 155 transition count 130
Applied a total of 4 rules in 12 ms. Remains 155 /158 variables (removed 3) and now considering 130/133 (removed 3) transitions.
// Phase 1: matrix 130 rows 155 cols
[2024-05-29 05:50:36] [INFO ] Computed 56 invariants in 1 ms
[2024-05-29 05:50:36] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-29 05:50:36] [INFO ] Invariant cache hit.
[2024-05-29 05:50:37] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2024-05-29 05:50:37] [INFO ] Redundant transitions in 0 ms returned []
Running 128 sub problems to find dead transitions.
[2024-05-29 05:50:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 130/285 variables, 155/366 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (OVERLAPS) 0/285 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 366 constraints, problems are : Problem set: 0 solved, 128 unsolved in 2288 ms.
Refiners :[Domain max(s): 155/155 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 130/285 variables, 155/366 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 128/494 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 494 constraints, problems are : Problem set: 0 solved, 128 unsolved in 8959 ms.
Refiners :[Domain max(s): 155/155 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
After SMT, in 11266ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 11268ms
Starting structural reductions in SI_LTL mode, iteration 1 : 155/158 places, 130/133 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11516 ms. Remains : 155/158 places, 130/133 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p2)]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 1 factoid took 193 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 76 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p2)]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 1 factoid took 186 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 75 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p2), (NOT p2)]
[2024-05-29 05:50:49] [INFO ] Invariant cache hit.
[2024-05-29 05:50:49] [INFO ] [Real]Absence check using 56 positive place invariants in 10 ms returned sat
[2024-05-29 05:50:49] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-05-29 05:50:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 05:50:49] [INFO ] [Nat]Absence check using 56 positive place invariants in 10 ms returned sat
[2024-05-29 05:50:49] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-05-29 05:50:49] [INFO ] Computed and/alt/rep : 128/243/128 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-29 05:50:50] [INFO ] Added : 128 causal constraints over 29 iterations in 780 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 174 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 32051 reset in 136 ms.
Product exploration explored 100000 steps with 32002 reset in 160 ms.
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 130/130 transitions.
Applied a total of 0 rules in 3 ms. Remains 155 /155 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2024-05-29 05:50:50] [INFO ] Invariant cache hit.
[2024-05-29 05:50:50] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-29 05:50:50] [INFO ] Invariant cache hit.
[2024-05-29 05:50:50] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2024-05-29 05:50:50] [INFO ] Redundant transitions in 0 ms returned []
Running 128 sub problems to find dead transitions.
[2024-05-29 05:50:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 130/285 variables, 155/366 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (OVERLAPS) 0/285 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 366 constraints, problems are : Problem set: 0 solved, 128 unsolved in 2380 ms.
Refiners :[Domain max(s): 155/155 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 130/285 variables, 155/366 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 128/494 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 494 constraints, problems are : Problem set: 0 solved, 128 unsolved in 8769 ms.
Refiners :[Domain max(s): 155/155 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
After SMT, in 11172ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 11174ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11417 ms. Remains : 155/155 places, 130/130 transitions.
Treatment of property ShieldPPPs-PT-005A-LTLFireability-11 finished in 42247 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)))'
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Applied a total of 0 rules in 2 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
// Phase 1: matrix 133 rows 158 cols
[2024-05-29 05:51:02] [INFO ] Computed 56 invariants in 1 ms
[2024-05-29 05:51:02] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-29 05:51:02] [INFO ] Invariant cache hit.
[2024-05-29 05:51:02] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-05-29 05:51:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 133/291 variables, 158/372 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-29 05:51:03] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:51:04] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-29 05:51:04] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 3/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 375 constraints, problems are : Problem set: 0 solved, 132 unsolved in 3972 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/291 variables, 158/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 132/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (OVERLAPS) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 507 constraints, problems are : Problem set: 0 solved, 132 unsolved in 10653 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
After SMT, in 14640ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 14642ms
Finished structural reductions in LTL mode , in 1 iterations and 14901 ms. Remains : 158/158 places, 133/133 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldPPPs-PT-005A-LTLFireability-12
Product exploration explored 100000 steps with 1279 reset in 250 ms.
Product exploration explored 100000 steps with 1281 reset in 268 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) p0), (X (AND (NOT p1) p0)), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 120 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 3322 steps (7 resets) in 20 ms. (158 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 260 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
[2024-05-29 05:51:18] [INFO ] Invariant cache hit.
[2024-05-29 05:51:18] [INFO ] [Real]Absence check using 56 positive place invariants in 12 ms returned sat
[2024-05-29 05:51:18] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2024-05-29 05:51:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 05:51:18] [INFO ] [Nat]Absence check using 56 positive place invariants in 10 ms returned sat
[2024-05-29 05:51:18] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-05-29 05:51:18] [INFO ] Computed and/alt/rep : 132/363/132 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-29 05:51:19] [INFO ] Added : 132 causal constraints over 28 iterations in 558 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 156 transition count 131
Applied a total of 4 rules in 7 ms. Remains 156 /158 variables (removed 2) and now considering 131/133 (removed 2) transitions.
// Phase 1: matrix 131 rows 156 cols
[2024-05-29 05:51:19] [INFO ] Computed 56 invariants in 2 ms
[2024-05-29 05:51:19] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-29 05:51:19] [INFO ] Invariant cache hit.
[2024-05-29 05:51:19] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2024-05-29 05:51:19] [INFO ] Redundant transitions in 0 ms returned []
Running 130 sub problems to find dead transitions.
[2024-05-29 05:51:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 131/287 variables, 156/368 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-29 05:51:21] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-29 05:51:23] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/287 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 370 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5481 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/287 variables, 156/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 130/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 500 constraints, problems are : Problem set: 0 solved, 130 unsolved in 7013 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
After SMT, in 12512ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 12513ms
Starting structural reductions in SI_LTL mode, iteration 1 : 156/158 places, 131/133 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12793 ms. Remains : 156/158 places, 131/133 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 143 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 273 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 2025 steps (3 resets) in 18 ms. (106 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 13 factoid took 371 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
[2024-05-29 05:51:33] [INFO ] Invariant cache hit.
[2024-05-29 05:51:33] [INFO ] [Real]Absence check using 56 positive place invariants in 11 ms returned sat
[2024-05-29 05:51:33] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2024-05-29 05:51:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 05:51:33] [INFO ] [Nat]Absence check using 56 positive place invariants in 11 ms returned sat
[2024-05-29 05:51:33] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2024-05-29 05:51:33] [INFO ] Computed and/alt/rep : 130/367/130 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-29 05:51:34] [INFO ] Added : 95 causal constraints over 19 iterations in 349 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1334 reset in 232 ms.
Product exploration explored 100000 steps with 1345 reset in 250 ms.
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 131/131 transitions.
Applied a total of 0 rules in 16 ms. Remains 156 /156 variables (removed 0) and now considering 131/131 (removed 0) transitions.
[2024-05-29 05:51:34] [INFO ] Invariant cache hit.
[2024-05-29 05:51:34] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-29 05:51:34] [INFO ] Invariant cache hit.
[2024-05-29 05:51:35] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2024-05-29 05:51:35] [INFO ] Redundant transitions in 0 ms returned []
Running 130 sub problems to find dead transitions.
[2024-05-29 05:51:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 131/287 variables, 156/368 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-29 05:51:36] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-29 05:51:38] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/287 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 370 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5472 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/287 variables, 156/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 130/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 500 constraints, problems are : Problem set: 0 solved, 130 unsolved in 7144 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
After SMT, in 12633ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 12634ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12905 ms. Remains : 156/156 places, 131/131 transitions.
Treatment of property ShieldPPPs-PT-005A-LTLFireability-12 finished in 45698 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((X(p2)&&p1))&&p0)))'
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Applied a total of 0 rules in 1 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
// Phase 1: matrix 133 rows 158 cols
[2024-05-29 05:51:47] [INFO ] Computed 56 invariants in 3 ms
[2024-05-29 05:51:47] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-29 05:51:47] [INFO ] Invariant cache hit.
[2024-05-29 05:51:48] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-05-29 05:51:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 133/291 variables, 158/372 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-29 05:51:49] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:51:50] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:51:50] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 3/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 375 constraints, problems are : Problem set: 0 solved, 132 unsolved in 4048 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/291 variables, 158/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 132/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (OVERLAPS) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 507 constraints, problems are : Problem set: 0 solved, 132 unsolved in 11227 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
After SMT, in 15297ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 15299ms
Finished structural reductions in LTL mode , in 1 iterations and 15564 ms. Remains : 158/158 places, 133/133 transitions.
Stuttering acceptance computed with spot in 213 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p2) (NOT p0)), true]
Running random walk in product with property : ShieldPPPs-PT-005A-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-005A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-005A-LTLFireability-13 finished in 15811 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((X(p0)||F((!p1 U (p2||G(!p1)))))))'
Support contains 5 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Applied a total of 0 rules in 3 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2024-05-29 05:52:03] [INFO ] Invariant cache hit.
[2024-05-29 05:52:03] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-29 05:52:03] [INFO ] Invariant cache hit.
[2024-05-29 05:52:03] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-05-29 05:52:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 133/291 variables, 158/372 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-29 05:52:05] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:52:05] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:52:06] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 3/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 375 constraints, problems are : Problem set: 0 solved, 132 unsolved in 4014 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/291 variables, 158/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 132/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (OVERLAPS) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 507 constraints, problems are : Problem set: 0 solved, 132 unsolved in 10746 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
After SMT, in 14778ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 14779ms
Finished structural reductions in LTL mode , in 1 iterations and 15020 ms. Remains : 158/158 places, 133/133 transitions.
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) p1)]
Running random walk in product with property : ShieldPPPs-PT-005A-LTLFireability-14
Product exploration explored 100000 steps with 261 reset in 280 ms.
Product exploration explored 100000 steps with 258 reset in 318 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 p2 (NOT p0) (NOT p1)), (X (AND (NOT p2) (NOT p0))), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 100 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) p1)]
RANDOM walk for 2357 steps (4 resets) in 12 ms. (181 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (AND (NOT p2) (NOT p0))), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F p0), (F p1), (F (NOT p2)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 8 factoid took 271 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) p1)]
Support contains 5 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Applied a total of 0 rules in 1 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2024-05-29 05:52:20] [INFO ] Invariant cache hit.
[2024-05-29 05:52:20] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-29 05:52:20] [INFO ] Invariant cache hit.
[2024-05-29 05:52:20] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-05-29 05:52:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 133/291 variables, 158/372 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-29 05:52:21] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-05-29 05:52:22] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:52:22] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 3/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 375 constraints, problems are : Problem set: 0 solved, 132 unsolved in 4016 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/291 variables, 158/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 132/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (OVERLAPS) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 507 constraints, problems are : Problem set: 0 solved, 132 unsolved in 10819 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
After SMT, in 14860ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 14861ms
Finished structural reductions in LTL mode , in 1 iterations and 15101 ms. Remains : 158/158 places, 133/133 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 96 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) p1)]
RANDOM walk for 842 steps (1 resets) in 7 ms. (105 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F p0), (F p1), (F (NOT p2)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 8 factoid took 286 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) p1)]
Product exploration explored 100000 steps with 261 reset in 286 ms.
Product exploration explored 100000 steps with 259 reset in 314 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) p1)]
Support contains 5 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 158 transition count 133
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 16 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2024-05-29 05:52:36] [INFO ] Redundant transitions in 0 ms returned []
Running 132 sub problems to find dead transitions.
// Phase 1: matrix 133 rows 158 cols
[2024-05-29 05:52:36] [INFO ] Computed 56 invariants in 8 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-29 05:52:38] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-05-29 05:52:38] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
Problem TDEAD43 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 2/216 constraints. Problems are: Problem set: 2 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/216 constraints. Problems are: Problem set: 2 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 133/291 variables, 158/374 constraints. Problems are: Problem set: 2 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/374 constraints. Problems are: Problem set: 2 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/374 constraints. Problems are: Problem set: 2 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 374 constraints, problems are : Problem set: 2 solved, 130 unsolved in 3637 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 2 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 2 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 3/158 variables, 56/211 constraints. Problems are: Problem set: 2 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 3/214 constraints. Problems are: Problem set: 2 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 2/216 constraints. Problems are: Problem set: 2 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/216 constraints. Problems are: Problem set: 2 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 133/291 variables, 158/374 constraints. Problems are: Problem set: 2 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 130/504 constraints. Problems are: Problem set: 2 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/504 constraints. Problems are: Problem set: 2 solved, 130 unsolved
[2024-05-29 05:52:47] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/291 variables, 1/505 constraints. Problems are: Problem set: 2 solved, 130 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 0/505 constraints. Problems are: Problem set: 2 solved, 130 unsolved
At refinement iteration 11 (OVERLAPS) 0/291 variables, 0/505 constraints. Problems are: Problem set: 2 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 505 constraints, problems are : Problem set: 2 solved, 130 unsolved in 30009 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 130/132 constraints, Known Traps: 3/3 constraints]
After SMT, in 33694ms problems are : Problem set: 2 solved, 130 unsolved
Search for dead transitions found 2 dead transitions in 33697ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 158/158 places, 131/133 transitions.
Graph (complete) has 412 edges and 158 vertex of which 156 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 156 /158 variables (removed 2) and now considering 131/131 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 156/158 places, 131/133 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 33736 ms. Remains : 156/158 places, 131/133 transitions.
Support contains 5 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Applied a total of 0 rules in 2 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
// Phase 1: matrix 133 rows 158 cols
[2024-05-29 05:53:10] [INFO ] Computed 56 invariants in 0 ms
[2024-05-29 05:53:10] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-29 05:53:10] [INFO ] Invariant cache hit.
[2024-05-29 05:53:10] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-05-29 05:53:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 133/291 variables, 158/372 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-29 05:53:12] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-29 05:53:13] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-29 05:53:13] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 3/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 375 constraints, problems are : Problem set: 0 solved, 132 unsolved in 4306 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/291 variables, 158/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 132/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (OVERLAPS) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 507 constraints, problems are : Problem set: 0 solved, 132 unsolved in 10807 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
After SMT, in 15138ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 15140ms
Finished structural reductions in LTL mode , in 1 iterations and 15442 ms. Remains : 158/158 places, 133/133 transitions.
Treatment of property ShieldPPPs-PT-005A-LTLFireability-14 finished in 82604 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(G(!p1))))))'
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Applied a total of 0 rules in 2 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2024-05-29 05:53:26] [INFO ] Invariant cache hit.
[2024-05-29 05:53:26] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-29 05:53:26] [INFO ] Invariant cache hit.
[2024-05-29 05:53:26] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-05-29 05:53:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 133/291 variables, 158/372 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-29 05:53:28] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-29 05:53:28] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:53:28] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 3/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 375 constraints, problems are : Problem set: 0 solved, 132 unsolved in 4025 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/291 variables, 158/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 132/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (OVERLAPS) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 507 constraints, problems are : Problem set: 0 solved, 132 unsolved in 10647 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
After SMT, in 14708ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 14710ms
Finished structural reductions in LTL mode , in 1 iterations and 15039 ms. Remains : 158/158 places, 133/133 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Running random walk in product with property : ShieldPPPs-PT-005A-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-005A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-005A-LTLFireability-15 finished in 15169 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p1))&&p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(!p1)||G(!p2))&&p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&G(p1))))'
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(p1)||p0))&&F(p2)))'
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)))'
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((X(p0)||F((!p1 U (p2||G(!p1)))))))'
Found a Lengthening insensitive property : ShieldPPPs-PT-005A-LTLFireability-14
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) p1)]
Support contains 5 out of 158 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 156 transition count 131
Applied a total of 4 rules in 6 ms. Remains 156 /158 variables (removed 2) and now considering 131/133 (removed 2) transitions.
// Phase 1: matrix 131 rows 156 cols
[2024-05-29 05:53:42] [INFO ] Computed 56 invariants in 1 ms
[2024-05-29 05:53:42] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-29 05:53:42] [INFO ] Invariant cache hit.
[2024-05-29 05:53:42] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2024-05-29 05:53:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 131/287 variables, 156/368 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-29 05:53:44] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-29 05:53:46] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/287 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 370 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5662 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/287 variables, 156/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 130/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 500 constraints, problems are : Problem set: 0 solved, 130 unsolved in 7056 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
After SMT, in 12744ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 12747ms
Starting structural reductions in LI_LTL mode, iteration 1 : 156/158 places, 131/133 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 13040 ms. Remains : 156/158 places, 131/133 transitions.
Running random walk in product with property : ShieldPPPs-PT-005A-LTLFireability-14
Product exploration explored 100000 steps with 272 reset in 291 ms.
Product exploration explored 100000 steps with 269 reset in 327 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 p2 (NOT p0) (NOT p1)), (X (AND (NOT p2) (NOT p0))), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 141 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) p1)]
RANDOM walk for 761 steps (1 resets) in 8 ms. (84 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (AND (NOT p2) (NOT p0))), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F p0), (F p1), (F (NOT p2)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 8 factoid took 303 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) p1)]
Support contains 5 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 131/131 transitions.
Applied a total of 0 rules in 2 ms. Remains 156 /156 variables (removed 0) and now considering 131/131 (removed 0) transitions.
[2024-05-29 05:53:56] [INFO ] Invariant cache hit.
[2024-05-29 05:53:56] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-29 05:53:56] [INFO ] Invariant cache hit.
[2024-05-29 05:53:57] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2024-05-29 05:53:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 131/287 variables, 156/368 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-29 05:53:58] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-29 05:54:00] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/287 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 370 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5644 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/287 variables, 156/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 130/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 500 constraints, problems are : Problem set: 0 solved, 130 unsolved in 7035 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
After SMT, in 12730ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 12732ms
Finished structural reductions in LTL mode , in 1 iterations and 13035 ms. Remains : 156/156 places, 131/131 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 113 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) p1)]
RANDOM walk for 629 steps (0 resets) in 9 ms. (62 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F p0), (F p1), (F (NOT p2)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 8 factoid took 256 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) p1)]
Product exploration explored 100000 steps with 274 reset in 282 ms.
Product exploration explored 100000 steps with 275 reset in 313 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) p1)]
Support contains 5 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 131/131 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 131/131 (removed 0) transitions.
[2024-05-29 05:54:11] [INFO ] Redundant transitions in 0 ms returned []
Running 130 sub problems to find dead transitions.
[2024-05-29 05:54:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 131/287 variables, 156/368 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-29 05:54:13] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-29 05:54:14] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/287 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 370 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5415 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/287 variables, 156/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 130/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 500 constraints, problems are : Problem set: 0 solved, 130 unsolved in 7004 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
After SMT, in 12447ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 12449ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12461 ms. Remains : 156/156 places, 131/131 transitions.
Support contains 5 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 131/131 transitions.
Applied a total of 0 rules in 3 ms. Remains 156 /156 variables (removed 0) and now considering 131/131 (removed 0) transitions.
[2024-05-29 05:54:23] [INFO ] Invariant cache hit.
[2024-05-29 05:54:24] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-29 05:54:24] [INFO ] Invariant cache hit.
[2024-05-29 05:54:24] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2024-05-29 05:54:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 131/287 variables, 156/368 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-29 05:54:25] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-29 05:54:27] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/287 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 370 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5469 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/287 variables, 156/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 130/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 500 constraints, problems are : Problem set: 0 solved, 130 unsolved in 7021 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
After SMT, in 12513ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 12514ms
Finished structural reductions in LTL mode , in 1 iterations and 12774 ms. Remains : 156/156 places, 131/131 transitions.
Treatment of property ShieldPPPs-PT-005A-LTLFireability-14 finished in 54708 ms.
[2024-05-29 05:54:36] [INFO ] Flatten gal took : 26 ms
[2024-05-29 05:54:36] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-29 05:54:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 158 places, 133 transitions and 506 arcs took 2 ms.
Total runtime 570534 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldPPPs-PT-005A

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 3032
MODEL NAME: /home/mcc/execution/411/model
158 places, 133 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...

BK_TIME_CONFINEMENT_REACHED

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

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

MEDDLY ERROR: Insufficient memory

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="ShieldPPPs-PT-005A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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