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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K 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 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 11 14:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 14:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 14:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K Apr 11 14:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 37K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717004951081

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-002B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 17:49:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 17:49:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 17:49:12] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2024-05-29 17:49:12] [INFO ] Transformed 159 places.
[2024-05-29 17:49:12] [INFO ] Transformed 145 transitions.
[2024-05-29 17:49:12] [INFO ] Found NUPN structural information;
[2024-05-29 17:49:12] [INFO ] Parsed PT model containing 159 places and 145 transitions and 362 arcs in 166 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 3 formulas.
FORMULA ShieldPPPt-PT-002B-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-002B-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-002B-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 145/145 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 143 transition count 129
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 143 transition count 129
Applied a total of 32 rules in 34 ms. Remains 143 /159 variables (removed 16) and now considering 129/145 (removed 16) transitions.
// Phase 1: matrix 129 rows 143 cols
[2024-05-29 17:49:12] [INFO ] Computed 23 invariants in 16 ms
[2024-05-29 17:49:12] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-29 17:49:12] [INFO ] Invariant cache hit.
[2024-05-29 17:49:13] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2024-05-29 17:49:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-29 17:49:14] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 16 ms to minimize.
[2024-05-29 17:49:14] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-29 17:49:14] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-29 17:49:14] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-05-29 17:49:14] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-29 17:49:14] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-29 17:49:14] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:49:14] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:49:14] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-29 17:49:14] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-29 17:49:14] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2024-05-29 17:49:15] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 1 ms to minimize.
[2024-05-29 17:49:15] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-29 17:49:15] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-29 17:49:15] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 29 ms to minimize.
[2024-05-29 17:49:15] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-29 17:49:15] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-29 17:49:15] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 18/41 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-29 17:49:16] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 3 ms to minimize.
[2024-05-29 17:49:16] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (OVERLAPS) 129/272 variables, 143/186 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-29 17:49:17] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 0/272 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 187 constraints, problems are : Problem set: 0 solved, 128 unsolved in 6272 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 21/44 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-29 17:49:20] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (OVERLAPS) 129/272 variables, 143/188 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 128/316 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-29 17:49:21] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:49:21] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:49:21] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 3/319 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-29 17:49:22] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-29 17:49:22] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-29 17:49:22] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-29 17:49:23] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 4/323 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-29 17:49:25] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/272 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 12 (OVERLAPS) 0/272 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 324 constraints, problems are : Problem set: 0 solved, 128 unsolved in 10521 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 30/30 constraints]
After SMT, in 16935ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 16962ms
Starting structural reductions in LTL mode, iteration 1 : 143/159 places, 129/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17418 ms. Remains : 143/159 places, 129/145 transitions.
Support contains 34 out of 143 places after structural reductions.
[2024-05-29 17:49:30] [INFO ] Flatten gal took : 56 ms
[2024-05-29 17:49:30] [INFO ] Flatten gal took : 15 ms
[2024-05-29 17:49:30] [INFO ] Input system was already deterministic with 129 transitions.
Reduction of identical properties reduced properties to check from 33 to 32
RANDOM walk for 18282 steps (3 resets) in 762 ms. (23 steps per ms) remains 0/32 properties
Computed a total of 33 stabilizing places and 33 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 129/129 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 142 transition count 100
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 30 rules applied. Total rules applied 58 place count 114 transition count 98
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 113 transition count 98
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 59 place count 113 transition count 85
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 85 place count 100 transition count 85
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 91 place count 94 transition count 79
Iterating global reduction 3 with 6 rules applied. Total rules applied 97 place count 94 transition count 79
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 97 place count 94 transition count 74
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 107 place count 89 transition count 74
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 167 place count 59 transition count 44
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 177 place count 54 transition count 44
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 179 place count 52 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 180 place count 51 transition count 42
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 180 place count 51 transition count 40
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 184 place count 49 transition count 40
Applied a total of 184 rules in 42 ms. Remains 49 /143 variables (removed 94) and now considering 40/129 (removed 89) transitions.
// Phase 1: matrix 40 rows 49 cols
[2024-05-29 17:49:31] [INFO ] Computed 22 invariants in 0 ms
[2024-05-29 17:49:31] [INFO ] Implicit Places using invariants in 97 ms returned [32, 36]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 99 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/143 places, 40/129 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 45 transition count 38
Applied a total of 4 rules in 3 ms. Remains 45 /47 variables (removed 2) and now considering 38/40 (removed 2) transitions.
// Phase 1: matrix 38 rows 45 cols
[2024-05-29 17:49:31] [INFO ] Computed 20 invariants in 1 ms
[2024-05-29 17:49:31] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-29 17:49:31] [INFO ] Invariant cache hit.
[2024-05-29 17:49:31] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/143 places, 38/129 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 326 ms. Remains : 45/143 places, 38/129 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLFireability-00
Product exploration explored 100000 steps with 1343 reset in 342 ms.
Stack based approach found an accepted trace after 1789 steps with 28 reset with depth 28 and stack size 28 in 5 ms.
FORMULA ShieldPPPt-PT-002B-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-002B-LTLFireability-00 finished in 920 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))||((p1 U G(p2))&&X(p3))))'
Support contains 5 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 129/129 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 138 transition count 124
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 138 transition count 124
Applied a total of 10 rules in 8 ms. Remains 138 /143 variables (removed 5) and now considering 124/129 (removed 5) transitions.
// Phase 1: matrix 124 rows 138 cols
[2024-05-29 17:49:32] [INFO ] Computed 23 invariants in 2 ms
[2024-05-29 17:49:32] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-29 17:49:32] [INFO ] Invariant cache hit.
[2024-05-29 17:49:32] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-05-29 17:49:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-29 17:49:33] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-29 17:49:33] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 1 ms to minimize.
[2024-05-29 17:49:33] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-29 17:49:34] [INFO ] Deduced a trap composed of 19 places in 615 ms of which 14 ms to minimize.
[2024-05-29 17:49:34] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 4 ms to minimize.
[2024-05-29 17:49:35] [INFO ] Deduced a trap composed of 12 places in 626 ms of which 1 ms to minimize.
[2024-05-29 17:49:35] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
[2024-05-29 17:49:36] [INFO ] Deduced a trap composed of 21 places in 776 ms of which 0 ms to minimize.
[2024-05-29 17:49:36] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-29 17:49:36] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 2 ms to minimize.
[2024-05-29 17:49:36] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-29 17:49:36] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-29 17:49:36] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 9 ms to minimize.
[2024-05-29 17:49:36] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 14/37 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-29 17:49:36] [INFO ] Deduced a trap composed of 16 places in 17 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 124/262 variables, 138/176 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-29 17:49:37] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 0/262 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 177 constraints, problems are : Problem set: 0 solved, 123 unsolved in 7286 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 124/262 variables, 138/177 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 123/300 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-29 17:49:40] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2024-05-29 17:49:41] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-29 17:49:41] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-29 17:49:41] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-05-29 17:49:41] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-29 17:49:41] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-29 17:49:41] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-29 17:49:41] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 8/308 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-29 17:49:42] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-29 17:49:42] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-29 17:49:43] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-29 17:49:44] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-29 17:49:44] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (OVERLAPS) 0/262 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 313 constraints, problems are : Problem set: 0 solved, 123 unsolved in 7914 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 29/29 constraints]
After SMT, in 15236ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 15238ms
Starting structural reductions in LTL mode, iteration 1 : 138/143 places, 124/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15463 ms. Remains : 138/143 places, 124/129 transitions.
Stuttering acceptance computed with spot in 314 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLFireability-01
Product exploration explored 100000 steps with 331 reset in 199 ms.
Stack based approach found an accepted trace after 341 steps with 1 reset with depth 131 and stack size 131 in 1 ms.
FORMULA ShieldPPPt-PT-002B-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-002B-LTLFireability-01 finished in 16016 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(X(p1)&&(p2 U G(p3)))))'
Support contains 3 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 129/129 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 137 transition count 123
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 137 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 136 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 136 transition count 122
Applied a total of 14 rules in 17 ms. Remains 136 /143 variables (removed 7) and now considering 122/129 (removed 7) transitions.
// Phase 1: matrix 122 rows 136 cols
[2024-05-29 17:49:48] [INFO ] Computed 23 invariants in 6 ms
[2024-05-29 17:49:48] [INFO ] Implicit Places using invariants in 432 ms returned []
[2024-05-29 17:49:48] [INFO ] Invariant cache hit.
[2024-05-29 17:49:48] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-05-29 17:49:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:49:49] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-29 17:49:49] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-29 17:49:49] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-29 17:49:49] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:49:49] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-29 17:49:49] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-29 17:49:49] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-29 17:49:49] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2024-05-29 17:49:50] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:49:50] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:49:50] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-29 17:49:50] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:49:50] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 13/36 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:49:50] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:49:51] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-29 17:49:51] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:49:51] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 122/258 variables, 136/176 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:49:52] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (OVERLAPS) 0/258 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 177 constraints, problems are : Problem set: 0 solved, 121 unsolved in 5422 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 18/41 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/258 variables, 136/177 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 121/298 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:49:55] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 2 ms to minimize.
[2024-05-29 17:49:55] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:49:55] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:49:55] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-29 17:49:55] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 5/303 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:49:56] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-29 17:49:56] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:49:57] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2024-05-29 17:49:58] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:49:59] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:50:00] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 12 (OVERLAPS) 0/258 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 309 constraints, problems are : Problem set: 0 solved, 121 unsolved in 9616 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 29/29 constraints]
After SMT, in 15079ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 15094ms
Starting structural reductions in LTL mode, iteration 1 : 136/143 places, 122/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15671 ms. Remains : 136/143 places, 122/129 transitions.
Stuttering acceptance computed with spot in 274 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (AND (NOT p3) (NOT p0) p1), true, (NOT p3), (NOT p3)]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-002B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-002B-LTLFireability-02 finished in 15993 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(p1)&&p0) U p2)))'
Support contains 3 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 129/129 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 136 transition count 122
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 136 transition count 122
Applied a total of 14 rules in 3 ms. Remains 136 /143 variables (removed 7) and now considering 122/129 (removed 7) transitions.
// Phase 1: matrix 122 rows 136 cols
[2024-05-29 17:50:04] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 17:50:04] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-29 17:50:04] [INFO ] Invariant cache hit.
[2024-05-29 17:50:04] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-05-29 17:50:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:50:05] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-29 17:50:05] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-29 17:50:05] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-29 17:50:05] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-29 17:50:05] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:50:05] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:50:05] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:50:05] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-29 17:50:05] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-29 17:50:05] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2024-05-29 17:50:05] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-29 17:50:05] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:50:05] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-29 17:50:05] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 14/37 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/258 variables, 136/173 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 0/258 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 173 constraints, problems are : Problem set: 0 solved, 121 unsolved in 3497 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 14/37 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:50:08] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-29 17:50:08] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:50:08] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 122/258 variables, 136/176 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 121/297 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:50:09] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-29 17:50:09] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:50:09] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:50:09] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-29 17:50:10] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-29 17:50:10] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
[2024-05-29 17:50:10] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:50:10] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 8/305 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:50:11] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-29 17:50:11] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:50:12] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:50:12] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 12 (OVERLAPS) 0/258 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 309 constraints, problems are : Problem set: 0 solved, 121 unsolved in 8677 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 29/29 constraints]
After SMT, in 12237ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 12240ms
Starting structural reductions in LTL mode, iteration 1 : 136/143 places, 122/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12483 ms. Remains : 136/143 places, 122/129 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-002B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-002B-LTLFireability-03 finished in 12614 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U ((p1||X(!p2)) U X(p3))))'
Support contains 6 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 129/129 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 136 transition count 122
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 136 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 135 transition count 121
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 135 transition count 121
Applied a total of 16 rules in 6 ms. Remains 135 /143 variables (removed 8) and now considering 121/129 (removed 8) transitions.
// Phase 1: matrix 121 rows 135 cols
[2024-05-29 17:50:16] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 17:50:17] [INFO ] Implicit Places using invariants in 308 ms returned []
[2024-05-29 17:50:17] [INFO ] Invariant cache hit.
[2024-05-29 17:50:17] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-05-29 17:50:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 17:50:17] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-29 17:50:17] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:50:17] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:50:18] [INFO ] Deduced a trap composed of 19 places in 16 ms of which 1 ms to minimize.
[2024-05-29 17:50:18] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-29 17:50:18] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-29 17:50:18] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:50:18] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-29 17:50:18] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-29 17:50:18] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-05-29 17:50:18] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-29 17:50:18] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-05-29 17:50:18] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-29 17:50:18] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-29 17:50:18] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 17:50:18] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-29 17:50:18] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 17:50:19] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/256 variables, 135/176 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 17:50:20] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 0/256 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 177 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4964 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 19/42 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/256 variables, 135/177 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 120/297 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 17:50:23] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:50:23] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-29 17:50:23] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-29 17:50:23] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 4/301 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/256 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 301 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4639 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 23/23 constraints]
After SMT, in 9641ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 9643ms
Starting structural reductions in LTL mode, iteration 1 : 135/143 places, 121/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10057 ms. Remains : 135/143 places, 121/129 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p3), (AND (NOT p0) p2 (NOT p3)), (NOT p3), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLFireability-04
Product exploration explored 100000 steps with 33374 reset in 77 ms.
Product exploration explored 100000 steps with 33359 reset in 90 ms.
Computed a total of 30 stabilizing places and 30 stable transitions
Computed a total of 30 stabilizing places and 30 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT p3)), (X (AND (NOT p1) (NOT p0) (NOT p3))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT p3))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 183 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(NOT p3), (AND (NOT p0) p2 (NOT p3)), (NOT p3), (NOT p0)]
RANDOM walk for 3028 steps (0 resets) in 48 ms. (61 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT p3)), (X (AND (NOT p1) (NOT p0) (NOT p3))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT p3))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (F p0), (F p1), (F p2), (F p3), (F (NOT (OR p0 (NOT p2) p3)))]
Knowledge based reduction with 13 factoid took 243 ms. Reduced automaton from 4 states, 5 edges and 4 AP (stutter sensitive) to 4 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p3), (AND (NOT p0) p2 (NOT p3)), (NOT p3), (NOT p0)]
Stuttering acceptance computed with spot in 206 ms :[(NOT p3), (AND (NOT p0) p2 (NOT p3)), (NOT p3), (NOT p0)]
[2024-05-29 17:50:28] [INFO ] Invariant cache hit.
Proved EG (NOT p3)
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT p3)), (X (AND (NOT p1) (NOT p0) (NOT p3))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT p3))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (F p0), (F p1), (F p2), (F p3), (F (NOT (OR p0 (NOT p2) p3))), (G (NOT p3))]
Property proved to be false thanks to negative knowledge :(G (NOT p3))
Knowledge based reduction with 13 factoid took 255 ms. Reduced automaton from 4 states, 5 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-002B-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-002B-LTLFireability-04 finished in 11917 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((F(p0)&&(p1||G(p2))))))'
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 129/129 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 136 transition count 122
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 136 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 135 transition count 121
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 135 transition count 121
Applied a total of 16 rules in 5 ms. Remains 135 /143 variables (removed 8) and now considering 121/129 (removed 8) transitions.
[2024-05-29 17:50:28] [INFO ] Invariant cache hit.
[2024-05-29 17:50:29] [INFO ] Implicit Places using invariants in 405 ms returned []
[2024-05-29 17:50:29] [INFO ] Invariant cache hit.
[2024-05-29 17:50:29] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-05-29 17:50:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 17:50:29] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:50:30] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-29 17:50:30] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-29 17:50:30] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
[2024-05-29 17:50:30] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-29 17:50:30] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-29 17:50:30] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:50:30] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-29 17:50:30] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-29 17:50:30] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:50:30] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-05-29 17:50:30] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 0 ms to minimize.
[2024-05-29 17:50:30] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-29 17:50:30] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2024-05-29 17:50:30] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 17:50:30] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:50:31] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 17:50:31] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/256 variables, 135/176 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 17:50:32] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 0/256 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 177 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5171 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 19/42 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/256 variables, 135/177 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 120/297 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 17:50:35] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:50:35] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:50:35] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-05-29 17:50:36] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 4/301 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/256 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 301 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4699 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 23/23 constraints]
After SMT, in 9895ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 9896ms
Starting structural reductions in LTL mode, iteration 1 : 135/143 places, 121/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10399 ms. Remains : 135/143 places, 121/129 transitions.
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 76 ms.
Product exploration explored 100000 steps with 50000 reset in 76 ms.
Computed a total of 30 stabilizing places and 30 stable transitions
Computed a total of 30 stabilizing places and 30 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 41 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-002B-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-002B-LTLFireability-05 finished in 10842 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((G(F(p0)) U !p0)))))'
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 129/129 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 137 transition count 123
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 137 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 136 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 136 transition count 122
Applied a total of 14 rules in 3 ms. Remains 136 /143 variables (removed 7) and now considering 122/129 (removed 7) transitions.
// Phase 1: matrix 122 rows 136 cols
[2024-05-29 17:50:39] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 17:50:39] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-29 17:50:39] [INFO ] Invariant cache hit.
[2024-05-29 17:50:39] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-05-29 17:50:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:50:40] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-29 17:50:40] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2024-05-29 17:50:40] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-29 17:50:40] [INFO ] Deduced a trap composed of 19 places in 16 ms of which 0 ms to minimize.
[2024-05-29 17:50:40] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-29 17:50:40] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-05-29 17:50:40] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:50:40] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:50:41] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-29 17:50:41] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-29 17:50:41] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:50:41] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-29 17:50:41] [INFO ] Deduced a trap composed of 17 places in 16 ms of which 1 ms to minimize.
[2024-05-29 17:50:41] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:50:41] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-29 17:50:41] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/258 variables, 136/175 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:50:42] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:50:42] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 0/258 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 177 constraints, problems are : Problem set: 0 solved, 121 unsolved in 4214 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 18/41 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:50:44] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/258 variables, 136/178 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 121/299 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:50:45] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:50:45] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-29 17:50:45] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-29 17:50:45] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-29 17:50:46] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-29 17:50:46] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 6/305 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:50:48] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/258 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 0/258 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 306 constraints, problems are : Problem set: 0 solved, 121 unsolved in 8114 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 26/26 constraints]
After SMT, in 12348ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 12350ms
Starting structural reductions in LTL mode, iteration 1 : 136/143 places, 122/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12531 ms. Remains : 136/143 places, 122/129 transitions.
Stuttering acceptance computed with spot in 193 ms :[p0, p0, p0, (NOT p0), p0, (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLFireability-07
Product exploration explored 100000 steps with 216 reset in 125 ms.
Stack based approach found an accepted trace after 11581 steps with 21 reset with depth 658 and stack size 657 in 16 ms.
FORMULA ShieldPPPt-PT-002B-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-002B-LTLFireability-07 finished in 12878 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(G(p1)||X(p2))))'
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 129/129 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 137 transition count 123
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 137 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 136 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 136 transition count 122
Applied a total of 14 rules in 5 ms. Remains 136 /143 variables (removed 7) and now considering 122/129 (removed 7) transitions.
// Phase 1: matrix 122 rows 136 cols
[2024-05-29 17:50:52] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 17:50:52] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-29 17:50:52] [INFO ] Invariant cache hit.
[2024-05-29 17:50:52] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-05-29 17:50:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:50:53] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-29 17:50:53] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-29 17:50:53] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-29 17:50:53] [INFO ] Deduced a trap composed of 19 places in 16 ms of which 0 ms to minimize.
[2024-05-29 17:50:53] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:50:53] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-29 17:50:53] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2024-05-29 17:50:53] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-05-29 17:50:53] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2024-05-29 17:50:53] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-29 17:50:54] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-29 17:50:54] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:50:54] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-29 17:50:54] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:50:54] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:50:54] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-29 17:50:54] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:50:54] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-29 17:50:54] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/258 variables, 136/178 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:50:55] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:50:57] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-29 17:50:57] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/258 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (OVERLAPS) 0/258 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 181 constraints, problems are : Problem set: 0 solved, 121 unsolved in 6174 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 22/45 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/258 variables, 136/181 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 121/302 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:51:00] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:51:00] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-29 17:51:00] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:51:02] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-29 17:51:02] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-05-29 17:51:02] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/258 variables, 3/308 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:51:03] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 0/258 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 309 constraints, problems are : Problem set: 0 solved, 121 unsolved in 9093 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 29/29 constraints]
After SMT, in 15295ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 15296ms
Starting structural reductions in LTL mode, iteration 1 : 136/143 places, 122/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15463 ms. Remains : 136/143 places, 122/129 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLFireability-08
Product exploration explored 100000 steps with 3977 reset in 95 ms.
Product exploration explored 100000 steps with 4043 reset in 130 ms.
Computed a total of 30 stabilizing places and 30 stable transitions
Computed a total of 30 stabilizing places and 30 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 128 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 163 steps (0 resets) in 5 ms. (27 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 8 factoid took 146 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
[2024-05-29 17:51:08] [INFO ] Invariant cache hit.
[2024-05-29 17:51:08] [INFO ] [Real]Absence check using 23 positive place invariants in 4 ms returned sat
[2024-05-29 17:51:09] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-05-29 17:51:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 17:51:09] [INFO ] [Nat]Absence check using 23 positive place invariants in 5 ms returned sat
[2024-05-29 17:51:09] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-05-29 17:51:09] [INFO ] Computed and/alt/rep : 121/180/121 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-29 17:51:09] [INFO ] Added : 118 causal constraints over 24 iterations in 343 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 136 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 : 136/136 places, 122/122 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 135 transition count 98
Reduce places removed 23 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 47 place count 112 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 111 transition count 97
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 48 place count 111 transition count 80
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 82 place count 94 transition count 80
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 146 place count 62 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 147 place count 62 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 149 place count 61 transition count 46
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 157 place count 57 transition count 46
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 159 place count 55 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 160 place count 54 transition count 44
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 160 place count 54 transition count 42
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 164 place count 52 transition count 42
Applied a total of 164 rules in 43 ms. Remains 52 /136 variables (removed 84) and now considering 42/122 (removed 80) transitions.
// Phase 1: matrix 42 rows 52 cols
[2024-05-29 17:51:09] [INFO ] Computed 22 invariants in 0 ms
[2024-05-29 17:51:09] [INFO ] Implicit Places using invariants in 53 ms returned [33, 37]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 54 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/136 places, 42/122 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 49 transition count 41
Applied a total of 2 rules in 3 ms. Remains 49 /50 variables (removed 1) and now considering 41/42 (removed 1) transitions.
// Phase 1: matrix 41 rows 49 cols
[2024-05-29 17:51:09] [INFO ] Computed 20 invariants in 1 ms
[2024-05-29 17:51:09] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-29 17:51:09] [INFO ] Invariant cache hit.
[2024-05-29 17:51:09] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/136 places, 41/122 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 204 ms. Remains : 49/136 places, 41/122 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 128 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 59 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 21 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 112 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 73 ms :[(NOT p0), (NOT p0)]
[2024-05-29 17:51:10] [INFO ] Invariant cache hit.
[2024-05-29 17:51:10] [INFO ] [Real]Absence check using 20 positive place invariants in 2 ms returned sat
[2024-05-29 17:51:10] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-29 17:51:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 17:51:10] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2024-05-29 17:51:10] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-29 17:51:10] [INFO ] Computed and/alt/rep : 37/60/37 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-29 17:51:10] [INFO ] Added : 28 causal constraints over 6 iterations in 37 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14652 reset in 187 ms.
Product exploration explored 100000 steps with 14591 reset in 124 ms.
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49/49 places, 41/41 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 48 transition count 39
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 47 transition count 39
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 6 place count 45 transition count 37
Applied a total of 6 rules in 3 ms. Remains 45 /49 variables (removed 4) and now considering 37/41 (removed 4) transitions.
// Phase 1: matrix 37 rows 45 cols
[2024-05-29 17:51:10] [INFO ] Computed 20 invariants in 1 ms
[2024-05-29 17:51:10] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-29 17:51:10] [INFO ] Invariant cache hit.
[2024-05-29 17:51:11] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
[2024-05-29 17:51:11] [INFO ] Redundant transitions in 0 ms returned []
Running 34 sub problems to find dead transitions.
[2024-05-29 17:51:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 2/45 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 37/82 variables, 45/65 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 0/82 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/82 variables, and 65 constraints, problems are : Problem set: 0 solved, 34 unsolved in 495 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 2/45 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 37/82 variables, 45/65 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 34/99 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 0/82 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/82 variables, and 99 constraints, problems are : Problem set: 0 solved, 34 unsolved in 340 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints]
After SMT, in 859ms problems are : Problem set: 0 solved, 34 unsolved
Search for dead transitions found 0 dead transitions in 861ms
Starting structural reductions in SI_LTL mode, iteration 1 : 45/49 places, 37/41 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1380 ms. Remains : 45/49 places, 37/41 transitions.
Treatment of property ShieldPPPt-PT-002B-LTLFireability-08 finished in 19798 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 X((!p0||(p1&&F(G(p2))))))))'
Support contains 3 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 129/129 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 137 transition count 123
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 137 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 136 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 136 transition count 122
Applied a total of 14 rules in 3 ms. Remains 136 /143 variables (removed 7) and now considering 122/129 (removed 7) transitions.
// Phase 1: matrix 122 rows 136 cols
[2024-05-29 17:51:12] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 17:51:12] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-29 17:51:12] [INFO ] Invariant cache hit.
[2024-05-29 17:51:12] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-05-29 17:51:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:51:13] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:51:13] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:51:13] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-29 17:51:13] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 0 ms to minimize.
[2024-05-29 17:51:13] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:51:13] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 0 ms to minimize.
[2024-05-29 17:51:13] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:51:13] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-29 17:51:13] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:51:13] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:51:13] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:51:13] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:51:13] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 13/36 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/258 variables, 136/172 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:51:14] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:51:15] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 0/258 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 174 constraints, problems are : Problem set: 0 solved, 121 unsolved in 4372 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/258 variables, 136/174 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 121/295 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:51:17] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:51:17] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-29 17:51:18] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:51:18] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-29 17:51:18] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-29 17:51:18] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 6/301 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:51:19] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:51:20] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:51:21] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:51:22] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 0/258 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 305 constraints, problems are : Problem set: 0 solved, 121 unsolved in 8518 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 25/25 constraints]
After SMT, in 12901ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 12903ms
Starting structural reductions in LTL mode, iteration 1 : 136/143 places, 122/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13039 ms. Remains : 136/143 places, 122/129 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), true, (NOT p2), (AND p0 (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLFireability-09
Product exploration explored 100000 steps with 33333 reset in 64 ms.
Product exploration explored 100000 steps with 33333 reset in 66 ms.
Computed a total of 30 stabilizing places and 30 stable transitions
Computed a total of 30 stabilizing places and 30 stable transitions
Detected a total of 30/136 stabilizing places and 30/122 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 11 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-002B-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-002B-LTLFireability-09 finished in 13450 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 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 129/129 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 137 transition count 123
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 137 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 136 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 136 transition count 122
Applied a total of 14 rules in 4 ms. Remains 136 /143 variables (removed 7) and now considering 122/129 (removed 7) transitions.
// Phase 1: matrix 122 rows 136 cols
[2024-05-29 17:51:25] [INFO ] Computed 23 invariants in 4 ms
[2024-05-29 17:51:25] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-29 17:51:25] [INFO ] Invariant cache hit.
[2024-05-29 17:51:25] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-05-29 17:51:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:51:26] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:51:26] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:51:26] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-29 17:51:26] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-05-29 17:51:26] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:51:26] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 5 ms to minimize.
[2024-05-29 17:51:26] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:51:27] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-29 17:51:27] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-29 17:51:27] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:51:27] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-29 17:51:27] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 2 ms to minimize.
[2024-05-29 17:51:27] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 2 ms to minimize.
[2024-05-29 17:51:27] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:51:27] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:51:27] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:51:28] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 122/258 variables, 136/176 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 0/258 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 176 constraints, problems are : Problem set: 0 solved, 121 unsolved in 4147 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/258 variables, 136/176 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 121/297 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:51:31] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:51:31] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:51:31] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:51:31] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-29 17:51:31] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-05-29 17:51:31] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-29 17:51:31] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-29 17:51:31] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 8/305 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:51:32] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:51:34] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (OVERLAPS) 0/258 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 307 constraints, problems are : Problem set: 0 solved, 121 unsolved in 7276 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 27/27 constraints]
After SMT, in 11491ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 11493ms
Starting structural reductions in LTL mode, iteration 1 : 136/143 places, 122/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11683 ms. Remains : 136/143 places, 122/129 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLFireability-10
Entered a terminal (fully accepting) state of product in 235 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-002B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-002B-LTLFireability-10 finished in 11846 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(G(p1) U p2)))))'
Support contains 5 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 129/129 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 143 transition count 102
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 29 rules applied. Total rules applied 56 place count 116 transition count 100
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 60 place count 115 transition count 97
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 63 place count 112 transition count 97
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 63 place count 112 transition count 87
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 83 place count 102 transition count 87
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 89 place count 96 transition count 81
Iterating global reduction 4 with 6 rules applied. Total rules applied 95 place count 96 transition count 81
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 95 place count 96 transition count 76
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 105 place count 91 transition count 76
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 163 place count 62 transition count 47
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 173 place count 57 transition count 47
Applied a total of 173 rules in 19 ms. Remains 57 /143 variables (removed 86) and now considering 47/129 (removed 82) transitions.
// Phase 1: matrix 47 rows 57 cols
[2024-05-29 17:51:37] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 17:51:37] [INFO ] Implicit Places using invariants in 77 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 87 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/143 places, 47/129 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 56 transition count 45
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 54 transition count 45
Applied a total of 4 rules in 2 ms. Remains 54 /56 variables (removed 2) and now considering 45/47 (removed 2) transitions.
// Phase 1: matrix 45 rows 54 cols
[2024-05-29 17:51:37] [INFO ] Computed 22 invariants in 0 ms
[2024-05-29 17:51:37] [INFO ] Implicit Places using invariants in 39 ms returned [35, 40]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 66 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/143 places, 45/129 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 50 transition count 43
Applied a total of 4 rules in 2 ms. Remains 50 /52 variables (removed 2) and now considering 43/45 (removed 2) transitions.
// Phase 1: matrix 43 rows 50 cols
[2024-05-29 17:51:37] [INFO ] Computed 20 invariants in 1 ms
[2024-05-29 17:51:37] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-29 17:51:37] [INFO ] Invariant cache hit.
[2024-05-29 17:51:37] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 17:51:37] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 50/143 places, 43/129 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 285 ms. Remains : 50/143 places, 43/129 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2)]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLFireability-11
Stuttering criterion allowed to conclude after 5519 steps with 0 reset in 16 ms.
FORMULA ShieldPPPt-PT-002B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-002B-LTLFireability-11 finished in 494 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(G(p1)))))'
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 129/129 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 136 transition count 122
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 136 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 135 transition count 121
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 135 transition count 121
Applied a total of 16 rules in 3 ms. Remains 135 /143 variables (removed 8) and now considering 121/129 (removed 8) transitions.
// Phase 1: matrix 121 rows 135 cols
[2024-05-29 17:51:38] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 17:51:38] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-29 17:51:38] [INFO ] Invariant cache hit.
[2024-05-29 17:51:38] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-05-29 17:51:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 17:51:38] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-29 17:51:38] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-29 17:51:38] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:51:39] [INFO ] Deduced a trap composed of 19 places in 15 ms of which 1 ms to minimize.
[2024-05-29 17:51:39] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-29 17:51:39] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-29 17:51:39] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:51:39] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-29 17:51:39] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-29 17:51:39] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-29 17:51:39] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:51:39] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-29 17:51:39] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-05-29 17:51:39] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:51:39] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 17:51:39] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
[2024-05-29 17:51:39] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 17:51:40] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/256 variables, 135/176 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 17:51:41] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 0/256 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 177 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 19/42 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/256 variables, 135/177 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 120/297 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 17:51:44] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-29 17:51:44] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-29 17:51:44] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:51:44] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 4/301 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/256 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 301 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4644 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 23/23 constraints]
After SMT, in 9688ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 9690ms
Starting structural reductions in LTL mode, iteration 1 : 135/143 places, 121/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9835 ms. Remains : 135/143 places, 121/129 transitions.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLFireability-12
Product exploration explored 100000 steps with 3 reset in 150 ms.
Stack based approach found an accepted trace after 379 steps with 0 reset with depth 380 and stack size 380 in 1 ms.
FORMULA ShieldPPPt-PT-002B-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-002B-LTLFireability-12 finished in 10180 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 129/129 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 136 transition count 122
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 136 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 135 transition count 121
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 135 transition count 121
Applied a total of 16 rules in 15 ms. Remains 135 /143 variables (removed 8) and now considering 121/129 (removed 8) transitions.
[2024-05-29 17:51:48] [INFO ] Invariant cache hit.
[2024-05-29 17:51:48] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-29 17:51:48] [INFO ] Invariant cache hit.
[2024-05-29 17:51:48] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-05-29 17:51:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 17:51:49] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-29 17:51:49] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-29 17:51:49] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:51:49] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-29 17:51:49] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-29 17:51:50] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:51:50] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-29 17:51:50] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:51:50] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-29 17:51:50] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-29 17:51:50] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-29 17:51:50] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 0 ms to minimize.
[2024-05-29 17:51:50] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:51:50] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:51:50] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 17:51:50] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-29 17:51:50] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 17:51:51] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/256 variables, 135/176 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 17:51:52] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 0/256 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 177 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5609 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 19/42 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/256 variables, 135/177 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 120/297 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 17:51:55] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:51:55] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-29 17:51:55] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:51:55] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 4/301 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/256 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 301 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4677 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 23/23 constraints]
After SMT, in 10309ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 10310ms
Starting structural reductions in LTL mode, iteration 1 : 135/143 places, 121/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10615 ms. Remains : 135/143 places, 121/129 transitions.
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-002B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-002B-LTLFireability-14 finished in 10690 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(G(p1)||X(p2))))'
[2024-05-29 17:51:59] [INFO ] Flatten gal took : 15 ms
[2024-05-29 17:51:59] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-29 17:51:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 143 places, 129 transitions and 330 arcs took 3 ms.
Total runtime 166887 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldPPPt-PT-002B

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/412/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: 2228
MODEL NAME: /home/mcc/execution/412/model
143 places, 129 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ShieldPPPt-PT-002B-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717005264702

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-002B"
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 ShieldPPPt-PT-002B, 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-171683759000556"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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