fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r198-tall-174894532800508
Last Updated
June 24, 2025

About the Execution of ITS-Tools for ShieldIIPt-PT-010A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 143340.00 0.00 0.00 FFFFFFFFFFFTFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r198-tall-174894532800508.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 ShieldIIPt-PT-010A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894532800508
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K 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.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 53K May 29 14:32 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 ShieldIIPt-PT-010A-LTLFireability-00
FORMULA_NAME ShieldIIPt-PT-010A-LTLFireability-01
FORMULA_NAME ShieldIIPt-PT-010A-LTLFireability-02
FORMULA_NAME ShieldIIPt-PT-010A-LTLFireability-03
FORMULA_NAME ShieldIIPt-PT-010A-LTLFireability-04
FORMULA_NAME ShieldIIPt-PT-010A-LTLFireability-05
FORMULA_NAME ShieldIIPt-PT-010A-LTLFireability-06
FORMULA_NAME ShieldIIPt-PT-010A-LTLFireability-07
FORMULA_NAME ShieldIIPt-PT-010A-LTLFireability-08
FORMULA_NAME ShieldIIPt-PT-010A-LTLFireability-09
FORMULA_NAME ShieldIIPt-PT-010A-LTLFireability-10
FORMULA_NAME ShieldIIPt-PT-010A-LTLFireability-11
FORMULA_NAME ShieldIIPt-PT-010A-LTLFireability-12
FORMULA_NAME ShieldIIPt-PT-010A-LTLFireability-13
FORMULA_NAME ShieldIIPt-PT-010A-LTLFireability-14
FORMULA_NAME ShieldIIPt-PT-010A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749127211106

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-010A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-05 12:40:12] [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 12:40:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 12:40:12] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2025-06-05 12:40:12] [INFO ] Transformed 193 places.
[2025-06-05 12:40:12] [INFO ] Transformed 143 transitions.
[2025-06-05 12:40:12] [INFO ] Found NUPN structural information;
[2025-06-05 12:40:12] [INFO ] Parsed PT model containing 193 places and 143 transitions and 606 arcs in 157 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldIIPt-PT-010A-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010A-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 142/142 transitions.
Applied a total of 0 rules in 13 ms. Remains 193 /193 variables (removed 0) and now considering 142/142 (removed 0) transitions.
// Phase 1: matrix 142 rows 193 cols
[2025-06-05 12:40:12] [INFO ] Computed 91 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:40:12] [INFO ] Implicit Places using invariants in 290 ms returned []
[2025-06-05 12:40:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:40:13] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
Running 141 sub problems to find dead transitions.
[2025-06-05 12:40:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 91/283 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (OVERLAPS) 142/335 variables, 193/477 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (OVERLAPS) 0/335 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 477 constraints, problems are : Problem set: 0 solved, 141 unsolved in 5983 ms.
Refiners :[Domain max(s): 193/193 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 91/283 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (OVERLAPS) 142/335 variables, 193/477 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 141/618 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (OVERLAPS) 0/335 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 335/335 variables, and 618 constraints, problems are : Problem set: 0 solved, 141 unsolved in 9469 ms.
Refiners :[Domain max(s): 193/193 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15518ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 15529ms
Finished structural reductions in LTL mode , in 1 iterations and 16076 ms. Remains : 193/193 places, 142/142 transitions.
Support contains 53 out of 193 places after structural reductions.
[2025-06-05 12:40:28] [INFO ] Flatten gal took : 40 ms
[2025-06-05 12:40:28] [INFO ] Flatten gal took : 19 ms
[2025-06-05 12:40:28] [INFO ] Input system was already deterministic with 142 transitions.
Reduction of identical properties reduced properties to check from 37 to 36
RANDOM walk for 27943 steps (6 resets) in 1147 ms. (24 steps per ms) remains 0/36 properties
FORMULA ShieldIIPt-PT-010A-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ShieldIIPt-PT-010A-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((!p0 U (p1||G(!p0)))||(p2&&F(((p3&&X(X(F(p3))))||G(F(p3)))))))))'
Support contains 8 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 142/142 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 192 transition count 141
Applied a total of 2 rules in 31 ms. Remains 192 /193 variables (removed 1) and now considering 141/142 (removed 1) transitions.
// Phase 1: matrix 141 rows 192 cols
[2025-06-05 12:40:29] [INFO ] Computed 91 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:40:30] [INFO ] Implicit Places using invariants in 141 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 144 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 191/193 places, 141/142 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 191 transition count 140
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 190 transition count 140
Applied a total of 2 rules in 16 ms. Remains 190 /191 variables (removed 1) and now considering 140/141 (removed 1) transitions.
// Phase 1: matrix 140 rows 190 cols
[2025-06-05 12:40:30] [INFO ] Computed 90 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:40:30] [INFO ] Implicit Places using invariants in 102 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 103 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 189/193 places, 140/142 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 188 transition count 139
Applied a total of 2 rules in 12 ms. Remains 188 /189 variables (removed 1) and now considering 139/140 (removed 1) transitions.
// Phase 1: matrix 139 rows 188 cols
[2025-06-05 12:40:30] [INFO ] Computed 89 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:40:30] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-05 12:40:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:40:30] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 188/193 places, 139/142 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 569 ms. Remains : 188/193 places, 139/142 transitions.
Stuttering acceptance computed with spot in 356 ms :[(OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), (OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), (AND (NOT p1) p0 (NOT p3)), (AND (NOT p1) p0 (NOT p3)), (AND (NOT p1) p0 (NOT p3))]
Running random walk in product with property : ShieldIIPt-PT-010A-LTLFireability-00
Product exploration explored 100000 steps with 11638 reset in 447 ms.
Product exploration explored 100000 steps with 11520 reset in 369 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0) p3), (X p2), (X p3), (X (NOT (AND (NOT p3) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND p2 (NOT p3) (NOT p1)))), (X (NOT (AND p2 p3 (NOT p1)))), (X (NOT (AND p3 (NOT p1)))), (X (NOT (AND p2 (NOT p3) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p3) (NOT p1)))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (AND p2 p3 (NOT p1)))), (X (X (AND p3 (NOT p1)))), (X (X (NOT (AND p2 (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p3) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 149 ms. Reduced automaton from 5 states, 16 edges and 4 AP (stutter insensitive) to 13 states, 40 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 618 ms :[(OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), (OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), (AND p0 (NOT p1) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), false, false, false, false, false, false, false, false]
RANDOM walk for 40000 steps (8 resets) in 341 ms. (116 steps per ms) remains 2/17 properties
BEST_FIRST walk for 40003 steps (8 resets) in 238 ms. (167 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 131 ms. (303 steps per ms) remains 2/2 properties
[2025-06-05 12:40:32] [INFO ] Invariant cache hit.
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/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 10/18 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 170/188 variables, 81/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 170/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 139/327 variables, 188/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/327 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/327 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 465 constraints, problems are : Problem set: 0 solved, 2 unsolved in 122 ms.
Refiners :[Domain max(s): 188/188 constraints, Positive P Invariants (semi-flows): 89/89 constraints, State Equation: 188/188 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/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 10/18 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 170/188 variables, 81/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 170/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 139/327 variables, 188/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/327 variables, 2/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/327 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/327 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/327 variables, and 467 constraints, problems are : Problem set: 0 solved, 2 unsolved in 258 ms.
Refiners :[Domain max(s): 188/188 constraints, Positive P Invariants (semi-flows): 89/89 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 385ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 5144 steps, including 135 resets, run visited all 2 properties in 46 ms. (steps per millisecond=111 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 51 ms.
Knowledge obtained : [(AND p2 p1 (NOT p0) p3), (X p2), (X p3), (X (NOT (AND (NOT p3) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND p2 (NOT p3) (NOT p1)))), (X (NOT (AND p2 p3 (NOT p1)))), (X (NOT (AND p3 (NOT p1)))), (X (NOT (AND p2 (NOT p3) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p3) (NOT p1)))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (AND p2 p3 (NOT p1)))), (X (X (AND p3 (NOT p1)))), (X (X (NOT (AND p2 (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p3) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (OR p1 p3 (NOT p2)))), (F (NOT (OR p1 p3))), (F (NOT (OR p0 p1 (NOT p3) (NOT p2)))), (F p0), (F (NOT (OR p1 (NOT p3)))), (F (NOT (OR (NOT p0) p1 (NOT p3) (NOT p2)))), (F (NOT (OR p0 p1 p2))), (F (NOT (OR (NOT p0) p1 p3))), (F (NOT (OR (NOT p0) p1 p3 (NOT p2)))), (F (NOT (OR p0 p1 (NOT p3) p2))), (F (NOT (OR p0 p1 p3))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT p3)), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p1 (NOT p3) (NOT p2)))), (F (NOT (OR (NOT p0) p1 (NOT p3) p2)))]
Knowledge based reduction with 27 factoid took 796 ms. Reduced automaton from 13 states, 40 edges and 4 AP (stutter insensitive) to 13 states, 40 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 573 ms :[(OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), (OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), (AND p0 (NOT p1) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 590 ms :[(OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), (OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), (AND p0 (NOT p1) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), false, false, false, false, false, false, false, false]
Support contains 8 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 139/139 transitions.
Applied a total of 0 rules in 13 ms. Remains 188 /188 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2025-06-05 12:40:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:40:35] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-06-05 12:40:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:40:35] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 12:40:35] [INFO ] Redundant transitions in 3 ms returned []
Running 138 sub problems to find dead transitions.
[2025-06-05 12:40:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 187/187 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 89/276 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (OVERLAPS) 139/327 variables, 188/465 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 0/327 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 465 constraints, problems are : Problem set: 0 solved, 138 unsolved in 5201 ms.
Refiners :[Domain max(s): 188/188 constraints, Positive P Invariants (semi-flows): 89/89 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 187/187 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 89/276 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (OVERLAPS) 139/327 variables, 188/465 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 138/603 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 0/327 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/327 variables, and 603 constraints, problems are : Problem set: 0 solved, 138 unsolved in 8555 ms.
Refiners :[Domain max(s): 188/188 constraints, Positive P Invariants (semi-flows): 89/89 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13776ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 13777ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14056 ms. Remains : 188/188 places, 139/139 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2 p3), (X p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p3), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p1) p3 p2))), (X (NOT (AND (NOT p1) p3 p2))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p1) p3 p2))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (AND (NOT p0) (NOT p1) p3 p2))), (X (X (NOT (AND p0 (NOT p1) p3 (NOT p2))))), (X (X (AND (NOT p1) p3 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p3 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p3 p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 186 ms. Reduced automaton from 13 states, 40 edges and 4 AP (stutter insensitive) to 13 states, 40 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 604 ms :[(OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), (OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), (AND p0 (NOT p1) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), false, false, false, false, false, false, false, false]
RANDOM walk for 32646 steps (6 resets) in 263 ms. (123 steps per ms) remains 0/17 properties
Knowledge obtained : [(AND (NOT p0) p1 p2 p3), (X p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p3), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p1) p3 p2))), (X (NOT (AND (NOT p1) p3 p2))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p1) p3 p2))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (AND (NOT p0) (NOT p1) p3 p2))), (X (X (NOT (AND p0 (NOT p1) p3 (NOT p2))))), (X (X (AND (NOT p1) p3 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p3 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p3 p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1 (NOT p2) (NOT p3)))), (F (NOT (OR p0 p1 p3))), (F (NOT (OR p1 (NOT p2) p3))), (F (NOT p1)), (F (NOT (OR p0 p1 p2))), (F p0), (F (NOT (OR (NOT p0) p1 p2 (NOT p3)))), (F (NOT (OR (NOT p0) p1 p3))), (F (NOT (OR p0 p1 (NOT p2) (NOT p3)))), (F (NOT (OR p0 p1 p2 (NOT p3)))), (F (NOT (OR p1 (NOT p3)))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT p3)), (F (NOT (OR p1 (NOT p2) (NOT p3)))), (F (NOT p2)), (F (NOT (OR (NOT p0) p1 (NOT p2) p3))), (F (NOT (OR p1 p3)))]
Knowledge based reduction with 31 factoid took 791 ms. Reduced automaton from 13 states, 40 edges and 4 AP (stutter insensitive) to 13 states, 40 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 569 ms :[(OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), (OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), (AND p0 (NOT p1) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 548 ms :[(OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), (OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), (AND p0 (NOT p1) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 598 ms :[(OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), (OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), (AND p0 (NOT p1) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), false, false, false, false, false, false, false, false]
Product exploration explored 100000 steps with 6 reset in 255 ms.
Product exploration explored 100000 steps with 8 reset in 342 ms.
Built C files in :
/tmp/ltsmin8722740452037873862
[2025-06-05 12:40:53] [INFO ] Computing symmetric may disable matrix : 139 transitions.
[2025-06-05 12:40:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 12:40:53] [INFO ] Computing symmetric may enable matrix : 139 transitions.
[2025-06-05 12:40:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 12:40:53] [INFO ] Computing Do-Not-Accords matrix : 139 transitions.
[2025-06-05 12:40:53] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 12:40:53] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8722740452037873862
Running compilation step : cd /tmp/ltsmin8722740452037873862;'/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 407 ms.
Running link step : cd /tmp/ltsmin8722740452037873862;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin8722740452037873862;'/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/stateBased138580742698918979.hoa' '--buchi-type=spotba'
LTSmin run took 3502 ms.
FORMULA ShieldIIPt-PT-010A-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPt-PT-010A-LTLFireability-00 finished in 27413 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 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 142/142 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 193 transition count 141
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 192 transition count 141
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 191 transition count 140
Applied a total of 4 rules in 15 ms. Remains 191 /193 variables (removed 2) and now considering 140/142 (removed 2) transitions.
// Phase 1: matrix 140 rows 191 cols
[2025-06-05 12:40:57] [INFO ] Computed 91 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:40:57] [INFO ] Implicit Places using invariants in 116 ms returned [183, 184]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 117 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 189/193 places, 140/142 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 189 transition count 139
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 188 transition count 139
Applied a total of 2 rules in 7 ms. Remains 188 /189 variables (removed 1) and now considering 139/140 (removed 1) transitions.
// Phase 1: matrix 139 rows 188 cols
[2025-06-05 12:40:57] [INFO ] Computed 89 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:40:57] [INFO ] Implicit Places using invariants in 166 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 169 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 187/193 places, 139/142 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 138
Applied a total of 2 rules in 14 ms. Remains 186 /187 variables (removed 1) and now considering 138/139 (removed 1) transitions.
// Phase 1: matrix 138 rows 186 cols
[2025-06-05 12:40:57] [INFO ] Computed 88 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:40:57] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-06-05 12:40:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:40:57] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 186/193 places, 138/142 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 563 ms. Remains : 186/193 places, 138/142 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-010A-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 272 ms.
Stack based approach found an accepted trace after 41 steps with 0 reset with depth 42 and stack size 42 in 0 ms.
FORMULA ShieldIIPt-PT-010A-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-010A-LTLFireability-01 finished in 908 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(F(p0))||(!p1&&F(p0)))))||(F(!p2)&&X(X(X(F((G(F(p0))||(!p1&&F(p0))))))))))'
Support contains 5 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 142/142 transitions.
Applied a total of 0 rules in 3 ms. Remains 193 /193 variables (removed 0) and now considering 142/142 (removed 0) transitions.
// Phase 1: matrix 142 rows 193 cols
[2025-06-05 12:40:58] [INFO ] Computed 91 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:40:58] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-06-05 12:40:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:40:58] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 141 sub problems to find dead transitions.
[2025-06-05 12:40: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/192 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 91/283 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (OVERLAPS) 142/335 variables, 193/477 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (OVERLAPS) 0/335 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 477 constraints, problems are : Problem set: 0 solved, 141 unsolved in 5587 ms.
Refiners :[Domain max(s): 193/193 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 91/283 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (OVERLAPS) 142/335 variables, 193/477 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 141/618 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (OVERLAPS) 0/335 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 335/335 variables, and 618 constraints, problems are : Problem set: 0 solved, 141 unsolved in 9008 ms.
Refiners :[Domain max(s): 193/193 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14612ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 14613ms
Finished structural reductions in LTL mode , in 1 iterations and 14881 ms. Remains : 193/193 places, 142/142 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-010A-LTLFireability-04
Product exploration explored 100000 steps with 56 reset in 253 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA ShieldIIPt-PT-010A-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-010A-LTLFireability-04 finished in 15379 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||G(p1)))))'
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 142/142 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 192 transition count 140
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 190 transition count 140
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 188 transition count 139
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 188 transition count 138
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 187 transition count 138
Applied a total of 8 rules in 16 ms. Remains 187 /193 variables (removed 6) and now considering 138/142 (removed 4) transitions.
// Phase 1: matrix 138 rows 187 cols
[2025-06-05 12:41:13] [INFO ] Computed 89 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:41:13] [INFO ] Implicit Places using invariants in 99 ms returned [176]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 112 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 186/193 places, 138/142 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 185 transition count 137
Applied a total of 2 rules in 9 ms. Remains 185 /186 variables (removed 1) and now considering 137/138 (removed 1) transitions.
// Phase 1: matrix 137 rows 185 cols
[2025-06-05 12:41:13] [INFO ] Computed 88 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:41:13] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-06-05 12:41:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:41:13] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 185/193 places, 137/142 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 374 ms. Remains : 185/193 places, 137/142 transitions.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-010A-LTLFireability-05
Product exploration explored 100000 steps with 9396 reset in 217 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA ShieldIIPt-PT-010A-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-010A-LTLFireability-05 finished in 668 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(p0) U X(G((p1||G(p2))))))'
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 142/142 transitions.
Applied a total of 0 rules in 2 ms. Remains 193 /193 variables (removed 0) and now considering 142/142 (removed 0) transitions.
// Phase 1: matrix 142 rows 193 cols
[2025-06-05 12:41:14] [INFO ] Computed 91 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:41:14] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-06-05 12:41:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:41:14] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Running 141 sub problems to find dead transitions.
[2025-06-05 12:41:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 91/283 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (OVERLAPS) 142/335 variables, 193/477 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (OVERLAPS) 0/335 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 477 constraints, problems are : Problem set: 0 solved, 141 unsolved in 5368 ms.
Refiners :[Domain max(s): 193/193 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 91/283 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (OVERLAPS) 142/335 variables, 193/477 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 141/618 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (OVERLAPS) 0/335 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 335/335 variables, and 618 constraints, problems are : Problem set: 0 solved, 141 unsolved in 9238 ms.
Refiners :[Domain max(s): 193/193 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14627ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 14628ms
Finished structural reductions in LTL mode , in 1 iterations and 14883 ms. Remains : 193/193 places, 142/142 transitions.
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-010A-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-010A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-010A-LTLFireability-06 finished in 15162 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))))'
Support contains 5 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 142/142 transitions.
Applied a total of 0 rules in 2 ms. Remains 193 /193 variables (removed 0) and now considering 142/142 (removed 0) transitions.
[2025-06-05 12:41:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:41:29] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-06-05 12:41:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:41:29] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Running 141 sub problems to find dead transitions.
[2025-06-05 12:41:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 91/283 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (OVERLAPS) 142/335 variables, 193/477 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (OVERLAPS) 0/335 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 477 constraints, problems are : Problem set: 0 solved, 141 unsolved in 5660 ms.
Refiners :[Domain max(s): 193/193 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 91/283 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (OVERLAPS) 142/335 variables, 193/477 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 141/618 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (OVERLAPS) 0/335 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 335/335 variables, and 618 constraints, problems are : Problem set: 0 solved, 141 unsolved in 9121 ms.
Refiners :[Domain max(s): 193/193 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14795ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 14795ms
Finished structural reductions in LTL mode , in 1 iterations and 15045 ms. Remains : 193/193 places, 142/142 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
Running random walk in product with property : ShieldIIPt-PT-010A-LTLFireability-08
Entered a terminal (fully accepting) state of product in 508 steps with 0 reset in 4 ms.
FORMULA ShieldIIPt-PT-010A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-010A-LTLFireability-08 finished in 15213 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(p0))&&((X(p1) U (G(p2) U p3))||F(p4))))'
Support contains 8 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 142/142 transitions.
Applied a total of 0 rules in 2 ms. Remains 193 /193 variables (removed 0) and now considering 142/142 (removed 0) transitions.
[2025-06-05 12:41:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:41:44] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-06-05 12:41:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:41:44] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Running 141 sub problems to find dead transitions.
[2025-06-05 12:41:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 91/283 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (OVERLAPS) 142/335 variables, 193/477 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (OVERLAPS) 0/335 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 477 constraints, problems are : Problem set: 0 solved, 141 unsolved in 5557 ms.
Refiners :[Domain max(s): 193/193 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 91/283 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (OVERLAPS) 142/335 variables, 193/477 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 141/618 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (OVERLAPS) 0/335 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 335/335 variables, and 618 constraints, problems are : Problem set: 0 solved, 141 unsolved in 9082 ms.
Refiners :[Domain max(s): 193/193 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14656ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 14656ms
Finished structural reductions in LTL mode , in 1 iterations and 14914 ms. Remains : 193/193 places, 142/142 transitions.
Stuttering acceptance computed with spot in 368 ms :[(OR (NOT p0) (AND (NOT p3) (NOT p4))), (NOT p0), (AND (NOT p3) (NOT p4)), (AND (NOT p4) (NOT p1)), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4))), (NOT p0), true, (NOT p4), (AND (NOT p4) (NOT p2)), (AND (NOT p3) (NOT p4))]
Running random walk in product with property : ShieldIIPt-PT-010A-LTLFireability-09
Product exploration explored 100000 steps with 197 reset in 253 ms.
Stack based approach found an accepted trace after 126 steps with 3 reset with depth 118 and stack size 118 in 0 ms.
FORMULA ShieldIIPt-PT-010A-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-010A-LTLFireability-09 finished in 15560 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(G(p0)))'
Support contains 1 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 142/142 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 192 transition count 140
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 190 transition count 140
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 188 transition count 139
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 188 transition count 138
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 187 transition count 138
Applied a total of 8 rules in 9 ms. Remains 187 /193 variables (removed 6) and now considering 138/142 (removed 4) transitions.
// Phase 1: matrix 138 rows 187 cols
[2025-06-05 12:42:00] [INFO ] Computed 89 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:42:00] [INFO ] Implicit Places using invariants in 96 ms returned [176]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 97 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 186/193 places, 138/142 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 185 transition count 137
Applied a total of 2 rules in 6 ms. Remains 185 /186 variables (removed 1) and now considering 137/138 (removed 1) transitions.
// Phase 1: matrix 137 rows 185 cols
[2025-06-05 12:42:00] [INFO ] Computed 88 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:42:00] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-06-05 12:42:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:42:00] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 185/193 places, 137/142 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 373 ms. Remains : 185/193 places, 137/142 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-010A-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 277 ms.
Stack based approach found an accepted trace after 101 steps with 0 reset with depth 102 and stack size 100 in 0 ms.
FORMULA ShieldIIPt-PT-010A-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-010A-LTLFireability-10 finished in 699 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 (p1||G(!p0)))))'
Support contains 5 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 142/142 transitions.
Applied a total of 0 rules in 2 ms. Remains 193 /193 variables (removed 0) and now considering 142/142 (removed 0) transitions.
// Phase 1: matrix 142 rows 193 cols
[2025-06-05 12:42:00] [INFO ] Computed 91 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:42:01] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-06-05 12:42:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:42:01] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Running 141 sub problems to find dead transitions.
[2025-06-05 12:42: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/192 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 91/283 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (OVERLAPS) 142/335 variables, 193/477 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (OVERLAPS) 0/335 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 477 constraints, problems are : Problem set: 0 solved, 141 unsolved in 5612 ms.
Refiners :[Domain max(s): 193/193 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 91/283 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (OVERLAPS) 142/335 variables, 193/477 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 141/618 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (OVERLAPS) 0/335 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 335/335 variables, and 618 constraints, problems are : Problem set: 0 solved, 141 unsolved in 9239 ms.
Refiners :[Domain max(s): 193/193 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14867ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 14867ms
Finished structural reductions in LTL mode , in 1 iterations and 15127 ms. Remains : 193/193 places, 142/142 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : ShieldIIPt-PT-010A-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 345 ms.
Product exploration explored 100000 steps with 50000 reset in 364 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 18 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-010A-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-010A-LTLFireability-11 finished in 15987 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((G(p0) U (F(X(p1)) U p2))))'
Support contains 6 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 142/142 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 193 transition count 141
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 192 transition count 141
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 191 transition count 140
Applied a total of 4 rules in 16 ms. Remains 191 /193 variables (removed 2) and now considering 140/142 (removed 2) transitions.
// Phase 1: matrix 140 rows 191 cols
[2025-06-05 12:42:16] [INFO ] Computed 91 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:42:17] [INFO ] Implicit Places using invariants in 115 ms returned [183, 184]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 117 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 189/193 places, 140/142 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 189 transition count 139
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 188 transition count 139
Applied a total of 2 rules in 6 ms. Remains 188 /189 variables (removed 1) and now considering 139/140 (removed 1) transitions.
// Phase 1: matrix 139 rows 188 cols
[2025-06-05 12:42:17] [INFO ] Computed 89 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:42:17] [INFO ] Implicit Places using invariants in 96 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 98 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 187/193 places, 139/142 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 138
Applied a total of 2 rules in 5 ms. Remains 186 /187 variables (removed 1) and now considering 138/139 (removed 1) transitions.
// Phase 1: matrix 138 rows 186 cols
[2025-06-05 12:42:17] [INFO ] Computed 88 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:42:17] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-06-05 12:42:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:42:17] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 186/193 places, 138/142 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 508 ms. Remains : 186/193 places, 138/142 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-010A-LTLFireability-12
Product exploration explored 100000 steps with 41 reset in 270 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 1 ms.
FORMULA ShieldIIPt-PT-010A-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-010A-LTLFireability-12 finished in 1010 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&&G(p1))))'
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 142/142 transitions.
Applied a total of 0 rules in 1 ms. Remains 193 /193 variables (removed 0) and now considering 142/142 (removed 0) transitions.
// Phase 1: matrix 142 rows 193 cols
[2025-06-05 12:42:17] [INFO ] Computed 91 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:42:18] [INFO ] Implicit Places using invariants in 113 ms returned []
[2025-06-05 12:42:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:42:18] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Running 141 sub problems to find dead transitions.
[2025-06-05 12:42:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 91/283 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (OVERLAPS) 142/335 variables, 193/477 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (OVERLAPS) 0/335 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 477 constraints, problems are : Problem set: 0 solved, 141 unsolved in 5636 ms.
Refiners :[Domain max(s): 193/193 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 91/283 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (OVERLAPS) 142/335 variables, 193/477 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 141/618 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (OVERLAPS) 0/335 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 335/335 variables, and 618 constraints, problems are : Problem set: 0 solved, 141 unsolved in 9416 ms.
Refiners :[Domain max(s): 193/193 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15067ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 15068ms
Finished structural reductions in LTL mode , in 1 iterations and 15343 ms. Remains : 193/193 places, 142/142 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-010A-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-010A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-010A-LTLFireability-13 finished in 15493 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((F(G(p0))&&(p1 U p2)&&(p3 U p4))))'
Support contains 5 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 142/142 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 193 transition count 141
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 192 transition count 141
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 191 transition count 140
Applied a total of 4 rules in 14 ms. Remains 191 /193 variables (removed 2) and now considering 140/142 (removed 2) transitions.
// Phase 1: matrix 140 rows 191 cols
[2025-06-05 12:42:33] [INFO ] Computed 91 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:42:33] [INFO ] Implicit Places using invariants in 116 ms returned [183, 184]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 117 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 189/193 places, 140/142 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 189 transition count 139
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 188 transition count 139
Applied a total of 2 rules in 4 ms. Remains 188 /189 variables (removed 1) and now considering 139/140 (removed 1) transitions.
// Phase 1: matrix 139 rows 188 cols
[2025-06-05 12:42:33] [INFO ] Computed 89 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:42:33] [INFO ] Implicit Places using invariants in 105 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 106 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 187/193 places, 139/142 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 138
Applied a total of 2 rules in 5 ms. Remains 186 /187 variables (removed 1) and now considering 138/139 (removed 1) transitions.
// Phase 1: matrix 138 rows 186 cols
[2025-06-05 12:42:33] [INFO ] Computed 88 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:42:33] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-06-05 12:42:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:42:33] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 186/193 places, 138/142 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 508 ms. Remains : 186/193 places, 138/142 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p4) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p2) (NOT p4)), (NOT p2), (NOT p4)]
Running random walk in product with property : ShieldIIPt-PT-010A-LTLFireability-15
Product exploration explored 100000 steps with 1 reset in 257 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA ShieldIIPt-PT-010A-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-010A-LTLFireability-15 finished in 1012 ms.
All properties solved by simple procedures.
Total runtime 142130 ms.

BK_STOP 1749127354446

--------------------
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="ShieldIIPt-PT-010A"
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 ShieldIIPt-PT-010A, 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 r198-tall-174894532800508"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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