Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K 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.6K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Apr 11 21:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 11 21:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 11 21:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 11 21:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 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 60K 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 ShieldRVt-PT-005B-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717076376168

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-005B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-30 13:39:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 13:39:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 13:39:37] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-05-30 13:39:37] [INFO ] Transformed 253 places.
[2024-05-30 13:39:37] [INFO ] Transformed 253 transitions.
[2024-05-30 13:39:37] [INFO ] Found NUPN structural information;
[2024-05-30 13:39:37] [INFO ] Parsed PT model containing 253 places and 253 transitions and 596 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ShieldRVt-PT-005B-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-005B-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-005B-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-005B-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-005B-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 253/253 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 210 transition count 210
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 210 transition count 210
Applied a total of 86 rules in 54 ms. Remains 210 /253 variables (removed 43) and now considering 210/253 (removed 43) transitions.
// Phase 1: matrix 210 rows 210 cols
[2024-05-30 13:39:37] [INFO ] Computed 21 invariants in 17 ms
[2024-05-30 13:39:38] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-05-30 13:39:38] [INFO ] Invariant cache hit.
[2024-05-30 13:39:38] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
Running 209 sub problems to find dead transitions.
[2024-05-30 13:39:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-30 13:39:40] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 11 ms to minimize.
[2024-05-30 13:39:40] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:39:40] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:39:40] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-30 13:39:40] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 0 ms to minimize.
[2024-05-30 13:39:40] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-05-30 13:39:40] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:39:41] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 210/420 variables, 210/239 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (OVERLAPS) 0/420 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 239 constraints, problems are : Problem set: 0 solved, 209 unsolved in 8093 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-30 13:39:47] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (OVERLAPS) 210/420 variables, 210/240 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 209/449 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-30 13:39:49] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:39:49] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:39:49] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:39:49] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:39:49] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:39:49] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:39:49] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:39:49] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:39:49] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 2 ms to minimize.
[2024-05-30 13:39:49] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:39:50] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:39:50] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:39:50] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 2 ms to minimize.
[2024-05-30 13:39:50] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:39:50] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:39:50] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:39:51] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 2 ms to minimize.
[2024-05-30 13:39:51] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:39:51] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:39:51] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 20/469 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-30 13:39:51] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:39:52] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 2 ms to minimize.
[2024-05-30 13:39:52] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:39:52] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:39:52] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 2 ms to minimize.
[2024-05-30 13:39:52] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 2 ms to minimize.
[2024-05-30 13:39:52] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:39:53] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:39:53] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:39:53] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:39:53] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:39:53] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:39:53] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:39:53] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:39:53] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:39:53] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:39:53] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:39:54] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:39:54] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:39:54] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 20/489 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-30 13:39:55] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-30 13:39:55] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:39:55] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:39:55] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:39:55] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 2 ms to minimize.
[2024-05-30 13:39:55] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:39:55] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 2 ms to minimize.
[2024-05-30 13:39:56] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 8 ms to minimize.
[2024-05-30 13:39:56] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:39:56] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:39:57] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:39:57] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:39:57] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 13/502 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-30 13:39:58] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:39:59] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:40:00] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:40:00] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:40:00] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:40:00] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:40:00] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/420 variables, 7/509 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-30 13:40:02] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/420 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-30 13:40:06] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/420 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-30 13:40:08] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/420 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-30 13:40:13] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:40:13] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/420 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 514 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 74/74 constraints]
After SMT, in 38183ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 38200ms
Starting structural reductions in LTL mode, iteration 1 : 210/253 places, 210/253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38699 ms. Remains : 210/253 places, 210/253 transitions.
Support contains 30 out of 210 places after structural reductions.
[2024-05-30 13:40:16] [INFO ] Flatten gal took : 37 ms
[2024-05-30 13:40:16] [INFO ] Flatten gal took : 16 ms
[2024-05-30 13:40:16] [INFO ] Input system was already deterministic with 210 transitions.
Reduction of identical properties reduced properties to check from 30 to 29
RANDOM walk for 4205 steps (0 resets) in 267 ms. (15 steps per ms) remains 0/29 properties
Computed a total of 64 stabilizing places and 64 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F(((p2 U p3)||p1)))))'
Support contains 6 out of 210 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 210/210 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 198 transition count 198
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 198 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 197 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 197 transition count 197
Applied a total of 26 rules in 13 ms. Remains 197 /210 variables (removed 13) and now considering 197/210 (removed 13) transitions.
// Phase 1: matrix 197 rows 197 cols
[2024-05-30 13:40:17] [INFO ] Computed 21 invariants in 2 ms
[2024-05-30 13:40:17] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-30 13:40:17] [INFO ] Invariant cache hit.
[2024-05-30 13:40:17] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-30 13:40:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:40:18] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-30 13:40:19] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-30 13:40:19] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:40:19] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:40:19] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:40:19] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:40:20] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 197/394 variables, 197/225 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/394 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 225 constraints, problems are : Problem set: 0 solved, 196 unsolved in 7345 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/394 variables, 197/225 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 196/421 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:40:26] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:40:26] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 2 ms to minimize.
[2024-05-30 13:40:26] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:40:26] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:40:27] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:40:27] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:40:27] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:40:27] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:40:27] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:40:27] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:40:27] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:40:27] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:40:28] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:40:28] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:40:28] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:40:28] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:40:28] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:40:28] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:40:28] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:40:28] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 20/441 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:40:29] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 2 ms to minimize.
[2024-05-30 13:40:29] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 2 ms to minimize.
[2024-05-30 13:40:29] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 2 ms to minimize.
[2024-05-30 13:40:30] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 2 ms to minimize.
[2024-05-30 13:40:30] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:40:30] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:40:31] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 7/448 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:40:32] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:40:32] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:40:33] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:40:33] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 4/452 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:40:35] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-30 13:40:35] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:40:35] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:40:35] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:40:36] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 5/457 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:40:37] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:40:39] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 1/459 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:40:43] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:40:43] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/394 variables, 2/461 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:40:45] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:40:45] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/394 variables, 2/463 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:40:48] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/394 variables, 1/464 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:40:51] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:40:52] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:40:52] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/394 variables, 3/467 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/394 variables, and 467 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 53/53 constraints]
After SMT, in 37387ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 37390ms
Starting structural reductions in LTL mode, iteration 1 : 197/210 places, 197/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37591 ms. Remains : 197/210 places, 197/210 transitions.
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p3))), true, (OR (NOT p0) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-00
Entered a terminal (fully accepting) state of product in 428 steps with 0 reset in 8 ms.
FORMULA ShieldRVt-PT-005B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLFireability-00 finished in 37904 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (G(p0)||p1)) U (G((p0 U (p1||G(p0))))||(X(p2)&&(p0 U (p1||G(p0)))))))'
Support contains 3 out of 210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 210/210 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 199 transition count 199
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 199 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 198 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 198 transition count 198
Applied a total of 24 rules in 14 ms. Remains 198 /210 variables (removed 12) and now considering 198/210 (removed 12) transitions.
// Phase 1: matrix 198 rows 198 cols
[2024-05-30 13:40:55] [INFO ] Computed 21 invariants in 2 ms
[2024-05-30 13:40:55] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-30 13:40:55] [INFO ] Invariant cache hit.
[2024-05-30 13:40:55] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2024-05-30 13:40:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:40:56] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-05-30 13:40:56] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:40:57] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-30 13:40:57] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-30 13:40:57] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/396 variables, 198/224 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (OVERLAPS) 0/396 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 224 constraints, problems are : Problem set: 0 solved, 197 unsolved in 6505 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/396 variables, 198/224 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 197/421 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:41:03] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:41:03] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 2 ms to minimize.
[2024-05-30 13:41:03] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:41:03] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:41:03] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:41:03] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:41:03] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:41:03] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:41:03] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:41:04] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:41:04] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:41:04] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:41:04] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:41:04] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:41:04] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:41:04] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 2 ms to minimize.
[2024-05-30 13:41:05] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:41:05] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:41:05] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:41:05] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 20/441 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:41:06] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:41:06] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 2 ms to minimize.
[2024-05-30 13:41:06] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:41:06] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:41:06] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:41:06] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:41:07] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:41:07] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:41:07] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 3 ms to minimize.
[2024-05-30 13:41:07] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:41:07] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:41:07] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:41:07] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:41:07] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:41:07] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:41:07] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:41:07] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:41:08] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:41:08] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:41:08] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 20/461 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:41:09] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2024-05-30 13:41:09] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:41:09] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:41:10] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 2 ms to minimize.
[2024-05-30 13:41:10] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:41:10] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:41:11] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 2 ms to minimize.
[2024-05-30 13:41:11] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:41:11] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:41:11] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:41:11] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:41:11] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 12/473 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:41:13] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:41:15] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 2 ms to minimize.
[2024-05-30 13:41:16] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 2/476 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:41:19] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:41:19] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 2/478 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:41:23] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:41:25] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/396 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/396 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 396/396 variables, and 480 constraints, problems are : Problem set: 0 solved, 197 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 64/64 constraints]
After SMT, in 36538ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 36541ms
Starting structural reductions in LTL mode, iteration 1 : 198/210 places, 198/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36802 ms. Remains : 198/210 places, 198/210 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 228 ms.
Product exploration explored 100000 steps with 50000 reset in 155 ms.
Computed a total of 59 stabilizing places and 59 stable transitions
Computed a total of 59 stabilizing places and 59 stable transitions
Detected a total of 59/198 stabilizing places and 59/198 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 18 factoid took 23 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-005B-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-005B-LTLFireability-03 finished in 37351 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0||F(p1)) U p2)||X(G(p3))))'
Support contains 3 out of 210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 210/210 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 199 transition count 199
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 199 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 198 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 198 transition count 198
Applied a total of 24 rules in 8 ms. Remains 198 /210 variables (removed 12) and now considering 198/210 (removed 12) transitions.
// Phase 1: matrix 198 rows 198 cols
[2024-05-30 13:41:32] [INFO ] Computed 21 invariants in 1 ms
[2024-05-30 13:41:32] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-30 13:41:32] [INFO ] Invariant cache hit.
[2024-05-30 13:41:32] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2024-05-30 13:41:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:41:34] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-30 13:41:34] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:41:34] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:41:34] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 1 ms to minimize.
[2024-05-30 13:41:34] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:41:34] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/396 variables, 198/225 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:41:36] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (OVERLAPS) 0/396 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 226 constraints, problems are : Problem set: 0 solved, 197 unsolved in 7532 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/396 variables, 198/226 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 197/423 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:41:41] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:41:42] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:41:42] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:41:42] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:41:42] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 2 ms to minimize.
[2024-05-30 13:41:42] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:41:42] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:41:42] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:41:42] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:41:42] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:41:42] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:41:43] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:41:43] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 2 ms to minimize.
[2024-05-30 13:41:43] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:41:43] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 2 ms to minimize.
[2024-05-30 13:41:43] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:41:43] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:41:43] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:41:43] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:41:43] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 20/443 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:41:44] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:41:44] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:41:44] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:41:44] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:41:45] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:41:45] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:41:45] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2024-05-30 13:41:45] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:41:45] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:41:45] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:41:45] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:41:45] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:41:45] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:41:46] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 2 ms to minimize.
[2024-05-30 13:41:46] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:41:46] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:41:46] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:41:46] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:41:46] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:41:46] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 20/463 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:41:48] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:41:48] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:41:49] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:41:49] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 4/467 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:41:51] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:41:53] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:41:54] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 2/470 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:41:56] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 2 ms to minimize.
[2024-05-30 13:41:57] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:41:57] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:41:57] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 4/474 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:41:59] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/396 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:42:05] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:42:05] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/396 variables, 2/477 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 396/396 variables, and 477 constraints, problems are : Problem set: 0 solved, 197 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 61/61 constraints]
After SMT, in 37564ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 37566ms
Starting structural reductions in LTL mode, iteration 1 : 198/210 places, 198/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37814 ms. Remains : 198/210 places, 198/210 transitions.
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-04
Product exploration explored 100000 steps with 6508 reset in 158 ms.
Product exploration explored 100000 steps with 6573 reset in 166 ms.
Computed a total of 58 stabilizing places and 58 stable transitions
Computed a total of 58 stabilizing places and 58 stable transitions
Detected a total of 58/198 stabilizing places and 58/198 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1 p3), (X (NOT p2)), (X (NOT (AND (NOT p1) p3))), (X p3), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) p3))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p3)))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) p3)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 23 factoid took 160 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 13 states, 37 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 600 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1), (NOT p2), false, false, false, false, false, false, false, false]
Reduction of identical properties reduced properties to check from 20 to 19
RANDOM walk for 40000 steps (9 resets) in 978 ms. (40 steps per ms) remains 9/19 properties
BEST_FIRST walk for 40002 steps (8 resets) in 132 ms. (300 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 104 ms. (380 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 39 ms. (1000 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 9/9 properties
[2024-05-30 13:42:12] [INFO ] Invariant cache hit.
Problem apf3 is UNSAT
Problem apf7 is UNSAT
Problem apf9 is UNSAT
Problem apf10 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 5 unsolved
Problem apf1 is UNSAT
Problem apf4 is UNSAT
Problem apf12 is UNSAT
Problem apf15 is UNSAT
At refinement iteration 1 (OVERLAPS) 44/47 variables, 4/4 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 151/198 variables, 17/21 constraints. Problems are: Problem set: 8 solved, 1 unsolved
[2024-05-30 13:42:12] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 1/22 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 0/22 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 198/396 variables, 198/220 constraints. Problems are: Problem set: 8 solved, 1 unsolved
[2024-05-30 13:42:12] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 1/221 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 0/221 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/396 variables, 0/221 constraints. Problems are: Problem set: 8 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 221 constraints, problems are : Problem set: 8 solved, 1 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 8 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/47 variables, 4/4 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 151/198 variables, 17/21 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 2/23 constraints. Problems are: Problem set: 8 solved, 1 unsolved
[2024-05-30 13:42:12] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:42:12] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 2/25 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/25 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 198/396 variables, 198/223 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 1/224 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 0/224 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/396 variables, 0/224 constraints. Problems are: Problem set: 8 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 224 constraints, problems are : Problem set: 8 solved, 1 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 1/9 constraints, Known Traps: 4/4 constraints]
After SMT, in 408ms problems are : Problem set: 8 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 198/198 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 198 transition count 145
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 106 place count 145 transition count 145
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 106 place count 145 transition count 106
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 184 place count 106 transition count 106
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 274 place count 61 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 275 place count 61 transition count 60
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 277 place count 60 transition count 59
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 305 place count 46 transition count 72
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 306 place count 46 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 307 place count 45 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 308 place count 44 transition count 70
Applied a total of 308 rules in 30 ms. Remains 44 /198 variables (removed 154) and now considering 70/198 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 44/198 places, 70/198 transitions.
RANDOM walk for 40000 steps (25 resets) in 528 ms. (75 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (9 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2796198 steps, run timeout after 3001 ms. (steps per millisecond=931 ) properties seen :0 out of 1
Probabilistic random walk after 2796198 steps, saw 620741 distinct states, run finished after 3004 ms. (steps per millisecond=930 ) properties seen :0
// Phase 1: matrix 70 rows 44 cols
[2024-05-30 13:42:15] [INFO ] Computed 20 invariants in 3 ms
[2024-05-30 13:42:15] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 27/41 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/67 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/67 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/67 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 22/89 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/89 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/89 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 19/108 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/108 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/108 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/114 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/114 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/114 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/114 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 74 constraints, problems are : Problem set: 0 solved, 1 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 44/44 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 27/41 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/67 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/67 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/67 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/67 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 22/89 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/89 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/89 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 19/108 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/108 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/108 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/114 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/114 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/114 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/114 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 75 constraints, problems are : Problem set: 0 solved, 1 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 44/44 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 153ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 44 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 44/44 places, 70/70 transitions.
Applied a total of 0 rules in 3 ms. Remains 44 /44 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 44/44 places, 70/70 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 44/44 places, 70/70 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2024-05-30 13:42:16] [INFO ] Invariant cache hit.
[2024-05-30 13:42:16] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-30 13:42:16] [INFO ] Invariant cache hit.
[2024-05-30 13:42:16] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-30 13:42:16] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2024-05-30 13:42:16] [INFO ] Redundant transitions in 1 ms returned []
Running 66 sub problems to find dead transitions.
[2024-05-30 13:42:16] [INFO ] Invariant cache hit.
[2024-05-30 13:42:16] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-30 13:42:16] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 70/114 variables, 44/65 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 10/75 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 0/114 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 75 constraints, problems are : Problem set: 0 solved, 66 unsolved in 810 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 44/44 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 70/114 variables, 44/65 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 10/75 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 66/141 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 0/114 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 141 constraints, problems are : Problem set: 0 solved, 66 unsolved in 757 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 44/44 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 1/1 constraints]
After SMT, in 1591ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 1592ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1702 ms. Remains : 44/44 places, 70/70 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 19 edges and 44 vertex of which 4 / 44 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 126 edges and 42 vertex of which 40 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 16 edges and 38 vertex of which 4 / 38 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 36 transition count 61
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 36 transition count 56
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 2 with 2 rules applied. Total rules applied 15 place count 35 transition count 55
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 35 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 34 transition count 49
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 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 25 place count 32 transition count 48
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 29 place count 32 transition count 44
Applied a total of 29 rules in 22 ms. Remains 32 /44 variables (removed 12) and now considering 44/70 (removed 26) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 44 rows 32 cols
[2024-05-30 13:42:17] [INFO ] Computed 15 invariants in 0 ms
[2024-05-30 13:42:17] [INFO ] [Real]Absence check using 15 positive place invariants in 1 ms returned sat
[2024-05-30 13:42:17] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 13:42:17] [INFO ] [Nat]Absence check using 15 positive place invariants in 1 ms returned sat
[2024-05-30 13:42:17] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-30 13:42:17] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-30 13:42:17] [INFO ] After 3ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-30 13:42:17] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-30 13:42:17] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 108 ms.
Found 8 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1 p3), (X (NOT p2)), (X (NOT (AND (NOT p1) p3))), (X p3), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) p3))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p3)))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) p3)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (G (OR p1 (NOT p3) p0 p2)), (G (OR p1 (NOT p3) p0 (NOT p2))), (G (OR (NOT p1) p3 p0 (NOT p2))), (G (OR (NOT p1) p3 (NOT p0) (NOT p2))), (G (OR p1 (NOT p3))), (G (OR p1 p3 (NOT p0) (NOT p2))), (G (OR p1 p3 p0 (NOT p2))), (G (OR p1 (NOT p3) (NOT p0) (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR p3 p2))), (F (NOT (OR p1 p3))), (F (NOT (OR p3 p2))), (F (NOT (OR (NOT p1) (NOT p3) p0 (NOT p2)))), (F (NOT p1)), (F p2), (F p0), (F (NOT (OR p1 p3 p0 p2))), (F (NOT p3)), (F (NOT (OR p1 p0 p2))), (F (NOT (AND p3 (NOT p2))))]
Knowledge based reduction with 31 factoid took 611 ms. Reduced automaton from 13 states, 37 edges and 4 AP (stutter insensitive) to 20 states, 57 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1006 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p1), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p3) p2 (NOT p0) (NOT p1)), (AND p3 p2 (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p0) p1), false, false, (AND (NOT p3) (NOT p2) p0 (NOT p1)), false, false, (AND (NOT p3) (NOT p2) p0 p1), false, false, (AND (NOT p1) (NOT p0) p2 (NOT p3)), false, false, false]
Stuttering acceptance computed with spot in 1133 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p1), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p3) p2 (NOT p0) (NOT p1)), (AND p3 p2 (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p0) p1), false, false, (AND (NOT p3) (NOT p2) p0 (NOT p1)), false, false, (AND (NOT p3) (NOT p2) p0 p1), false, false, (AND (NOT p1) (NOT p0) p2 (NOT p3)), false, false, false]
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 198/198 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 197 transition count 144
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 106 place count 144 transition count 144
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 106 place count 144 transition count 105
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 184 place count 105 transition count 105
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 270 place count 62 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 271 place count 62 transition count 61
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 273 place count 61 transition count 60
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 301 place count 47 transition count 73
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 303 place count 45 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 304 place count 44 transition count 71
Applied a total of 304 rules in 21 ms. Remains 44 /198 variables (removed 154) and now considering 71/198 (removed 127) transitions.
// Phase 1: matrix 71 rows 44 cols
[2024-05-30 13:42:20] [INFO ] Computed 20 invariants in 0 ms
[2024-05-30 13:42:20] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-30 13:42:20] [INFO ] Invariant cache hit.
[2024-05-30 13:42:20] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-30 13:42:20] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-30 13:42:20] [INFO ] Redundant transitions in 1 ms returned []
Running 66 sub problems to find dead transitions.
[2024-05-30 13:42:20] [INFO ] Invariant cache hit.
[2024-05-30 13:42:20] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-30 13:42:21] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 70/114 variables, 44/65 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 10/75 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 0/114 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/115 variables, and 75 constraints, problems are : Problem set: 0 solved, 66 unsolved in 793 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 44/44 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 70/114 variables, 44/65 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 10/75 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 66/141 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 0/114 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/115 variables, and 141 constraints, problems are : Problem set: 0 solved, 66 unsolved in 793 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 44/44 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 1/1 constraints]
After SMT, in 1607ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 1607ms
Starting structural reductions in SI_LTL mode, iteration 1 : 44/198 places, 71/198 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1721 ms. Remains : 44/198 places, 71/198 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/44 stabilizing places and 2/71 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 p3 (NOT p2)), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X p3), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 p3))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 p2 p3))), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p2) p3))), (X (AND (NOT p0) p1 p2 p3)), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (AND (NOT p0) p1 p2 p3))), (X (X (NOT (AND (NOT p0) p1 p2 p3))))]
Knowledge based reduction with 32 factoid took 767 ms. Reduced automaton from 20 states, 57 edges and 4 AP (stutter insensitive) to 20 states, 57 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 895 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p1), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0) p2 (NOT p3)), false, false, false, (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p3) p2 (NOT p0) (NOT p1)), (AND p3 p2 (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p0) p1), false, false, (AND (NOT p3) (NOT p2) p0 (NOT p1)), false, false, (AND (NOT p3) (NOT p2) p0 p1), false, false]
RANDOM walk for 40000 steps (23 resets) in 426 ms. (93 steps per ms) remains 9/18 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (9 resets) in 45 ms. (869 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 62 ms. (634 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (9 resets) in 52 ms. (754 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (11 resets) in 50 ms. (784 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (9 resets) in 48 ms. (816 steps per ms) remains 9/9 properties
[2024-05-30 13:42:24] [INFO ] Invariant cache hit.
[2024-05-30 13:42:24] [INFO ] State equation strengthened by 10 read => feed constraints.
Problem apf3 is UNSAT
Problem apf14 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Problem apf1 is UNSAT
Problem apf5 is UNSAT
Problem apf8 is UNSAT
Problem apf9 is UNSAT
At refinement iteration 1 (OVERLAPS) 9/12 variables, 4/4 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 1/5 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 27/41 variables, 14/19 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 8/27 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/27 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 26/67 variables, 10/37 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 5/42 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/67 variables, 2/44 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/67 variables, 0/44 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 22/89 variables, 8/52 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/89 variables, 4/56 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/89 variables, 0/56 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 19/108 variables, 8/64 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/108 variables, 4/68 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/108 variables, 0/68 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 6/114 variables, 4/72 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/114 variables, 2/74 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/114 variables, 0/74 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/114 variables, 0/74 constraints. Problems are: Problem set: 6 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/115 variables, and 74 constraints, problems are : Problem set: 6 solved, 3 unsolved in 134 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 44/44 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 3 unsolved
Problem apf4 is UNSAT
Problem apf6 is UNSAT
At refinement iteration 1 (OVERLAPS) 9/12 variables, 4/4 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 1/5 constraints. Problems are: Problem set: 8 solved, 1 unsolved
[2024-05-30 13:42:24] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 1/6 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/6 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 27/41 variables, 14/20 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 8/28 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/41 variables, 0/28 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 26/67 variables, 10/38 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/67 variables, 5/43 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/67 variables, 2/45 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/67 variables, 1/46 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/67 variables, 0/46 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 22/89 variables, 8/54 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/89 variables, 4/58 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/89 variables, 0/58 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 19/108 variables, 8/66 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/108 variables, 4/70 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/108 variables, 0/70 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/114 variables, 4/74 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/114 variables, 2/76 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/114 variables, 0/76 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/114 variables, 0/76 constraints. Problems are: Problem set: 8 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/115 variables, and 76 constraints, problems are : Problem set: 8 solved, 1 unsolved in 103 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 44/44 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/9 constraints, Known Traps: 1/1 constraints]
After SMT, in 251ms problems are : Problem set: 8 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 44 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 44/44 places, 71/71 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 44 transition count 70
Applied a total of 1 rules in 4 ms. Remains 44 /44 variables (removed 0) and now considering 70/71 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 44/44 places, 70/71 transitions.
RANDOM walk for 40000 steps (32 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2823716 steps, run timeout after 3001 ms. (steps per millisecond=940 ) properties seen :0 out of 1
Probabilistic random walk after 2823716 steps, saw 641563 distinct states, run finished after 3001 ms. (steps per millisecond=940 ) properties seen :0
// Phase 1: matrix 70 rows 44 cols
[2024-05-30 13:42:27] [INFO ] Computed 20 invariants in 1 ms
[2024-05-30 13:42:27] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 27/41 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/67 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/67 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/67 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 22/89 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/89 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/89 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 19/108 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/108 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/108 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/114 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/114 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/114 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/114 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 74 constraints, problems are : Problem set: 0 solved, 1 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 44/44 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 27/41 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/67 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/67 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/67 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/67 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 22/89 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/89 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/89 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 19/108 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/108 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/108 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/114 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/114 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/114 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/114 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 75 constraints, problems are : Problem set: 0 solved, 1 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 44/44 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 155ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 44 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 44/44 places, 70/70 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 44/44 places, 70/70 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 44/44 places, 70/70 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2024-05-30 13:42:27] [INFO ] Invariant cache hit.
[2024-05-30 13:42:27] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-30 13:42:27] [INFO ] Invariant cache hit.
[2024-05-30 13:42:28] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-30 13:42:28] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-05-30 13:42:28] [INFO ] Redundant transitions in 1 ms returned []
Running 66 sub problems to find dead transitions.
[2024-05-30 13:42:28] [INFO ] Invariant cache hit.
[2024-05-30 13:42:28] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-30 13:42:28] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 70/114 variables, 44/65 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 10/75 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 0/114 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 75 constraints, problems are : Problem set: 0 solved, 66 unsolved in 854 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 44/44 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 70/114 variables, 44/65 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 10/75 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 66/141 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 0/114 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 141 constraints, problems are : Problem set: 0 solved, 66 unsolved in 783 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 44/44 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 1/1 constraints]
After SMT, in 1677ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 1678ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1767 ms. Remains : 44/44 places, 70/70 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 19 edges and 44 vertex of which 4 / 44 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 126 edges and 42 vertex of which 40 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 16 edges and 38 vertex of which 4 / 38 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 36 transition count 61
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 36 transition count 56
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 2 with 2 rules applied. Total rules applied 15 place count 35 transition count 55
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 35 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 34 transition count 49
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 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 25 place count 32 transition count 48
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 29 place count 32 transition count 44
Applied a total of 29 rules in 8 ms. Remains 32 /44 variables (removed 12) and now considering 44/70 (removed 26) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 44 rows 32 cols
[2024-05-30 13:42:29] [INFO ] Computed 15 invariants in 0 ms
[2024-05-30 13:42:29] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2024-05-30 13:42:29] [INFO ] After 14ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-30 13:42:29] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-30 13:42:29] [INFO ] After 3ms SMT Verify possible using 4 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 13:42:29] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 13:42:29] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2024-05-30 13:42:29] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-30 13:42:29] [INFO ] After 3ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-30 13:42:29] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-30 13:42:29] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 92 ms.
Found 8 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p3 (NOT p2)), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X p3), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 p3))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 p2 p3))), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (G (OR p0 p1 (NOT p2) p3)), (G (OR p0 (NOT p1) (NOT p2) p3)), (G (OR p0 (NOT p1) p2 p3)), (G (OR p0 p1 (NOT p2) (NOT p3))), (G (OR (NOT p0) p1 (NOT p2) (NOT p3))), (G (OR (NOT p0) (NOT p1) p2 p3)), (G (OR (NOT p0) p1 (NOT p2) p3)), (G (OR (NOT p0) (NOT p1) (NOT p2) p3))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p2) p3))), (X (AND (NOT p0) p1 p2 p3)), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (AND (NOT p0) p1 p2 p3))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (F (NOT (AND (NOT p2) p3))), (F p0), (F (NOT (OR p0 p1))), (F p2), (F (NOT p1)), (F (NOT (OR p0 p1 p2 p3))), (F (NOT (OR p0 (NOT p1) (NOT p2) (NOT p3)))), (F (NOT p3)), (F (NOT (OR (NOT p0) p1 p2 p3)))]
Knowledge based reduction with 40 factoid took 1254 ms. Reduced automaton from 20 states, 57 edges and 4 AP (stutter insensitive) to 16 states, 45 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 710 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p1), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p3) p2 (NOT p0)), false, false, (AND (NOT p1) (NOT p3) (NOT p2) p0), false, false, false, (AND (NOT p1) (NOT p0) p2 (NOT p3)), false, false, false]
Stuttering acceptance computed with spot in 779 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p1), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p3) p2 (NOT p0)), false, false, (AND (NOT p1) (NOT p3) (NOT p2) p0), false, false, false, (AND (NOT p1) (NOT p0) p2 (NOT p3)), false, false, false]
Stuttering acceptance computed with spot in 707 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p1), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p3) p2 (NOT p0)), false, false, (AND (NOT p1) (NOT p3) (NOT p2) p0), false, false, false, (AND (NOT p1) (NOT p0) p2 (NOT p3)), false, false, false]
Product exploration explored 100000 steps with 27709 reset in 203 ms.
Product exploration explored 100000 steps with 27842 reset in 251 ms.
Built C files in :
/tmp/ltsmin5002539330386533714
[2024-05-30 13:42:33] [INFO ] Computing symmetric may disable matrix : 71 transitions.
[2024-05-30 13:42:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 13:42:33] [INFO ] Computing symmetric may enable matrix : 71 transitions.
[2024-05-30 13:42:33] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 13:42:33] [INFO ] Computing Do-Not-Accords matrix : 71 transitions.
[2024-05-30 13:42:33] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 13:42:33] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5002539330386533714
Running compilation step : cd /tmp/ltsmin5002539330386533714;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 296 ms.
Running link step : cd /tmp/ltsmin5002539330386533714;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin5002539330386533714;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1371480213711906842.hoa' '--buchi-type=spotba'
LTSmin run took 306 ms.
FORMULA ShieldRVt-PT-005B-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-005B-LTLFireability-04 finished in 61951 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F(p1))))))'
Support contains 2 out of 210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 210/210 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 198 transition count 198
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 198 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 197 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 197 transition count 197
Applied a total of 26 rules in 10 ms. Remains 197 /210 variables (removed 13) and now considering 197/210 (removed 13) transitions.
// Phase 1: matrix 197 rows 197 cols
[2024-05-30 13:42:34] [INFO ] Computed 21 invariants in 1 ms
[2024-05-30 13:42:34] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-30 13:42:34] [INFO ] Invariant cache hit.
[2024-05-30 13:42:34] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-30 13:42:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:42:35] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:42:36] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:42:36] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:42:36] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 1 ms to minimize.
[2024-05-30 13:42:36] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/394 variables, 197/223 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 0/394 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 223 constraints, problems are : Problem set: 0 solved, 196 unsolved in 6315 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/394 variables, 197/223 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 196/419 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:42:42] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
[2024-05-30 13:42:42] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 2 ms to minimize.
[2024-05-30 13:42:42] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:42:42] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:42:42] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:42:43] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:42:43] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:42:43] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-05-30 13:42:43] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:42:43] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:42:43] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 2 ms to minimize.
[2024-05-30 13:42:43] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:42:43] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:42:43] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:42:44] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:42:44] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:42:44] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:42:44] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:42:44] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:42:44] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 20/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:42:45] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2024-05-30 13:42:45] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:42:45] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:42:45] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:42:45] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:42:45] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:42:45] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:42:46] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:42:46] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:42:46] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:42:46] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:42:46] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 2 ms to minimize.
[2024-05-30 13:42:46] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:42:46] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:42:47] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:42:47] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:42:47] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:42:47] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:42:47] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:42:47] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 20/459 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:42:48] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:42:48] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:42:49] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:42:49] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:42:50] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:42:50] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 6/465 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:42:52] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:42:54] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:42:54] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
[2024-05-30 13:42:54] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
[2024-05-30 13:42:55] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 4/470 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:42:57] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:42:57] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 2/472 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:43:01] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/394 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/394 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:43:07] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/394 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/394 variables, and 474 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 60/60 constraints]
After SMT, in 36337ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 36340ms
Starting structural reductions in LTL mode, iteration 1 : 197/210 places, 197/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36508 ms. Remains : 197/210 places, 197/210 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-05
Product exploration explored 100000 steps with 3490 reset in 131 ms.
Product exploration explored 100000 steps with 3561 reset in 178 ms.
Computed a total of 59 stabilizing places and 59 stable transitions
Computed a total of 59 stabilizing places and 59 stable transitions
Detected a total of 59/197 stabilizing places and 59/197 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 173 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 20092 steps (5 resets) in 45 ms. (436 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 438 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 197/197 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 196 transition count 144
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 104 place count 144 transition count 144
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 104 place count 144 transition count 103
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 186 place count 103 transition count 103
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 268 place count 62 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 269 place count 62 transition count 61
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 271 place count 61 transition count 60
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 299 place count 47 transition count 73
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 301 place count 45 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 302 place count 44 transition count 71
Applied a total of 302 rules in 24 ms. Remains 44 /197 variables (removed 153) and now considering 71/197 (removed 126) transitions.
// Phase 1: matrix 71 rows 44 cols
[2024-05-30 13:43:12] [INFO ] Computed 20 invariants in 1 ms
[2024-05-30 13:43:12] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-30 13:43:12] [INFO ] Invariant cache hit.
[2024-05-30 13:43:12] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-30 13:43:12] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2024-05-30 13:43:12] [INFO ] Redundant transitions in 0 ms returned []
Running 69 sub problems to find dead transitions.
[2024-05-30 13:43:12] [INFO ] Invariant cache hit.
[2024-05-30 13:43:12] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 2/44 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-05-30 13:43:12] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (OVERLAPS) 70/114 variables, 44/65 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 12/77 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 1/115 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (OVERLAPS) 0/115 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 115/115 variables, and 78 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1048 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 44/44 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 2/44 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (OVERLAPS) 70/114 variables, 44/65 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 12/77 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 69/146 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (OVERLAPS) 1/115 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/115 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 11 (OVERLAPS) 0/115 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 115/115 variables, and 147 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1082 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 44/44 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 1/1 constraints]
After SMT, in 2148ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 2149ms
Starting structural reductions in SI_LTL mode, iteration 1 : 44/197 places, 71/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2272 ms. Remains : 44/197 places, 71/197 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/44 stabilizing places and 4/71 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 739 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 12274 steps (9 resets) in 43 ms. (278 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 6 factoid took 961 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 38201 reset in 103 ms.
Product exploration explored 100000 steps with 37992 reset in 103 ms.
Built C files in :
/tmp/ltsmin17190345909112742463
[2024-05-30 13:43:17] [INFO ] Computing symmetric may disable matrix : 71 transitions.
[2024-05-30 13:43:17] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 13:43:17] [INFO ] Computing symmetric may enable matrix : 71 transitions.
[2024-05-30 13:43:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 13:43:17] [INFO ] Computing Do-Not-Accords matrix : 71 transitions.
[2024-05-30 13:43:17] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 13:43:17] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17190345909112742463
Running compilation step : cd /tmp/ltsmin17190345909112742463;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 205 ms.
Running link step : cd /tmp/ltsmin17190345909112742463;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin17190345909112742463;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11194883541224635306.hoa' '--buchi-type=spotba'
LTSmin run took 207 ms.
FORMULA ShieldRVt-PT-005B-LTLFireability-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-005B-LTLFireability-05 finished in 43734 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 2 out of 210 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 210/210 places, 210/210 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 209 transition count 152
Reduce places removed 57 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 59 rules applied. Total rules applied 116 place count 152 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 117 place count 151 transition count 150
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 117 place count 151 transition count 117
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 183 place count 118 transition count 117
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 193 place count 108 transition count 107
Iterating global reduction 3 with 10 rules applied. Total rules applied 203 place count 108 transition count 107
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 203 place count 108 transition count 100
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 217 place count 101 transition count 100
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 299 place count 60 transition count 59
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -11
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 325 place count 47 transition count 70
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 327 place count 45 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 328 place count 44 transition count 68
Applied a total of 328 rules in 20 ms. Remains 44 /210 variables (removed 166) and now considering 68/210 (removed 142) transitions.
// Phase 1: matrix 68 rows 44 cols
[2024-05-30 13:43:18] [INFO ] Computed 20 invariants in 1 ms
[2024-05-30 13:43:18] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-30 13:43:18] [INFO ] Invariant cache hit.
[2024-05-30 13:43:18] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-30 13:43:18] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2024-05-30 13:43:18] [INFO ] Redundant transitions in 1 ms returned []
Running 63 sub problems to find dead transitions.
[2024-05-30 13:43:18] [INFO ] Invariant cache hit.
[2024-05-30 13:43:18] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 67/111 variables, 44/64 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/111 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/112 variables, and 68 constraints, problems are : Problem set: 0 solved, 63 unsolved in 636 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 44/44 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 67/111 variables, 44/64 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 63/131 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/111 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/112 variables, and 131 constraints, problems are : Problem set: 0 solved, 63 unsolved in 711 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 44/44 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
After SMT, in 1362ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 1363ms
Starting structural reductions in SI_LTL mode, iteration 1 : 44/210 places, 68/210 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1495 ms. Remains : 44/210 places, 68/210 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-005B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLFireability-07 finished in 1624 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 210/210 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 197 transition count 197
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 197 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 196 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 196 transition count 196
Applied a total of 28 rules in 6 ms. Remains 196 /210 variables (removed 14) and now considering 196/210 (removed 14) transitions.
// Phase 1: matrix 196 rows 196 cols
[2024-05-30 13:43:19] [INFO ] Computed 21 invariants in 3 ms
[2024-05-30 13:43:19] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-30 13:43:19] [INFO ] Invariant cache hit.
[2024-05-30 13:43:19] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-30 13:43:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:43:21] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:43:21] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-30 13:43:21] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-30 13:43:21] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-30 13:43:21] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/392 variables, 196/222 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (OVERLAPS) 0/392 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 222 constraints, problems are : Problem set: 0 solved, 195 unsolved in 6328 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/392 variables, 196/222 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 195/417 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:43:27] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-30 13:43:28] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:43:28] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:43:28] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:43:28] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-30 13:43:28] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:43:28] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:43:28] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:43:28] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:43:28] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:43:29] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:43:29] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:43:29] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
[2024-05-30 13:43:29] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 2 ms to minimize.
[2024-05-30 13:43:29] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 2 ms to minimize.
[2024-05-30 13:43:29] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:43:29] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:43:29] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:43:29] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:43:30] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 20/437 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:43:30] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2024-05-30 13:43:30] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:43:31] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:43:31] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:43:31] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:43:31] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:43:31] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:43:32] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:43:32] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:43:32] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:43:32] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:43:32] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 12/449 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:43:34] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:43:34] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:43:34] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:43:34] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:43:34] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:43:35] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:43:35] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 7/456 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:43:39] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:43:40] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:43:40] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/392 variables, 3/459 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:43:43] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:43:48] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:43:48] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/392 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/392 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:43:54] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:43:54] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/392 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/392 variables, and 464 constraints, problems are : Problem set: 0 solved, 195 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 52/52 constraints]
After SMT, in 36362ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 36364ms
Starting structural reductions in LTL mode, iteration 1 : 196/210 places, 196/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36542 ms. Remains : 196/210 places, 196/210 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-08
Product exploration explored 100000 steps with 615 reset in 157 ms.
Stack based approach found an accepted trace after 878 steps with 6 reset with depth 125 and stack size 125 in 1 ms.
FORMULA ShieldRVt-PT-005B-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-005B-LTLFireability-08 finished in 36888 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)&&F((p1||(p2 U p3)))))'
Support contains 3 out of 210 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 210/210 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 197 transition count 197
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 197 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 196 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 196 transition count 196
Applied a total of 28 rules in 6 ms. Remains 196 /210 variables (removed 14) and now considering 196/210 (removed 14) transitions.
[2024-05-30 13:43:56] [INFO ] Invariant cache hit.
[2024-05-30 13:43:56] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-30 13:43:56] [INFO ] Invariant cache hit.
[2024-05-30 13:43:56] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-30 13:43:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:43:58] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:43:58] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:43:58] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-05-30 13:43:58] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:43:58] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/392 variables, 196/222 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (OVERLAPS) 0/392 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 222 constraints, problems are : Problem set: 0 solved, 195 unsolved in 6504 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/392 variables, 196/222 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 195/417 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:44:04] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 2 ms to minimize.
[2024-05-30 13:44:05] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 2 ms to minimize.
[2024-05-30 13:44:05] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:44:05] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:44:05] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 2 ms to minimize.
[2024-05-30 13:44:05] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:44:05] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:44:05] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 2 ms to minimize.
[2024-05-30 13:44:05] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 2 ms to minimize.
[2024-05-30 13:44:05] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 2 ms to minimize.
[2024-05-30 13:44:06] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-30 13:44:06] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:44:06] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:44:06] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:44:06] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:44:06] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:44:06] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:44:06] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:44:06] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:44:06] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 20/437 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:44:07] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:44:07] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:44:08] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:44:08] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:44:08] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:44:08] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:44:08] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:44:08] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:44:09] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:44:09] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:44:09] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:44:09] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 12/449 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:44:10] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 2 ms to minimize.
[2024-05-30 13:44:10] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:44:11] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:44:11] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:44:11] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-05-30 13:44:11] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:44:12] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 7/456 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:44:16] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:44:16] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:44:16] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/392 variables, 3/459 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:44:20] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:44:24] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:44:24] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/392 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/392 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:44:30] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:44:30] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/392 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/392 variables, and 464 constraints, problems are : Problem set: 0 solved, 195 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 52/52 constraints]
After SMT, in 36529ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 36531ms
Starting structural reductions in LTL mode, iteration 1 : 196/210 places, 196/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36692 ms. Remains : 196/210 places, 196/210 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), true]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-005B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLFireability-09 finished in 36849 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 U (p2||G(p1)))))) U ((p3&&X((p0||X((p1 U (p2||G(p1)))))))||X(G((p0||X((p1 U (p2||G(p1))))))))))'
Support contains 4 out of 210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 210/210 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 199 transition count 199
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 199 transition count 199
Applied a total of 22 rules in 6 ms. Remains 199 /210 variables (removed 11) and now considering 199/210 (removed 11) transitions.
// Phase 1: matrix 199 rows 199 cols
[2024-05-30 13:44:33] [INFO ] Computed 21 invariants in 1 ms
[2024-05-30 13:44:33] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-30 13:44:33] [INFO ] Invariant cache hit.
[2024-05-30 13:44:33] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-05-30 13:44:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-30 13:44:35] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2024-05-30 13:44:35] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:44:35] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-30 13:44:35] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:44:35] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/398 variables, 199/225 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 0/398 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 225 constraints, problems are : Problem set: 0 solved, 198 unsolved in 6476 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/398 variables, 199/225 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 198/423 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-30 13:44:41] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:44:42] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:44:42] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:44:42] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:44:42] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:44:42] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:44:42] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:44:42] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 2 ms to minimize.
[2024-05-30 13:44:42] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:44:42] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:44:42] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:44:42] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 2 ms to minimize.
[2024-05-30 13:44:43] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:44:43] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:44:43] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:44:43] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:44:43] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:44:43] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:44:43] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:44:43] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 20/443 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-30 13:44:44] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:44:44] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:44:44] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:44:44] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:44:45] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 2 ms to minimize.
[2024-05-30 13:44:45] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:44:45] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:44:45] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:44:45] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:44:45] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:44:45] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:44:45] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:44:45] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:44:45] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:44:46] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 4 ms to minimize.
[2024-05-30 13:44:46] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:44:46] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 17/460 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-30 13:44:47] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 2 ms to minimize.
[2024-05-30 13:44:48] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:44:48] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:44:48] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:44:48] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 2 ms to minimize.
[2024-05-30 13:44:48] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 6/466 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-30 13:44:50] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 2 ms to minimize.
[2024-05-30 13:44:50] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:44:51] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:44:51] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:44:51] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:44:51] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-05-30 13:44:51] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-05-30 13:44:51] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 8/474 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-30 13:44:55] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/398 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 12 (OVERLAPS) 0/398 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 475 constraints, problems are : Problem set: 0 solved, 198 unsolved in 22435 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 57/57 constraints]
After SMT, in 28930ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 28933ms
Starting structural reductions in LTL mode, iteration 1 : 199/210 places, 199/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29120 ms. Remains : 199/210 places, 199/210 transitions.
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), true, (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-11
Product exploration explored 100000 steps with 33444 reset in 81 ms.
Product exploration explored 100000 steps with 33348 reset in 90 ms.
Computed a total of 61 stabilizing places and 61 stable transitions
Computed a total of 61 stabilizing places and 61 stable transitions
Detected a total of 61/199 stabilizing places and 61/199 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) p1), (X (NOT p2)), (X (AND (NOT p2) p1)), (X (NOT p3)), (X (AND (NOT p3) p0 (NOT p2) p1)), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X p1), (X (X (AND (NOT p2) p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p3))), (X (X (AND (NOT p3) p0 (NOT p2) p1))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 178 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 40000 steps (9 resets) in 151 ms. (263 steps per ms) remains 1/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 400 ms. (99 steps per ms) remains 1/1 properties
[2024-05-30 13:45:03] [INFO ] Invariant cache hit.
Problem apf6 is UNSAT
After SMT solving in domain Real declared 4/398 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 12 ms.
Refiners :[Positive P Invariants (semi-flows): 0/21 constraints, State Equation: 0/199 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 14ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) p1), (X (NOT p2)), (X (AND (NOT p2) p1)), (X (NOT p3)), (X (AND (NOT p3) p0 (NOT p2) p1)), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X p1), (X (X (AND (NOT p2) p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p3))), (X (X (AND (NOT p3) p0 (NOT p2) p1))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 (NOT p1) p2 p3))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p1 p2))), (F (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (F (NOT (OR p0 p3))), (F p3), (F (NOT (OR p1 p2 p3))), (F p2), (F (NOT (OR p0 p2))), (F (NOT (OR p0 p1 p2 p3))), (F (NOT p1)), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 26 factoid took 622 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2)))]
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 199/199 transitions.
Applied a total of 0 rules in 3 ms. Remains 199 /199 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2024-05-30 13:45:04] [INFO ] Invariant cache hit.
[2024-05-30 13:45:04] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-30 13:45:04] [INFO ] Invariant cache hit.
[2024-05-30 13:45:04] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-05-30 13:45:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-30 13:45:06] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:45:06] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:45:06] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:45:06] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:45:06] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/398 variables, 199/225 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 0/398 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 225 constraints, problems are : Problem set: 0 solved, 198 unsolved in 6429 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/398 variables, 199/225 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 198/423 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-30 13:45:12] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:45:13] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:45:13] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:45:13] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:45:13] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:45:13] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 2 ms to minimize.
[2024-05-30 13:45:13] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:45:13] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:45:13] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:45:13] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:45:13] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:45:14] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:45:14] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:45:14] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:45:14] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:45:14] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:45:14] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:45:14] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:45:14] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:45:14] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 20/443 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-30 13:45:15] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:45:15] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:45:15] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:45:15] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:45:16] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 4 ms to minimize.
[2024-05-30 13:45:16] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:45:16] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:45:16] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:45:16] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:45:16] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:45:16] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:45:16] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:45:16] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:45:16] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:45:17] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:45:17] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:45:17] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 17/460 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-30 13:45:18] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:45:19] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:45:19] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:45:19] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:45:19] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:45:19] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 6/466 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-30 13:45:21] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:45:21] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:45:22] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:45:22] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:45:22] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:45:22] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:45:22] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-05-30 13:45:23] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 8/474 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-30 13:45:26] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/398 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 12 (OVERLAPS) 0/398 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 475 constraints, problems are : Problem set: 0 solved, 198 unsolved in 22587 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 57/57 constraints]
After SMT, in 29032ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 29034ms
Finished structural reductions in LTL mode , in 1 iterations and 29195 ms. Remains : 199/199 places, 199/199 transitions.
Computed a total of 61 stabilizing places and 61 stable transitions
Computed a total of 61 stabilizing places and 61 stable transitions
Detected a total of 61/199 stabilizing places and 61/199 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3) p1 (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (AND p0 p1 (NOT p2) (NOT p3))), (X (AND p1 (NOT p2))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (AND p0 p1 (NOT p2) (NOT p3)))), (X (X (AND p1 (NOT p2)))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 125 ms. Reduced automaton from 6 states, 13 edges and 4 AP (stutter sensitive) to 6 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), true, (AND (NOT p2) (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2)))]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (9 resets) in 237 ms. (168 steps per ms) remains 2/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
[2024-05-30 13:45:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 46/50 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 149/199 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 13:45:34] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:45:34] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 199/398 variables, 199/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 13:45:34] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/398 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 223 constraints, problems are : Problem set: 0 solved, 2 unsolved in 276 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 46/50 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 149/199 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 13:45:34] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 199/398 variables, 199/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 13:45:34] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:45:34] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/398 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 228 constraints, problems are : Problem set: 0 solved, 2 unsolved in 283 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 566ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 74 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=37 )
Parikh walk visited 2 properties in 6 ms.
Knowledge obtained : [(AND p0 (NOT p3) p1 (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (AND p0 p1 (NOT p2) (NOT p3))), (X (AND p1 (NOT p2))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (AND p0 p1 (NOT p2) (NOT p3)))), (X (X (AND p1 (NOT p2)))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p3), (F (NOT (OR p0 p2))), (F (NOT p0)), (F (NOT (OR p0 p3))), (F (NOT (AND (NOT p2) p1))), (F (NOT (AND p0 (NOT p3) (NOT p2) p1))), (F p2), (F (NOT (OR p0 p3 p2))), (F (NOT (OR p2 p1))), (F (NOT p1)), (F (NOT (OR p3 p2 p1)))]
Knowledge based reduction with 23 factoid took 506 ms. Reduced automaton from 6 states, 13 edges and 4 AP (stutter sensitive) to 6 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), true, (AND (NOT p2) (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), true, (AND (NOT p2) (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), true, (AND (NOT p2) (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 33344 reset in 77 ms.
Product exploration explored 100000 steps with 33312 reset in 85 ms.
Applying partial POR strategy [false, false, true, true, false, false]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), true, (AND (NOT p2) (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2)))]
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 199/199 transitions.
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 199 transition count 199
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 19 Pre rules applied. Total rules applied 53 place count 199 transition count 217
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 72 place count 199 transition count 217
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 131 places in 0 ms
Iterating global reduction 1 with 59 rules applied. Total rules applied 131 place count 199 transition count 217
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 169 place count 161 transition count 179
Deduced a syphon composed of 93 places in 0 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 207 place count 161 transition count 179
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -141
Deduced a syphon composed of 111 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 225 place count 161 transition count 320
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 243 place count 143 transition count 284
Deduced a syphon composed of 93 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 261 place count 143 transition count 284
Deduced a syphon composed of 93 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 264 place count 143 transition count 281
Deduced a syphon composed of 93 places in 0 ms
Applied a total of 264 rules in 36 ms. Remains 143 /199 variables (removed 56) and now considering 281/199 (removed -82) transitions.
[2024-05-30 13:45:36] [INFO ] Redundant transitions in 11 ms returned []
Running 280 sub problems to find dead transitions.
// Phase 1: matrix 281 rows 143 cols
[2024-05-30 13:45:36] [INFO ] Computed 21 invariants in 1 ms
[2024-05-30 13:45:36] [INFO ] State equation strengthened by 87 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-30 13:45:38] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-30 13:45:38] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-30 13:45:38] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-30 13:45:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-30 13:45:38] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-30 13:45:38] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
[2024-05-30 13:45:38] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-30 13:45:38] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
[2024-05-30 13:45:38] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
[2024-05-30 13:45:38] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
[2024-05-30 13:45:38] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-05-30 13:45:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-05-30 13:45:38] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-30 13:45:38] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-05-30 13:45:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-05-30 13:45:38] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-05-30 13:45:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-30 13:45:38] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
[2024-05-30 13:45:38] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-30 13:45:38] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD276 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 20/41 constraints. Problems are: Problem set: 190 solved, 90 unsolved
[2024-05-30 13:45:38] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
Problem TDEAD49 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 1/42 constraints. Problems are: Problem set: 201 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/42 constraints. Problems are: Problem set: 201 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 280/423 variables, 143/185 constraints. Problems are: Problem set: 201 solved, 79 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 86/271 constraints. Problems are: Problem set: 201 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 0/271 constraints. Problems are: Problem set: 201 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 1/424 variables, 1/272 constraints. Problems are: Problem set: 201 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 0/272 constraints. Problems are: Problem set: 201 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/424 variables, 0/272 constraints. Problems are: Problem set: 201 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 272 constraints, problems are : Problem set: 201 solved, 79 unsolved in 4131 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 143/143 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 201 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 201 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 94/143 variables, 21/21 constraints. Problems are: Problem set: 201 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 21/42 constraints. Problems are: Problem set: 201 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/42 constraints. Problems are: Problem set: 201 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 280/423 variables, 143/185 constraints. Problems are: Problem set: 201 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/423 variables, 86/271 constraints. Problems are: Problem set: 201 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 79/350 constraints. Problems are: Problem set: 201 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 0/350 constraints. Problems are: Problem set: 201 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 1/424 variables, 1/351 constraints. Problems are: Problem set: 201 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 0/351 constraints. Problems are: Problem set: 201 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/424 variables, 0/351 constraints. Problems are: Problem set: 201 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 424/424 variables, and 351 constraints, problems are : Problem set: 201 solved, 79 unsolved in 4468 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 143/143 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 79/280 constraints, Known Traps: 21/21 constraints]
After SMT, in 8714ms problems are : Problem set: 201 solved, 79 unsolved
Search for dead transitions found 201 dead transitions in 8717ms
Found 201 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 201 transitions
Dead transitions reduction (with SMT) removed 201 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 143/199 places, 80/199 transitions.
Graph (complete) has 249 edges and 143 vertex of which 50 are kept as prefixes of interest. Removing 93 places using SCC suffix rule.1 ms
Discarding 93 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 50 /143 variables (removed 93) and now considering 80/80 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/199 places, 80/199 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8776 ms. Remains : 50/199 places, 80/199 transitions.
Built C files in :
/tmp/ltsmin14893515810804226095
[2024-05-30 13:45:45] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14893515810804226095
Running compilation step : cd /tmp/ltsmin14893515810804226095;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 327 ms.
Running link step : cd /tmp/ltsmin14893515810804226095;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin14893515810804226095;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5909859655635042593.hoa' '--buchi-type=spotba'
LTSmin run took 264 ms.
FORMULA ShieldRVt-PT-005B-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-005B-LTLFireability-11 finished in 72605 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(((p2||X(p3))&&p1))))))'
Support contains 4 out of 210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 210/210 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 197 transition count 197
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 197 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 196 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 196 transition count 196
Applied a total of 28 rules in 14 ms. Remains 196 /210 variables (removed 14) and now considering 196/210 (removed 14) transitions.
// Phase 1: matrix 196 rows 196 cols
[2024-05-30 13:45:46] [INFO ] Computed 21 invariants in 4 ms
[2024-05-30 13:45:46] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-30 13:45:46] [INFO ] Invariant cache hit.
[2024-05-30 13:45:46] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-30 13:45:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:45:47] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-30 13:45:47] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:45:47] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-05-30 13:45:48] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-05-30 13:45:48] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/392 variables, 196/222 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (OVERLAPS) 0/392 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 222 constraints, problems are : Problem set: 0 solved, 195 unsolved in 6451 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/392 variables, 196/222 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 195/417 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:45:54] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:45:54] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:45:54] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:45:54] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:45:54] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:45:55] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:45:55] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:45:55] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-05-30 13:45:55] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:45:55] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:45:55] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 2 ms to minimize.
[2024-05-30 13:45:55] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:45:55] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-30 13:45:55] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:45:55] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 2 ms to minimize.
[2024-05-30 13:45:56] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:45:56] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:45:56] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:45:56] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:45:56] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 20/437 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:45:57] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:45:57] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:45:57] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:45:57] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:45:58] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:45:58] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:45:58] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:45:58] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:45:58] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:45:58] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:45:58] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:45:58] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 12/449 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:46:00] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:46:00] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:46:00] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:46:00] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:46:01] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2024-05-30 13:46:01] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:46:01] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 7/456 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:46:05] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:46:06] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 2 ms to minimize.
[2024-05-30 13:46:06] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/392 variables, 3/459 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:46:09] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:46:14] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:46:14] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/392 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/392 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:46:20] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:46:20] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/392 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/392 variables, and 464 constraints, problems are : Problem set: 0 solved, 195 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 52/52 constraints]
After SMT, in 36477ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 36479ms
Starting structural reductions in LTL mode, iteration 1 : 196/210 places, 196/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36649 ms. Remains : 196/210 places, 196/210 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-12
Stuttering criterion allowed to conclude after 11245 steps with 4 reset in 22 ms.
FORMULA ShieldRVt-PT-005B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLFireability-12 finished in 36865 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 210 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 210/210 places, 210/210 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 209 transition count 149
Reduce places removed 60 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 62 rules applied. Total rules applied 122 place count 149 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 123 place count 148 transition count 147
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 123 place count 148 transition count 115
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 187 place count 116 transition count 115
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 197 place count 106 transition count 105
Iterating global reduction 3 with 10 rules applied. Total rules applied 207 place count 106 transition count 105
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 207 place count 106 transition count 98
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 221 place count 99 transition count 98
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 303 place count 58 transition count 57
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 331 place count 44 transition count 70
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 333 place count 42 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 334 place count 41 transition count 68
Applied a total of 334 rules in 17 ms. Remains 41 /210 variables (removed 169) and now considering 68/210 (removed 142) transitions.
// Phase 1: matrix 68 rows 41 cols
[2024-05-30 13:46:23] [INFO ] Computed 20 invariants in 1 ms
[2024-05-30 13:46:23] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-30 13:46:23] [INFO ] Invariant cache hit.
[2024-05-30 13:46:23] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2024-05-30 13:46:23] [INFO ] Redundant transitions in 0 ms returned []
Running 64 sub problems to find dead transitions.
[2024-05-30 13:46:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 67/108 variables, 41/61 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 0/108 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/109 variables, and 61 constraints, problems are : Problem set: 0 solved, 64 unsolved in 511 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 41/41 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 67/108 variables, 41/61 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 64/125 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 0/108 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/109 variables, and 125 constraints, problems are : Problem set: 0 solved, 64 unsolved in 574 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 41/41 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 1100ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 1101ms
Starting structural reductions in SI_LTL mode, iteration 1 : 41/210 places, 68/210 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1235 ms. Remains : 41/210 places, 68/210 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-005B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLFireability-13 finished in 1341 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(G(p0)) U p1)))'
Support contains 2 out of 210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 210/210 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 199 transition count 199
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 199 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 198 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 198 transition count 198
Applied a total of 24 rules in 7 ms. Remains 198 /210 variables (removed 12) and now considering 198/210 (removed 12) transitions.
// Phase 1: matrix 198 rows 198 cols
[2024-05-30 13:46:24] [INFO ] Computed 21 invariants in 1 ms
[2024-05-30 13:46:24] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-30 13:46:24] [INFO ] Invariant cache hit.
[2024-05-30 13:46:24] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2024-05-30 13:46:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:46:25] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:46:25] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-30 13:46:26] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-30 13:46:26] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:46:26] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/396 variables, 198/224 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (OVERLAPS) 0/396 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 224 constraints, problems are : Problem set: 0 solved, 197 unsolved in 6474 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/396 variables, 198/224 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 197/421 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:46:32] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:46:32] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:46:32] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:46:33] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:46:33] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:46:33] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 2 ms to minimize.
[2024-05-30 13:46:33] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:46:33] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:46:33] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:46:33] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:46:33] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:46:33] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:46:33] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:46:33] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:46:34] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:46:34] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:46:34] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:46:34] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:46:34] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:46:34] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 20/441 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:46:35] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:46:35] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:46:35] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:46:35] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:46:35] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:46:35] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:46:35] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:46:36] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:46:36] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:46:36] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:46:36] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:46:36] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:46:36] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:46:37] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 14/455 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:46:38] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:46:39] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:46:39] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:46:39] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:46:39] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:46:39] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:46:39] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 7/462 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:46:41] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:46:41] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:46:44] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 2 ms to minimize.
[2024-05-30 13:46:44] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:46:44] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 2 ms to minimize.
[2024-05-30 13:46:44] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:46:45] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:46:45] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:46:45] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 7/471 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:46:48] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:46:50] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 2 ms to minimize.
[2024-05-30 13:46:50] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:46:51] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:46:52] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 4/476 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:46:53] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:46:53] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:46:53] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:46:53] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:46:53] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/396 variables, 5/481 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:46:56] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:46:56] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:46:58] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/396 variables, 3/484 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 396/396 variables, and 484 constraints, problems are : Problem set: 0 solved, 197 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 68/68 constraints]
After SMT, in 36499ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 36501ms
Starting structural reductions in LTL mode, iteration 1 : 198/210 places, 198/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36672 ms. Remains : 198/210 places, 198/210 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-15
Stuttering criterion allowed to conclude after 9984 steps with 0 reset in 19 ms.
FORMULA ShieldRVt-PT-005B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLFireability-15 finished in 36815 ms.
All properties solved by simple procedures.
Total runtime 443868 ms.

BK_STOP 1717076821189

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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