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.r528-tall-171683762100923.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 ltsminxred
Input is ShieldRVt-PT-003B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683762100923
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K 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 Apr 23 07:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 21:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 11 21:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 11 21:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 11 21:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 36K 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-003B-LTLCardinality-00
FORMULA_NAME ShieldRVt-PT-003B-LTLCardinality-01
FORMULA_NAME ShieldRVt-PT-003B-LTLCardinality-02
FORMULA_NAME ShieldRVt-PT-003B-LTLCardinality-03
FORMULA_NAME ShieldRVt-PT-003B-LTLCardinality-04
FORMULA_NAME ShieldRVt-PT-003B-LTLCardinality-05
FORMULA_NAME ShieldRVt-PT-003B-LTLCardinality-06
FORMULA_NAME ShieldRVt-PT-003B-LTLCardinality-07
FORMULA_NAME ShieldRVt-PT-003B-LTLCardinality-08
FORMULA_NAME ShieldRVt-PT-003B-LTLCardinality-09
FORMULA_NAME ShieldRVt-PT-003B-LTLCardinality-10
FORMULA_NAME ShieldRVt-PT-003B-LTLCardinality-11
FORMULA_NAME ShieldRVt-PT-003B-LTLCardinality-12
FORMULA_NAME ShieldRVt-PT-003B-LTLCardinality-13
FORMULA_NAME ShieldRVt-PT-003B-LTLCardinality-14
FORMULA_NAME ShieldRVt-PT-003B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717275058136

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-003B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:50:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 20:50:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:50:59] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2024-06-01 20:50:59] [INFO ] Transformed 153 places.
[2024-06-01 20:50:59] [INFO ] Transformed 153 transitions.
[2024-06-01 20:50:59] [INFO ] Found NUPN structural information;
[2024-06-01 20:50:59] [INFO ] Parsed PT model containing 153 places and 153 transitions and 360 arcs in 156 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA ShieldRVt-PT-003B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-003B-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-003B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-003B-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-003B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-003B-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-003B-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-003B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 153/153 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 129 transition count 129
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 129 transition count 129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 128 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 128 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 127 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 127 transition count 127
Applied a total of 52 rules in 42 ms. Remains 127 /153 variables (removed 26) and now considering 127/153 (removed 26) transitions.
// Phase 1: matrix 127 rows 127 cols
[2024-06-01 20:50:59] [INFO ] Computed 13 invariants in 14 ms
[2024-06-01 20:50:59] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-06-01 20:50:59] [INFO ] Invariant cache hit.
[2024-06-01 20:50:59] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2024-06-01 20:50:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-06-01 20:51:00] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 8 ms to minimize.
[2024-06-01 20:51:00] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 3 ms to minimize.
[2024-06-01 20:51:00] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-06-01 20:51:00] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-06-01 20:51:01] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-06-01 20:51:01] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-06-01 20:51:01] [INFO ] Deduced a trap composed of 23 places in 20 ms of which 1 ms to minimize.
[2024-06-01 20:51:01] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 127/254 variables, 127/148 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 0/254 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 148 constraints, problems are : Problem set: 0 solved, 126 unsolved in 3297 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 127/254 variables, 127/148 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 126/274 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-06-01 20:51:04] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-06-01 20:51:04] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-06-01 20:51:04] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 2 ms to minimize.
[2024-06-01 20:51:04] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-06-01 20:51:04] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-06-01 20:51:04] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-06-01 20:51:04] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:51:04] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-06-01 20:51:04] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-01 20:51:04] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-01 20:51:05] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-06-01 20:51:05] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 20:51:05] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-06-01 20:51:05] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-06-01 20:51:05] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 20:51:05] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 16/290 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-06-01 20:51:07] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/254 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-06-01 20:51:08] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-06-01 20:51:09] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2024-06-01 20:51:09] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-06-01 20:51:09] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 3/295 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-06-01 20:51:10] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/254 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-06-01 20:51:11] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-06-01 20:51:11] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-06-01 20:51:11] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-06-01 20:51:11] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
[2024-06-01 20:51:11] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/254 variables, 5/301 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/254 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 14 (OVERLAPS) 0/254 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 301 constraints, problems are : Problem set: 0 solved, 126 unsolved in 12031 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 35/35 constraints]
After SMT, in 15378ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 15394ms
Starting structural reductions in LTL mode, iteration 1 : 127/153 places, 127/153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15776 ms. Remains : 127/153 places, 127/153 transitions.
Support contains 18 out of 127 places after structural reductions.
[2024-06-01 20:51:15] [INFO ] Flatten gal took : 28 ms
[2024-06-01 20:51:15] [INFO ] Flatten gal took : 12 ms
[2024-06-01 20:51:15] [INFO ] Input system was already deterministic with 127 transitions.
RANDOM walk for 18914 steps (7 resets) in 342 ms. (55 steps per ms) remains 0/16 properties
Computed a total of 37 stabilizing places and 37 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(p0)&&F(p1)))'
Support contains 3 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 127/127 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 120 transition count 120
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 120 transition count 120
Applied a total of 14 rules in 10 ms. Remains 120 /127 variables (removed 7) and now considering 120/127 (removed 7) transitions.
// Phase 1: matrix 120 rows 120 cols
[2024-06-01 20:51:15] [INFO ] Computed 13 invariants in 2 ms
[2024-06-01 20:51:15] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-01 20:51:15] [INFO ] Invariant cache hit.
[2024-06-01 20:51:16] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2024-06-01 20:51:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 20:51:16] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-06-01 20:51:16] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-06-01 20:51:16] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/240 variables, 120/136 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 0/240 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 136 constraints, problems are : Problem set: 0 solved, 119 unsolved in 2579 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/240 variables, 120/136 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 119/255 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 20:51:19] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-06-01 20:51:19] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-01 20:51:19] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-06-01 20:51:19] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-06-01 20:51:19] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-06-01 20:51:19] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-06-01 20:51:19] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-06-01 20:51:20] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:51:20] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-06-01 20:51:20] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-06-01 20:51:20] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 20:51:20] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-06-01 20:51:20] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 13/268 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 20:51:20] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 20:51:21] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 2 ms to minimize.
[2024-06-01 20:51:21] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:51:21] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-01 20:51:21] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-06-01 20:51:21] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-06-01 20:51:21] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 20:51:21] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-01 20:51:21] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-06-01 20:51:21] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-06-01 20:51:21] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 20:51:21] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-06-01 20:51:21] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-01 20:51:21] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 14/282 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 20:51:22] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (OVERLAPS) 0/240 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 283 constraints, problems are : Problem set: 0 solved, 119 unsolved in 7249 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 31/31 constraints]
After SMT, in 9846ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 9848ms
Starting structural reductions in LTL mode, iteration 1 : 120/127 places, 120/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9984 ms. Remains : 120/127 places, 120/127 transitions.
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : ShieldRVt-PT-003B-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA ShieldRVt-PT-003B-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLCardinality-02 finished in 10303 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 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 127/127 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 126 transition count 92
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 92 transition count 92
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 68 place count 92 transition count 72
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 108 place count 72 transition count 72
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 115 place count 65 transition count 65
Iterating global reduction 2 with 7 rules applied. Total rules applied 122 place count 65 transition count 65
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 122 place count 65 transition count 60
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 132 place count 60 transition count 60
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 174 place count 39 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 175 place count 39 transition count 38
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 177 place count 38 transition count 37
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 193 place count 30 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 194 place count 29 transition count 43
Applied a total of 194 rules in 32 ms. Remains 29 /127 variables (removed 98) and now considering 43/127 (removed 84) transitions.
// Phase 1: matrix 43 rows 29 cols
[2024-06-01 20:51:26] [INFO ] Computed 13 invariants in 0 ms
[2024-06-01 20:51:26] [INFO ] Implicit Places using invariants in 84 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 86 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/127 places, 43/127 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 43/43 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 120 ms. Remains : 28/127 places, 43/127 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-003B-LTLCardinality-03
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-003B-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLCardinality-03 finished in 169 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(F(p0))||(X(p1) U ((X(p1)&&(p1 U (p2||G(p1))))||X(G(p1))))))))'
Support contains 3 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 127/127 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 120 transition count 120
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 120 transition count 120
Applied a total of 14 rules in 8 ms. Remains 120 /127 variables (removed 7) and now considering 120/127 (removed 7) transitions.
// Phase 1: matrix 120 rows 120 cols
[2024-06-01 20:51:26] [INFO ] Computed 13 invariants in 1 ms
[2024-06-01 20:51:26] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-01 20:51:26] [INFO ] Invariant cache hit.
[2024-06-01 20:51:26] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2024-06-01 20:51:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 20:51:27] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 6 ms to minimize.
[2024-06-01 20:51:27] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-06-01 20:51:27] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-06-01 20:51:27] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-06-01 20:51:27] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/240 variables, 120/138 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 0/240 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 138 constraints, problems are : Problem set: 0 solved, 119 unsolved in 2644 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/240 variables, 120/138 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 119/257 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 20:51:29] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-06-01 20:51:29] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
[2024-06-01 20:51:30] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 20:51:30] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 0 ms to minimize.
[2024-06-01 20:51:30] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2024-06-01 20:51:30] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 20:51:30] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-06-01 20:51:30] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-06-01 20:51:30] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 20:51:30] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-06-01 20:51:30] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-06-01 20:51:30] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-01 20:51:30] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2024-06-01 20:51:30] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 14/271 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 20:51:31] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:51:31] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 20:51:32] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-01 20:51:32] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 20:51:33] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 20:51:34] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-06-01 20:51:34] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-06-01 20:51:34] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 3/279 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 20:51:35] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 20:51:35] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-06-01 20:51:35] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 20:51:35] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-06-01 20:51:35] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 5/284 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 20:51:36] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 20:51:38] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-06-01 20:51:38] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/240 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 15 (OVERLAPS) 0/240 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 287 constraints, problems are : Problem set: 0 solved, 119 unsolved in 11688 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 35/35 constraints]
After SMT, in 14346ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 14348ms
Starting structural reductions in LTL mode, iteration 1 : 120/127 places, 120/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14488 ms. Remains : 120/127 places, 120/127 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-003B-LTLCardinality-05
Product exploration explored 100000 steps with 33305 reset in 260 ms.
Product exploration explored 100000 steps with 33408 reset in 131 ms.
Computed a total of 35 stabilizing places and 35 stable transitions
Computed a total of 35 stabilizing places and 35 stable transitions
Detected a total of 35/120 stabilizing places and 35/120 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 176 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (11 resets) in 222 ms. (179 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
[2024-06-01 20:51:41] [INFO ] Invariant cache hit.
Problem apf6 is UNSAT
After SMT solving in domain Real declared 3/240 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 15 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, State Equation: 0/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 17ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 (NOT p2) p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (F (NOT (OR p0 p2 p1)))]
Knowledge based reduction with 17 factoid took 422 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 120/120 transitions.
Applied a total of 0 rules in 7 ms. Remains 120 /120 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-06-01 20:51:42] [INFO ] Invariant cache hit.
[2024-06-01 20:51:42] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-01 20:51:42] [INFO ] Invariant cache hit.
[2024-06-01 20:51:42] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2024-06-01 20:51:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 20:51:43] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-06-01 20:51:43] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-06-01 20:51:43] [INFO ] Deduced a trap composed of 19 places in 16 ms of which 1 ms to minimize.
[2024-06-01 20:51:43] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 20:51:43] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/240 variables, 120/138 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 0/240 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 138 constraints, problems are : Problem set: 0 solved, 119 unsolved in 2765 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/240 variables, 120/138 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 119/257 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 20:51:46] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-06-01 20:51:46] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-06-01 20:51:46] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-06-01 20:51:46] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-06-01 20:51:46] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:51:46] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-06-01 20:51:46] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 20:51:46] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:51:46] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 20:51:46] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-06-01 20:51:46] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-06-01 20:51:47] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-06-01 20:51:47] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 20:51:47] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 14/271 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 20:51:47] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 20:51:47] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 20:51:49] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2024-06-01 20:51:49] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 20:51:50] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 20:51:50] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-06-01 20:51:50] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-06-01 20:51:51] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 3/279 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 20:51:52] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:51:52] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-06-01 20:51:52] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-01 20:51:52] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-06-01 20:51:52] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 5/284 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 20:51:53] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 20:51:54] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-06-01 20:51:54] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/240 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 15 (OVERLAPS) 0/240 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 287 constraints, problems are : Problem set: 0 solved, 119 unsolved in 11536 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 35/35 constraints]
After SMT, in 14314ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 14315ms
Finished structural reductions in LTL mode , in 1 iterations and 14431 ms. Remains : 120/120 places, 120/120 transitions.
Computed a total of 35 stabilizing places and 35 stable transitions
Computed a total of 35 stabilizing places and 35 stable transitions
Detected a total of 35/120 stabilizing places and 35/120 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 191 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1119 steps (0 resets) in 12 ms. (86 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT p1)), (F (NOT p2)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 14 factoid took 486 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 33359 reset in 74 ms.
Product exploration explored 100000 steps with 33307 reset in 121 ms.
Support contains 3 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 120/120 transitions.
Applied a total of 0 rules in 2 ms. Remains 120 /120 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-06-01 20:51:58] [INFO ] Invariant cache hit.
[2024-06-01 20:51:58] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-01 20:51:58] [INFO ] Invariant cache hit.
[2024-06-01 20:51:59] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2024-06-01 20:51:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 20:51:59] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-06-01 20:51:59] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-06-01 20:51:59] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 1 ms to minimize.
[2024-06-01 20:51:59] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-06-01 20:51:59] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/240 variables, 120/138 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 0/240 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 138 constraints, problems are : Problem set: 0 solved, 119 unsolved in 2566 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/240 variables, 120/138 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 119/257 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 20:52:02] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-06-01 20:52:02] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 2 ms to minimize.
[2024-06-01 20:52:02] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 20:52:02] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-06-01 20:52:02] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
[2024-06-01 20:52:02] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-06-01 20:52:02] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-06-01 20:52:02] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-06-01 20:52:02] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-06-01 20:52:02] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-06-01 20:52:02] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-06-01 20:52:03] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-06-01 20:52:03] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 20:52:03] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 14/271 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 20:52:03] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 20:52:03] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 20:52:05] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-01 20:52:05] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 20:52:06] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 20:52:06] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-01 20:52:06] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:52:06] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 3/279 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 20:52:08] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 5 ms to minimize.
[2024-06-01 20:52:08] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-06-01 20:52:08] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-01 20:52:08] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-06-01 20:52:08] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 5/284 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 20:52:09] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 20:52:10] [INFO ] Deduced a trap composed of 40 places in 30 ms of which 1 ms to minimize.
[2024-06-01 20:52:10] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/240 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 15 (OVERLAPS) 0/240 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 287 constraints, problems are : Problem set: 0 solved, 119 unsolved in 11468 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 35/35 constraints]
After SMT, in 14047ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 14050ms
Finished structural reductions in LTL mode , in 1 iterations and 14182 ms. Remains : 120/120 places, 120/120 transitions.
Treatment of property ShieldRVt-PT-003B-LTLCardinality-05 finished in 46754 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 127/127 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 119 transition count 119
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 119 transition count 119
Applied a total of 16 rules in 2 ms. Remains 119 /127 variables (removed 8) and now considering 119/127 (removed 8) transitions.
// Phase 1: matrix 119 rows 119 cols
[2024-06-01 20:52:13] [INFO ] Computed 13 invariants in 1 ms
[2024-06-01 20:52:13] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 20:52:13] [INFO ] Invariant cache hit.
[2024-06-01 20:52:13] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Running 118 sub problems to find dead transitions.
[2024-06-01 20:52:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 20:52:13] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-01 20:52:13] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 0 ms to minimize.
[2024-06-01 20:52:13] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-06-01 20:52:14] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/238 variables, 119/136 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (OVERLAPS) 0/238 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 136 constraints, problems are : Problem set: 0 solved, 118 unsolved in 2577 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/238 variables, 119/136 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 118/254 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 20:52:16] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 20:52:16] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-01 20:52:16] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-06-01 20:52:16] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-06-01 20:52:16] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-01 20:52:16] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 2 ms to minimize.
[2024-06-01 20:52:16] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-06-01 20:52:16] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-06-01 20:52:17] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 20:52:17] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-01 20:52:17] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 20:52:17] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-06-01 20:52:17] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 13/267 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 20:52:17] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-06-01 20:52:17] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-06-01 20:52:18] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 20:52:18] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-06-01 20:52:18] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-06-01 20:52:18] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-06-01 20:52:18] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-01 20:52:18] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 8/275 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 20:52:19] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-06-01 20:52:19] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 20:52:19] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-06-01 20:52:19] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 4/279 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 10 (OVERLAPS) 0/238 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 279 constraints, problems are : Problem set: 0 solved, 118 unsolved in 6415 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 29/29 constraints]
After SMT, in 9008ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 9009ms
Starting structural reductions in LTL mode, iteration 1 : 119/127 places, 119/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9109 ms. Remains : 119/127 places, 119/127 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-003B-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 404 steps with 0 reset in 2 ms.
FORMULA ShieldRVt-PT-003B-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLCardinality-07 finished in 9250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(p1))))'
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 127/127 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 118 transition count 118
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 118 transition count 118
Applied a total of 18 rules in 2 ms. Remains 118 /127 variables (removed 9) and now considering 118/127 (removed 9) transitions.
// Phase 1: matrix 118 rows 118 cols
[2024-06-01 20:52:22] [INFO ] Computed 13 invariants in 1 ms
[2024-06-01 20:52:22] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 20:52:22] [INFO ] Invariant cache hit.
[2024-06-01 20:52:22] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2024-06-01 20:52:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-06-01 20:52:23] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-06-01 20:52:23] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 20:52:23] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/236 variables, 118/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (OVERLAPS) 0/236 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 134 constraints, problems are : Problem set: 0 solved, 117 unsolved in 2504 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/236 variables, 118/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 117/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-06-01 20:52:25] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-01 20:52:25] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 20:52:25] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-06-01 20:52:25] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-01 20:52:25] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-06-01 20:52:25] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-06-01 20:52:26] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-01 20:52:26] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 20:52:26] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 20:52:26] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 10/261 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-06-01 20:52:26] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-06-01 20:52:26] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-01 20:52:26] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:52:26] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-06-01 20:52:27] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-06-01 20:52:27] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-06-01 20:52:27] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-01 20:52:27] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 8/269 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-06-01 20:52:28] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (OVERLAPS) 0/236 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 270 constraints, problems are : Problem set: 0 solved, 117 unsolved in 5592 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 22/22 constraints]
After SMT, in 8106ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 8108ms
Starting structural reductions in LTL mode, iteration 1 : 118/127 places, 118/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8215 ms. Remains : 118/127 places, 118/127 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-003B-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 33 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-003B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLCardinality-08 finished in 8403 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))||G(p1))))'
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 127/127 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 118 transition count 118
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 118 transition count 118
Applied a total of 18 rules in 2 ms. Remains 118 /127 variables (removed 9) and now considering 118/127 (removed 9) transitions.
[2024-06-01 20:52:30] [INFO ] Invariant cache hit.
[2024-06-01 20:52:30] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-01 20:52:30] [INFO ] Invariant cache hit.
[2024-06-01 20:52:30] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2024-06-01 20:52:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-06-01 20:52:31] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-06-01 20:52:31] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-06-01 20:52:31] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/236 variables, 118/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (OVERLAPS) 0/236 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 134 constraints, problems are : Problem set: 0 solved, 117 unsolved in 2483 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/236 variables, 118/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 117/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-06-01 20:52:34] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-06-01 20:52:34] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 20:52:34] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-06-01 20:52:34] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-01 20:52:34] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-06-01 20:52:34] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-06-01 20:52:34] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 4 ms to minimize.
[2024-06-01 20:52:34] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 20:52:34] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 20:52:34] [INFO ] Deduced a trap composed of 23 places in 20 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 10/261 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-06-01 20:52:35] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-06-01 20:52:35] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-01 20:52:35] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-01 20:52:35] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2024-06-01 20:52:35] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2024-06-01 20:52:35] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-06-01 20:52:35] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-06-01 20:52:35] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 8/269 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-06-01 20:52:36] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (OVERLAPS) 0/236 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 270 constraints, problems are : Problem set: 0 solved, 117 unsolved in 5827 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 22/22 constraints]
After SMT, in 8328ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 8329ms
Starting structural reductions in LTL mode, iteration 1 : 118/127 places, 118/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8434 ms. Remains : 118/127 places, 118/127 transitions.
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-003B-LTLCardinality-13
Stuttering criterion allowed to conclude after 7500 steps with 0 reset in 12 ms.
FORMULA ShieldRVt-PT-003B-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLCardinality-13 finished in 8592 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||G(p2))))'
Support contains 6 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 127/127 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 121 transition count 121
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 121 transition count 121
Applied a total of 12 rules in 2 ms. Remains 121 /127 variables (removed 6) and now considering 121/127 (removed 6) transitions.
// Phase 1: matrix 121 rows 121 cols
[2024-06-01 20:52:39] [INFO ] Computed 13 invariants in 1 ms
[2024-06-01 20:52:39] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-01 20:52:39] [INFO ] Invariant cache hit.
[2024-06-01 20:52:39] [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.
Running 120 sub problems to find dead transitions.
[2024-06-01 20:52:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 20:52:40] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2024-06-01 20:52:40] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-06-01 20:52:40] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-06-01 20:52:40] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/242 variables, 121/138 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 0/242 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 138 constraints, problems are : Problem set: 0 solved, 120 unsolved in 2665 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/242 variables, 121/138 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 120/258 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 20:52:42] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 2 ms to minimize.
[2024-06-01 20:52:42] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 20:52:42] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-06-01 20:52:43] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-01 20:52:43] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-06-01 20:52:43] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 20:52:43] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:52:43] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 4 ms to minimize.
[2024-06-01 20:52:43] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 2 ms to minimize.
[2024-06-01 20:52:43] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-06-01 20:52:43] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-06-01 20:52:43] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-06-01 20:52:43] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-06-01 20:52:43] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-06-01 20:52:43] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-06-01 20:52:43] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-06-01 20:52:43] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-06-01 20:52:43] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-06-01 20:52:43] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2024-06-01 20:52:44] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 20/278 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 20:52:44] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 20:52:45] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/242 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 280 constraints, problems are : Problem set: 0 solved, 120 unsolved in 6390 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 26/26 constraints]
After SMT, in 9064ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 9066ms
Starting structural reductions in LTL mode, iteration 1 : 121/127 places, 121/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9178 ms. Remains : 121/127 places, 121/127 transitions.
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-003B-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 95 ms.
Product exploration explored 100000 steps with 50000 reset in 130 ms.
Computed a total of 35 stabilizing places and 35 stable transitions
Computed a total of 35 stabilizing places and 35 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 17 factoid took 14 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-003B-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-003B-LTLCardinality-14 finished in 9600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(F(p1)))))'
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 127/127 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 119 transition count 119
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 119 transition count 119
Applied a total of 16 rules in 3 ms. Remains 119 /127 variables (removed 8) and now considering 119/127 (removed 8) transitions.
// Phase 1: matrix 119 rows 119 cols
[2024-06-01 20:52:48] [INFO ] Computed 13 invariants in 1 ms
[2024-06-01 20:52:49] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 20:52:49] [INFO ] Invariant cache hit.
[2024-06-01 20:52:49] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 118 sub problems to find dead transitions.
[2024-06-01 20:52:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 20:52:49] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-06-01 20:52:49] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-06-01 20:52:49] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-06-01 20:52:49] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-06-01 20:52:49] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/238 variables, 119/137 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (OVERLAPS) 0/238 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 137 constraints, problems are : Problem set: 0 solved, 118 unsolved in 2593 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/238 variables, 119/137 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 118/255 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 20:52:52] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-06-01 20:52:52] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 20:52:52] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 2 ms to minimize.
[2024-06-01 20:52:52] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 20:52:52] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-01 20:52:52] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-06-01 20:52:52] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 20:52:52] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-06-01 20:52:52] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 20:52:52] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
[2024-06-01 20:52:53] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-06-01 20:52:53] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-06-01 20:52:53] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 20:52:53] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 14/269 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 20:52:53] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:52:53] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-01 20:52:54] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2024-06-01 20:52:54] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-01 20:52:54] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-06-01 20:52:54] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:52:54] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 7/276 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 20:52:55] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 0 ms to minimize.
[2024-06-01 20:52:56] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 20:52:56] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-01 20:52:56] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/238 variables, 4/280 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 20:52:57] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 12 (OVERLAPS) 0/238 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 281 constraints, problems are : Problem set: 0 solved, 118 unsolved in 8988 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 31/31 constraints]
After SMT, in 11595ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 11596ms
Starting structural reductions in LTL mode, iteration 1 : 119/127 places, 119/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11717 ms. Remains : 119/127 places, 119/127 transitions.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-003B-LTLCardinality-15
Stuttering criterion allowed to conclude after 5704 steps with 87 reset in 10 ms.
FORMULA ShieldRVt-PT-003B-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLCardinality-15 finished in 11897 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(F(p0))||(X(p1) U ((X(p1)&&(p1 U (p2||G(p1))))||X(G(p1))))))))'
Found a Shortening insensitive property : ShieldRVt-PT-003B-LTLCardinality-05
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 3 out of 127 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 127/127 places, 127/127 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 126 transition count 93
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 93 transition count 93
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 66 place count 93 transition count 75
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 102 place count 75 transition count 75
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 107 place count 70 transition count 70
Iterating global reduction 2 with 5 rules applied. Total rules applied 112 place count 70 transition count 70
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 112 place count 70 transition count 66
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 120 place count 66 transition count 66
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 172 place count 40 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 173 place count 40 transition count 39
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 175 place count 39 transition count 38
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -5
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 189 place count 32 transition count 43
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 191 place count 30 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 192 place count 29 transition count 41
Applied a total of 192 rules in 14 ms. Remains 29 /127 variables (removed 98) and now considering 41/127 (removed 86) transitions.
// Phase 1: matrix 41 rows 29 cols
[2024-06-01 20:53:01] [INFO ] Computed 12 invariants in 0 ms
[2024-06-01 20:53:01] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 20:53:01] [INFO ] Invariant cache hit.
[2024-06-01 20:53:01] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 20:53:01] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Running 36 sub problems to find dead transitions.
[2024-06-01 20:53:01] [INFO ] Invariant cache hit.
[2024-06-01 20:53:01] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 40/69 variables, 29/41 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 0/69 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/70 variables, and 45 constraints, problems are : Problem set: 0 solved, 36 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 29/29 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 40/69 variables, 29/41 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 36/81 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 0/69 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/70 variables, and 81 constraints, problems are : Problem set: 0 solved, 36 unsolved in 330 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 29/29 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 653ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 653ms
Starting structural reductions in LI_LTL mode, iteration 1 : 29/127 places, 41/127 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 733 ms. Remains : 29/127 places, 41/127 transitions.
Running random walk in product with property : ShieldRVt-PT-003B-LTLCardinality-05
Stuttering criterion allowed to conclude after 1129 steps with 303 reset in 8 ms.
Treatment of property ShieldRVt-PT-003B-LTLCardinality-05 finished in 1020 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-06-01 20:53:01] [INFO ] Flatten gal took : 7 ms
[2024-06-01 20:53:01] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 20:53:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 127 places, 127 transitions and 308 arcs took 11 ms.
Total runtime 122706 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ShieldRVt-PT-003B-LTLCardinality-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717275182151

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name ShieldRVt-PT-003B-LTLCardinality-05
ltl formula formula --ltl=/tmp/1904/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 127 places, 127 transitions and 308 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1904/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1904/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1904/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1904/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 128 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 128, there are 152 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~127!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 349
pnml2lts-mc( 0/ 4): unique states count: 684
pnml2lts-mc( 0/ 4): unique transitions count: 2529
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 13
pnml2lts-mc( 0/ 4): - claim found count: 11
pnml2lts-mc( 0/ 4): - claim success count: 694
pnml2lts-mc( 0/ 4): - cum. max stack depth: 341
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 694 states 2561 transitions, fanout: 3.690
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.000 sec minimum, 0.007 sec on average)
pnml2lts-mc( 0/ 4): States per second: 69400, Transitions per second: 256100
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 13.9 B/state, compr.: 2.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 127 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

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-003B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldRVt-PT-003B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r528-tall-171683762100923"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-003B.tgz
mv ShieldRVt-PT-003B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;