Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r212-tall-174901993800188.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is ShieldRVt-PT-001B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-tall-174901993800188
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 167K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 13K May 29 14:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749095057740

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-001B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-05 03:44:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 03:44:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 03:44:19] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2025-06-05 03:44:19] [INFO ] Transformed 53 places.
[2025-06-05 03:44:19] [INFO ] Transformed 53 transitions.
[2025-06-05 03:44:19] [INFO ] Found NUPN structural information;
[2025-06-05 03:44:19] [INFO ] Parsed PT model containing 53 places and 53 transitions and 124 arcs in 120 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVt-PT-001B-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Applied a total of 0 rules in 17 ms. Remains 53 /53 variables (removed 0) and now considering 53/53 (removed 0) transitions.
// Phase 1: matrix 53 rows 53 cols
[2025-06-05 03:44:19] [INFO ] Computed 5 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:44:19] [INFO ] Implicit Places using invariants in 151 ms returned []
[2025-06-05 03:44:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:44:19] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2025-06-05 03:44:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:20] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:20] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:20] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:20] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:20] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:20] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:20] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:20] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:20] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:20] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 53/106 variables, 53/121 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:20] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:20] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (OVERLAPS) 0/106 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 123 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1971 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 12/70 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:21] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 53/106 variables, 53/124 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 52/176 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:22] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:22] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:22] [INFO ] Deduced a trap along path composed of 7 places in 44 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/106 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 13 (OVERLAPS) 0/106 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 179 constraints, problems are : Problem set: 0 solved, 52 unsolved in 2966 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 4963ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 4978ms
Finished structural reductions in LTL mode , in 1 iterations and 5273 ms. Remains : 53/53 places, 53/53 transitions.
Support contains 34 out of 53 places after structural reductions.
[2025-06-05 03:44:24] [INFO ] Flatten gal took : 18 ms
[2025-06-05 03:44:24] [INFO ] Flatten gal took : 6 ms
[2025-06-05 03:44:24] [INFO ] Input system was already deterministic with 53 transitions.
Support contains 33 out of 53 places (down from 34) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 32 to 28
RANDOM walk for 11192 steps (16 resets) in 148 ms. (75 steps per ms) remains 0/28 properties
Computed a total of 16 stabilizing places and 16 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&F(p1)&&X(X(p2)))))'
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 43 transition count 43
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 43 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 42 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 41 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 41 transition count 41
Applied a total of 24 rules in 8 ms. Remains 41 /53 variables (removed 12) and now considering 41/53 (removed 12) transitions.
// Phase 1: matrix 41 rows 41 cols
[2025-06-05 03:44:25] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:44:25] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-05 03:44:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:44:25] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2025-06-05 03:44:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:25] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:25] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 41/82 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/82 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/82 variables, and 48 constraints, problems are : Problem set: 0 solved, 40 unsolved in 740 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 41/41 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 41/82 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 40/88 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:26] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:26] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:26] [INFO ] Deduced a trap along path composed of 7 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:26] [INFO ] Deduced a trap along path composed of 6 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/82 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/82 variables, and 92 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1084 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 41/41 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 1831ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1831ms
Starting structural reductions in LTL mode, iteration 1 : 41/53 places, 41/53 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1913 ms. Remains : 41/53 places, 41/53 transitions.
Stuttering acceptance computed with spot in 408 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-001B-LTLFireability-00
Stuttering criterion allowed to conclude after 915 steps with 3 reset in 9 ms.
FORMULA ShieldRVt-PT-001B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-001B-LTLFireability-00 finished in 2395 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&F(!p0))) U !p0))'
Support contains 1 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 52 transition count 36
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 34 place count 36 transition count 34
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 37 place count 35 transition count 32
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 39 place count 33 transition count 32
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 39 place count 33 transition count 29
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 45 place count 30 transition count 29
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 52 place count 23 transition count 22
Iterating global reduction 4 with 7 rules applied. Total rules applied 59 place count 23 transition count 22
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 59 place count 23 transition count 19
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 65 place count 20 transition count 19
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 77 place count 14 transition count 13
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 81 place count 12 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 82 place count 11 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 83 place count 10 transition count 13
Applied a total of 83 rules in 19 ms. Remains 10 /53 variables (removed 43) and now considering 13/53 (removed 40) transitions.
// Phase 1: matrix 13 rows 10 cols
[2025-06-05 03:44:27] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:44:27] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-06-05 03:44:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:44:27] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 03:44:27] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2025-06-05 03:44:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 12/22 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 0/22 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 78 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 12/22 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/22 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 152ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 152ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/53 places, 13/53 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 218 ms. Remains : 10/53 places, 13/53 transitions.
Stuttering acceptance computed with spot in 35 ms :[p0]
Running random walk in product with property : ShieldRVt-PT-001B-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-001B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-001B-LTLFireability-01 finished in 265 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 52 transition count 35
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 36 place count 35 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 34 transition count 33
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 37 place count 34 transition count 29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 45 place count 30 transition count 29
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 52 place count 23 transition count 22
Iterating global reduction 3 with 7 rules applied. Total rules applied 59 place count 23 transition count 22
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 59 place count 23 transition count 19
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 65 place count 20 transition count 19
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 79 place count 13 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 83 place count 11 transition count 13
Applied a total of 83 rules in 11 ms. Remains 11 /53 variables (removed 42) and now considering 13/53 (removed 40) transitions.
// Phase 1: matrix 13 rows 11 cols
[2025-06-05 03:44:27] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:44:27] [INFO ] Implicit Places using invariants in 23 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/53 places, 13/53 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 38 ms. Remains : 10/53 places, 13/53 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-001B-LTLFireability-02
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-001B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-001B-LTLFireability-02 finished in 113 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(X((X(p0)||p1)))) U p2)&&G(F(X(p1)))))'
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 43 transition count 43
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 43 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 42 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 42 transition count 42
Applied a total of 22 rules in 6 ms. Remains 42 /53 variables (removed 11) and now considering 42/53 (removed 11) transitions.
// Phase 1: matrix 42 rows 42 cols
[2025-06-05 03:44:28] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:44:28] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-05 03:44:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:44:28] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Running 41 sub problems to find dead transitions.
[2025-06-05 03:44:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:28] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:28] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 42/84 variables, 42/49 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 0/84 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/84 variables, and 49 constraints, problems are : Problem set: 0 solved, 41 unsolved in 696 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 42/84 variables, 42/49 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 41/90 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:29] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:29] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:29] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:29] [INFO ] Deduced a trap along path composed of 8 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:29] [INFO ] Deduced a trap along path composed of 7 places in 16 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:29] [INFO ] Deduced a trap along path composed of 7 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:29] [INFO ] Deduced a trap along path composed of 7 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/84 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:30] [INFO ] Deduced a trap along path composed of 7 places in 24 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/84 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/84 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 12 (OVERLAPS) 0/84 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/84 variables, and 98 constraints, problems are : Problem set: 0 solved, 41 unsolved in 2408 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 3109ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 3110ms
Starting structural reductions in LTL mode, iteration 1 : 42/53 places, 42/53 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3187 ms. Remains : 42/53 places, 42/53 transitions.
Stuttering acceptance computed with spot in 324 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), true]
Running random walk in product with property : ShieldRVt-PT-001B-LTLFireability-04
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-001B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-001B-LTLFireability-04 finished in 3536 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(((!p0 U p1)||X(p2))) U G(p3)))))'
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 43 transition count 43
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 43 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 42 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 41 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 41 transition count 41
Applied a total of 24 rules in 9 ms. Remains 41 /53 variables (removed 12) and now considering 41/53 (removed 12) transitions.
// Phase 1: matrix 41 rows 41 cols
[2025-06-05 03:44:31] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:44:31] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-05 03:44:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:44:31] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2025-06-05 03:44:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:31] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:31] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 41/82 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/82 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/82 variables, and 48 constraints, problems are : Problem set: 0 solved, 40 unsolved in 729 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 41/41 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 41/82 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 40/88 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:32] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:32] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:32] [INFO ] Deduced a trap along path composed of 7 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:32] [INFO ] Deduced a trap along path composed of 6 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/82 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/82 variables, and 92 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1124 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 41/41 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 1858ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1859ms
Starting structural reductions in LTL mode, iteration 1 : 41/53 places, 41/53 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1935 ms. Remains : 41/53 places, 41/53 transitions.
Stuttering acceptance computed with spot in 522 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p2), (AND (NOT p1) (NOT p2) p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), true, (NOT p1), (NOT p3), (AND (NOT p1) p2 (NOT p3))]
Running random walk in product with property : ShieldRVt-PT-001B-LTLFireability-05
Entered a terminal (fully accepting) state of product in 12 steps with 2 reset in 1 ms.
FORMULA ShieldRVt-PT-001B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-001B-LTLFireability-05 finished in 2484 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(!p0))) U ((X(X(X(!p0)))&&(p1||F(G(!p2))))||X(X(X(G(!p0)))))))'
Support contains 5 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 44 transition count 44
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 44 transition count 44
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 43 transition count 43
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 43 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 42 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 42 transition count 42
Applied a total of 22 rules in 3 ms. Remains 42 /53 variables (removed 11) and now considering 42/53 (removed 11) transitions.
// Phase 1: matrix 42 rows 42 cols
[2025-06-05 03:44:34] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:44:34] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-05 03:44:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:44:34] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Running 41 sub problems to find dead transitions.
[2025-06-05 03:44:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:34] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:34] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:34] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 42/84 variables, 42/50 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 0/84 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/84 variables, and 50 constraints, problems are : Problem set: 0 solved, 41 unsolved in 764 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 42/84 variables, 42/50 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 41/91 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:35] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:35] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:35] [INFO ] Deduced a trap along path composed of 8 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:35] [INFO ] Deduced a trap along path composed of 6 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:35] [INFO ] Deduced a trap along path composed of 7 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/84 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (OVERLAPS) 0/84 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/84 variables, and 96 constraints, problems are : Problem set: 0 solved, 41 unsolved in 1747 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 2515ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 2515ms
Starting structural reductions in LTL mode, iteration 1 : 42/53 places, 42/53 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2589 ms. Remains : 42/53 places, 42/53 transitions.
Stuttering acceptance computed with spot in 335 ms :[p0, p0, p0, (AND p0 p2), p0, (AND p0 p2), (AND p0 p2), true, (AND p0 p2), p2]
Running random walk in product with property : ShieldRVt-PT-001B-LTLFireability-06
Product exploration explored 100000 steps with 25000 reset in 166 ms.
Product exploration explored 100000 steps with 25000 reset in 103 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Detected a total of 10/42 stabilizing places and 10/42 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 167 ms. Reduced automaton from 10 states, 16 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[p0, p0, p0, p0, true]
RANDOM walk for 258 steps (0 resets) in 7 ms. (32 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 16 factoid took 195 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 161 ms :[p0, p0, p0, p0, true]
Support contains 1 out of 42 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 42 /42 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2025-06-05 03:44:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:44:38] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-05 03:44:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:44:38] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Running 41 sub problems to find dead transitions.
[2025-06-05 03:44:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:38] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:38] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:38] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 42/84 variables, 42/50 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 0/84 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/84 variables, and 50 constraints, problems are : Problem set: 0 solved, 41 unsolved in 736 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 42/84 variables, 42/50 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 41/91 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:39] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:39] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:39] [INFO ] Deduced a trap along path composed of 8 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:39] [INFO ] Deduced a trap along path composed of 6 places in 19 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:39] [INFO ] Deduced a trap along path composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/84 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (OVERLAPS) 0/84 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/84 variables, and 96 constraints, problems are : Problem set: 0 solved, 41 unsolved in 1687 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 2433ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 2433ms
Finished structural reductions in LTL mode , in 1 iterations and 2503 ms. Remains : 42/42 places, 42/42 transitions.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 78 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[p0, p0, p0, p0, true]
RANDOM walk for 281 steps (0 resets) in 5 ms. (46 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 112 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 159 ms :[p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 163 ms :[p0, p0, p0, p0, true]
Product exploration explored 100000 steps with 25000 reset in 128 ms.
Product exploration explored 100000 steps with 25000 reset in 79 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 177 ms :[p0, p0, p0, p0, true]
Support contains 1 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 42/42 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 42 transition count 42
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 8 place count 42 transition count 48
Deduced a syphon composed of 14 places in 1 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 42 transition count 48
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 41 transition count 47
Deduced a syphon composed of 14 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 41 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 16 place count 41 transition count 48
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 41 transition count 48
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 40 transition count 46
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 40 transition count 46
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 30 place count 40 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 40 transition count 45
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 37 place count 34 transition count 39
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 43 place count 34 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 34 transition count 39
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 32 transition count 37
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 32 transition count 37
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 51 place count 32 transition count 49
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 55 place count 28 transition count 41
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 59 place count 28 transition count 41
Deduced a syphon composed of 17 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 62 place count 28 transition count 38
Deduced a syphon composed of 17 places in 0 ms
Applied a total of 62 rules in 21 ms. Remains 28 /42 variables (removed 14) and now considering 38/42 (removed 4) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 03:44:42] [INFO ] Redundant transitions in 0 ms returned []
Running 37 sub problems to find dead transitions.
// Phase 1: matrix 38 rows 28 cols
[2025-06-05 03:44:42] [INFO ] Computed 5 invariants in 1 ms
[2025-06-05 03:44:42] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:42] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:42] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:42] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:42] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:42] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 5/10 constraints. Problems are: Problem set: 25 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 25 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 37/65 variables, 28/38 constraints. Problems are: Problem set: 25 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 9/47 constraints. Problems are: Problem set: 25 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/47 constraints. Problems are: Problem set: 25 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 1/66 variables, 1/48 constraints. Problems are: Problem set: 25 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 0/48 constraints. Problems are: Problem set: 25 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/66 variables, 0/48 constraints. Problems are: Problem set: 25 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/66 variables, and 48 constraints, problems are : Problem set: 25 solved, 12 unsolved in 420 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 28/28 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 25 solved, 12 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 25 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 18/28 variables, 5/5 constraints. Problems are: Problem set: 25 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 5/10 constraints. Problems are: Problem set: 25 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 25 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 37/65 variables, 28/38 constraints. Problems are: Problem set: 25 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 9/47 constraints. Problems are: Problem set: 25 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 12/59 constraints. Problems are: Problem set: 25 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/59 constraints. Problems are: Problem set: 25 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 1/66 variables, 1/60 constraints. Problems are: Problem set: 25 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 0/60 constraints. Problems are: Problem set: 25 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/66 variables, 0/60 constraints. Problems are: Problem set: 25 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 60 constraints, problems are : Problem set: 25 solved, 12 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 28/28 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 12/37 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 736ms problems are : Problem set: 25 solved, 12 unsolved
Search for dead transitions found 25 dead transitions in 738ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 28/42 places, 13/42 transitions.
Graph (complete) has 43 edges and 28 vertex of which 11 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 11 /28 variables (removed 17) and now considering 13/13 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/42 places, 13/42 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 770 ms. Remains : 11/42 places, 13/42 transitions.
Built C files in :
/tmp/ltsmin16115566983864434424
[2025-06-05 03:44:42] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16115566983864434424
Running compilation step : cd /tmp/ltsmin16115566983864434424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 220 ms.
Running link step : cd /tmp/ltsmin16115566983864434424;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin16115566983864434424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5922431167107174371.hoa' '--buchi-type=spotba'
LTSmin run took 147 ms.
FORMULA ShieldRVt-PT-001B-LTLFireability-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-001B-LTLFireability-06 finished in 9267 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 52 transition count 38
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 38 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 37 transition count 37
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 30 place count 37 transition count 33
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 38 place count 33 transition count 33
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 44 place count 27 transition count 27
Iterating global reduction 3 with 6 rules applied. Total rules applied 50 place count 27 transition count 27
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 50 place count 27 transition count 24
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 56 place count 24 transition count 24
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
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 72 place count 16 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 76 place count 14 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 77 place count 13 transition count 16
Applied a total of 77 rules in 13 ms. Remains 13 /53 variables (removed 40) and now considering 16/53 (removed 37) transitions.
// Phase 1: matrix 16 rows 13 cols
[2025-06-05 03:44:43] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:44:43] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-05 03:44:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:44:43] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 03:44:43] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2025-06-05 03:44:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 15/28 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 0/28 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 28/29 variables, and 18 constraints, problems are : Problem set: 0 solved, 12 unsolved in 92 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 15/28 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 0/28 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 28/29 variables, and 30 constraints, problems are : Problem set: 0 solved, 12 unsolved in 103 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 198ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 199ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/53 places, 16/53 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 270 ms. Remains : 13/53 places, 16/53 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-001B-LTLFireability-07
Stuttering criterion allowed to conclude after 94 steps with 3 reset in 2 ms.
FORMULA ShieldRVt-PT-001B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-001B-LTLFireability-07 finished in 412 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F((G(p1)||G(p2)))))'
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 52 transition count 38
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 30 place count 38 transition count 36
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 33 place count 37 transition count 34
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 35 place count 35 transition count 34
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 35 place count 35 transition count 30
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 43 place count 31 transition count 30
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 47 place count 27 transition count 26
Iterating global reduction 4 with 4 rules applied. Total rules applied 51 place count 27 transition count 26
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 71 place count 17 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 73 place count 16 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 74 place count 15 transition count 15
Applied a total of 74 rules in 8 ms. Remains 15 /53 variables (removed 38) and now considering 15/53 (removed 38) transitions.
// Phase 1: matrix 15 rows 15 cols
[2025-06-05 03:44:43] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:44:43] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-05 03:44:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:44:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 03:44:43] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 03:44:43] [INFO ] Redundant transitions in 0 ms returned []
Running 13 sub problems to find dead transitions.
[2025-06-05 03:44:43] [INFO ] Invariant cache hit.
[2025-06-05 03:44:43] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/15 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 15/30 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 21 constraints, problems are : Problem set: 0 solved, 13 unsolved in 128 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/15 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 15/30 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 13/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/30 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 34 constraints, problems are : Problem set: 0 solved, 13 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 267ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 268ms
Starting structural reductions in SI_LTL mode, iteration 1 : 15/53 places, 15/53 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 333 ms. Remains : 15/53 places, 15/53 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-001B-LTLFireability-08
Product exploration explored 100000 steps with 363 reset in 167 ms.
Product exploration explored 100000 steps with 351 reset in 124 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (AND p1 p2)), (X (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Knowledge based reduction with 11 factoid took 428 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 7 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), false, false, false, false]
RANDOM walk for 40000 steps (87 resets) in 412 ms. (96 steps per ms) remains 2/11 properties
BEST_FIRST walk for 40001 steps (72 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (91 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
[2025-06-05 03:44:45] [INFO ] Invariant cache hit.
[2025-06-05 03:44:45] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 15/26 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 4/30 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/30 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/30 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 21 constraints, problems are : Problem set: 0 solved, 2 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf5 is UNSAT
Problem apf9 is UNSAT
After SMT solving in domain Int declared 11/30 variables, and 3 constraints, problems are : Problem set: 2 solved, 0 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 3/5 constraints, State Equation: 0/15 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 82ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (AND p1 p2)), (X (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (G (OR p1 p2 (NOT p0))), (G (OR p1 p2))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p1) p2))), (F (NOT p2)), (F (NOT (OR p1 (NOT p2) (NOT p0)))), (F (NOT (AND p1 p2))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 13 factoid took 872 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter insensitive) to 7 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 324 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), false, false, false, false]
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), false, false, false, false]
[2025-06-05 03:44:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 03:44:47] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-05 03:44:47] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-05 03:44:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 03:44:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-05 03:44:47] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-05 03:44:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 03:44:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-05 03:44:47] [INFO ] Computed and/alt/rep : 13/23/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-05 03:44:47] [INFO ] Added : 9 causal constraints over 2 iterations in 11 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2025-06-05 03:44:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:44:47] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-05 03:44:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:44:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 03:44:47] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 03:44:47] [INFO ] Redundant transitions in 0 ms returned []
Running 13 sub problems to find dead transitions.
[2025-06-05 03:44:47] [INFO ] Invariant cache hit.
[2025-06-05 03:44:47] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/15 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 15/30 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 21 constraints, problems are : Problem set: 0 solved, 13 unsolved in 130 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/15 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 15/30 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 13/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/30 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 34 constraints, problems are : Problem set: 0 solved, 13 unsolved in 126 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 259ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 259ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 312 ms. Remains : 15/15 places, 15/15 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p2), (X (AND p1 p2)), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT p0)), (X (NOT (AND p1 p2 p0))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2) p0))), (X p1), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 p2 p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Knowledge based reduction with 18 factoid took 479 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter insensitive) to 7 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), false, false, false, false]
RANDOM walk for 40000 steps (86 resets) in 230 ms. (173 steps per ms) remains 2/11 properties
BEST_FIRST walk for 40003 steps (55 resets) in 128 ms. (310 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (80 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
[2025-06-05 03:44:48] [INFO ] Invariant cache hit.
[2025-06-05 03:44:48] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 15/26 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 4/30 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/30 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/30 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 21 constraints, problems are : Problem set: 0 solved, 2 unsolved in 78 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf5 is UNSAT
Problem apf9 is UNSAT
After SMT solving in domain Int declared 11/30 variables, and 3 constraints, problems are : Problem set: 2 solved, 0 unsolved in 19 ms.
Refiners :[Positive P Invariants (semi-flows): 3/5 constraints, State Equation: 0/15 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 99ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p2), (X (AND p1 p2)), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT p0)), (X (NOT (AND p1 p2 p0))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2) p0))), (X p1), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X p1)), (G (OR p1 p2 (NOT p0))), (G (OR p1 p2))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 p2 p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p1) p2))), (F (NOT p2)), (F (NOT (OR p1 (NOT p2) (NOT p0)))), (F (NOT (AND p1 p2))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 20 factoid took 777 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter insensitive) to 7 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), false, false, false, false]
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), false, false, false, false]
[2025-06-05 03:44:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 03:44:49] [INFO ] [Real]Absence check using 5 positive place invariants in 0 ms returned sat
[2025-06-05 03:44:49] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-05 03:44:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 03:44:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-05 03:44:49] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-05 03:44:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 03:44:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-05 03:44:49] [INFO ] Computed and/alt/rep : 13/23/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-05 03:44:49] [INFO ] Added : 9 causal constraints over 2 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), false, false, false, false]
Product exploration explored 100000 steps with 394 reset in 111 ms.
Product exploration explored 100000 steps with 440 reset in 217 ms.
Built C files in :
/tmp/ltsmin5585407066841059726
[2025-06-05 03:44:50] [INFO ] Computing symmetric may disable matrix : 15 transitions.
[2025-06-05 03:44:50] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 03:44:50] [INFO ] Computing symmetric may enable matrix : 15 transitions.
[2025-06-05 03:44:50] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 03:44:50] [INFO ] Computing Do-Not-Accords matrix : 15 transitions.
[2025-06-05 03:44:50] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 03:44:50] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5585407066841059726
Running compilation step : cd /tmp/ltsmin5585407066841059726;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 88 ms.
Running link step : cd /tmp/ltsmin5585407066841059726;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin5585407066841059726;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14105075316213242545.hoa' '--buchi-type=spotba'
LTSmin run took 56 ms.
FORMULA ShieldRVt-PT-001B-LTLFireability-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-001B-LTLFireability-08 finished in 6967 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(p1)))'
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 44 transition count 44
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 44 transition count 44
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 43 transition count 43
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 43 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 42 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 42 transition count 42
Applied a total of 22 rules in 5 ms. Remains 42 /53 variables (removed 11) and now considering 42/53 (removed 11) transitions.
// Phase 1: matrix 42 rows 42 cols
[2025-06-05 03:44:50] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:44:50] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-05 03:44:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:44:50] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Running 41 sub problems to find dead transitions.
[2025-06-05 03:44:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:50] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 42/84 variables, 42/48 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 0/84 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/84 variables, and 48 constraints, problems are : Problem set: 0 solved, 41 unsolved in 665 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 42/84 variables, 42/48 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 41/89 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:51] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:51] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:51] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:51] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:51] [INFO ] Deduced a trap along path composed of 8 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:52] [INFO ] Deduced a trap along path composed of 7 places in 20 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (OVERLAPS) 0/84 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/84 variables, and 95 constraints, problems are : Problem set: 0 solved, 41 unsolved in 1312 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 1979ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 1979ms
Starting structural reductions in LTL mode, iteration 1 : 42/53 places, 42/53 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2045 ms. Remains : 42/53 places, 42/53 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-001B-LTLFireability-09
Entered a terminal (fully accepting) state of product in 154 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-001B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-001B-LTLFireability-09 finished in 2183 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!X((p0 U (G(p1) U !X(X(p2))))) U p2))'
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 42 transition count 42
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 41 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 41 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 40 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 40 transition count 40
Applied a total of 26 rules in 9 ms. Remains 40 /53 variables (removed 13) and now considering 40/53 (removed 13) transitions.
// Phase 1: matrix 40 rows 40 cols
[2025-06-05 03:44:52] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:44:52] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-05 03:44:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:44:53] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Running 39 sub problems to find dead transitions.
[2025-06-05 03:44:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:53] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 40/80 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 0/80 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/80 variables, and 46 constraints, problems are : Problem set: 0 solved, 39 unsolved in 609 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 40/80 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 39/85 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:53] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:53] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:53] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:54] [INFO ] Deduced a trap along path composed of 7 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:54] [INFO ] Deduced a trap along path composed of 6 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:54] [INFO ] Deduced a trap along path composed of 7 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/80 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/80 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (OVERLAPS) 0/80 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 80/80 variables, and 91 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1512 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 2126ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 2126ms
Starting structural reductions in LTL mode, iteration 1 : 40/53 places, 40/53 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2195 ms. Remains : 40/53 places, 40/53 transitions.
Stuttering acceptance computed with spot in 398 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND p1 (NOT p2)), (NOT p2), true, (AND (NOT p2) p1), (AND p1 (NOT p2)), p1]
Running random walk in product with property : ShieldRVt-PT-001B-LTLFireability-10
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-001B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-001B-LTLFireability-10 finished in 2619 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((!p0||X(p1)))&&(X(p2) U ((!p1&&X(p2))||X(G(p2))))))'
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 44 transition count 44
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 44 transition count 44
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 43 transition count 43
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 43 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 42 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 42 transition count 42
Applied a total of 22 rules in 6 ms. Remains 42 /53 variables (removed 11) and now considering 42/53 (removed 11) transitions.
// Phase 1: matrix 42 rows 42 cols
[2025-06-05 03:44:55] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:44:55] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-05 03:44:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:44:55] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Running 41 sub problems to find dead transitions.
[2025-06-05 03:44:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:55] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 42/84 variables, 42/48 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 0/84 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/84 variables, and 48 constraints, problems are : Problem set: 0 solved, 41 unsolved in 654 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:56] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:56] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 42/84 variables, 42/50 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 41/91 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:56] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:56] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/84 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:56] [INFO ] Deduced a trap along path composed of 7 places in 29 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/84 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/84 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:57] [INFO ] Deduced a trap along path composed of 6 places in 23 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/84 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/84 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 14 (OVERLAPS) 0/84 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/84 variables, and 95 constraints, problems are : Problem set: 0 solved, 41 unsolved in 2088 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 2744ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 2744ms
Starting structural reductions in LTL mode, iteration 1 : 42/53 places, 42/53 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2814 ms. Remains : 42/53 places, 42/53 transitions.
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (NOT p2), (NOT p2), (NOT p1), true]
Running random walk in product with property : ShieldRVt-PT-001B-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-001B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-001B-LTLFireability-11 finished in 3063 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&F(p1)) U X(G(p2))))'
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 43 transition count 43
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 43 transition count 43
Applied a total of 20 rules in 5 ms. Remains 43 /53 variables (removed 10) and now considering 43/53 (removed 10) transitions.
// Phase 1: matrix 43 rows 43 cols
[2025-06-05 03:44:58] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:44:58] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-05 03:44:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:44:58] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Running 42 sub problems to find dead transitions.
[2025-06-05 03:44:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:58] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 43/86 variables, 43/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 0/86 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 49 constraints, problems are : Problem set: 0 solved, 42 unsolved in 687 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 43/86 variables, 43/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 42/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:59] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:59] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:59] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:59] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:59] [INFO ] Deduced a trap along path composed of 7 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:44:59] [INFO ] Deduced a trap along path composed of 6 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:45:00] [INFO ] Deduced a trap along path composed of 7 places in 29 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/86 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (OVERLAPS) 0/86 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 98 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1567 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 2258ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 2259ms
Starting structural reductions in LTL mode, iteration 1 : 43/53 places, 43/53 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2328 ms. Remains : 43/53 places, 43/53 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-001B-LTLFireability-12
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-001B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-001B-LTLFireability-12 finished in 2520 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((X(X(p1))&&p0)))||(X(p2)&&F(p3))))'
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 43 transition count 43
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 43 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 42 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 41 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 41 transition count 41
Applied a total of 24 rules in 4 ms. Remains 41 /53 variables (removed 12) and now considering 41/53 (removed 12) transitions.
// Phase 1: matrix 41 rows 41 cols
[2025-06-05 03:45:01] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:45:01] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-05 03:45:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:45:01] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2025-06-05 03:45:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:45:01] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:45:01] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:45:01] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 41/82 variables, 41/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/82 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/82 variables, and 49 constraints, problems are : Problem set: 0 solved, 40 unsolved in 716 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 41/41 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 41/82 variables, 41/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 40/89 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:45:02] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:45:02] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:45:02] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:45:02] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:45:02] [INFO ] Deduced a trap along path composed of 7 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:45:02] [INFO ] Deduced a trap along path composed of 7 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/82 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 0/82 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/82 variables, and 95 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1482 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 41/41 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 2202ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 2202ms
Starting structural reductions in LTL mode, iteration 1 : 41/53 places, 41/53 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2270 ms. Remains : 41/53 places, 41/53 transitions.
Stuttering acceptance computed with spot in 354 ms :[true, (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p3), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-001B-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-001B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-001B-LTLFireability-13 finished in 2650 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p1)))))'
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 43 transition count 43
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 43 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 42 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 41 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 41 transition count 41
Applied a total of 24 rules in 2 ms. Remains 41 /53 variables (removed 12) and now considering 41/53 (removed 12) transitions.
// Phase 1: matrix 41 rows 41 cols
[2025-06-05 03:45:03] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:45:03] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-05 03:45:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:45:03] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2025-06-05 03:45:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:45:04] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 41/82 variables, 41/47 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/82 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/82 variables, and 47 constraints, problems are : Problem set: 0 solved, 40 unsolved in 636 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 41/41 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 41/82 variables, 41/47 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 40/87 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:45:04] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:45:04] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:45:04] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:45:04] [INFO ] Deduced a trap along path composed of 7 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:45:04] [INFO ] Deduced a trap along path composed of 7 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:45:05] [INFO ] Deduced a trap along path composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/82 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 0/82 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/82 variables, and 93 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1522 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 41/41 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 2161ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 2161ms
Starting structural reductions in LTL mode, iteration 1 : 41/53 places, 41/53 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2229 ms. Remains : 41/53 places, 41/53 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-001B-LTLFireability-14
Product exploration explored 100000 steps with 3069 reset in 112 ms.
Stack based approach found an accepted trace after 144 steps with 4 reset with depth 31 and stack size 31 in 1 ms.
FORMULA ShieldRVt-PT-001B-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-001B-LTLFireability-14 finished in 2472 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0||X(p1)) U p2))'
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 44 transition count 44
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 44 transition count 44
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 43 transition count 43
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 43 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 42 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 42 transition count 42
Applied a total of 22 rules in 2 ms. Remains 42 /53 variables (removed 11) and now considering 42/53 (removed 11) transitions.
// Phase 1: matrix 42 rows 42 cols
[2025-06-05 03:45:06] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:45:06] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-05 03:45:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 03:45:06] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Running 41 sub problems to find dead transitions.
[2025-06-05 03:45:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:45:06] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:45:06] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:45:06] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 42/84 variables, 42/50 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 0/84 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/84 variables, and 50 constraints, problems are : Problem set: 0 solved, 41 unsolved in 726 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 42/84 variables, 42/50 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 41/91 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:45:07] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:45:07] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:45:07] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:45:07] [INFO ] Deduced a trap along path composed of 7 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/84 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:45:08] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/84 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/84 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 12 (OVERLAPS) 0/84 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/84 variables, and 96 constraints, problems are : Problem set: 0 solved, 41 unsolved in 1816 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2547ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 2547ms
Starting structural reductions in LTL mode, iteration 1 : 42/53 places, 42/53 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2619 ms. Remains : 42/53 places, 42/53 transitions.
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-001B-LTLFireability-15
Entered a terminal (fully accepting) state of product in 67 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-001B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-001B-LTLFireability-15 finished in 2742 ms.
All properties solved by simple procedures.
Total runtime 50055 ms.

BK_STOP 1749095109041

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-001B.tgz
mv ShieldRVt-PT-001B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;