About the Execution of ITS-Tools for ShieldIIPs-PT-003A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | FTFFTFFFFFF?FFTT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r198-tall-174894532400284.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 ShieldIIPs-PT-003A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894532400284
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 126K 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 26K 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 ShieldIIPs-PT-003A-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-003A-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-003A-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-003A-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-003A-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-003A-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-003A-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-003A-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-003A-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-003A-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-003A-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-003A-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-003A-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-003A-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-003A-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-003A-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1749022027121
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-003A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-04 07:27:08] [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-04 07:27:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 07:27:08] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2025-06-04 07:27:08] [INFO ] Transformed 78 places.
[2025-06-04 07:27:08] [INFO ] Transformed 75 transitions.
[2025-06-04 07:27:08] [INFO ] Found NUPN structural information;
[2025-06-04 07:27:08] [INFO ] Parsed PT model containing 78 places and 75 transitions and 330 arcs in 142 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 3 formulas.
FORMULA ShieldIIPs-PT-003A-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-003A-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-003A-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 75/75 transitions.
Applied a total of 0 rules in 7 ms. Remains 78 /78 variables (removed 0) and now considering 75/75 (removed 0) transitions.
// Phase 1: matrix 75 rows 78 cols
[2025-06-04 07:27:08] [INFO ] Computed 28 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:27:08] [INFO ] Implicit Places using invariants in 204 ms returned []
[2025-06-04 07:27:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:27:08] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2025-06-04 07:27:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:27:09] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:27:09] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:27:09] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/187 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:27:10] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:27:10] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:27:10] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 190 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2921 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 74/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:27:16] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/153 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:27:26] [INFO ] Deduced a trap along path composed of 8 places in 45 ms of which 10 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/153 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (OVERLAPS) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 266 constraints, problems are : Problem set: 0 solved, 74 unsolved in 28636 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 31631ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 31651ms
Finished structural reductions in LTL mode , in 1 iterations and 32030 ms. Remains : 78/78 places, 75/75 transitions.
Support contains 39 out of 78 places after structural reductions.
[2025-06-04 07:27:40] [INFO ] Flatten gal took : 28 ms
[2025-06-04 07:27:40] [INFO ] Flatten gal took : 16 ms
[2025-06-04 07:27:40] [INFO ] Input system was already deterministic with 75 transitions.
Reduction of identical properties reduced properties to check from 29 to 28
RANDOM walk for 40000 steps (210 resets) in 953 ms. (41 steps per ms) remains 1/28 properties
BEST_FIRST walk for 40003 steps (56 resets) in 267 ms. (149 steps per ms) remains 1/1 properties
[2025-06-04 07:27:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp9 is UNSAT
After SMT solving in domain Real declared 13/153 variables, and 9 constraints, problems are : Problem set: 1 solved, 0 unsolved in 21 ms.
Refiners :[Domain max(s): 5/78 constraints, Positive P Invariants (semi-flows): 4/28 constraints, State Equation: 0/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPs-PT-003A-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!(F(G(p0)))'
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 75/75 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 78 transition count 74
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 77 transition count 74
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 4 place count 76 transition count 73
Applied a total of 4 rules in 19 ms. Remains 76 /78 variables (removed 2) and now considering 73/75 (removed 2) transitions.
// Phase 1: matrix 73 rows 76 cols
[2025-06-04 07:27:41] [INFO ] Computed 28 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:27:41] [INFO ] Implicit Places using invariants in 99 ms returned [62]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 101 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/78 places, 73/75 transitions.
Applied a total of 0 rules in 7 ms. Remains 75 /75 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 128 ms. Remains : 75/78 places, 73/75 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-003A-LTLFireability-00
Product exploration explored 100000 steps with 561 reset in 287 ms.
Product exploration explored 100000 steps with 564 reset in 232 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
RANDOM walk for 174 steps (0 resets) in 5 ms. (29 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Support contains 2 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 73/73 transitions.
Applied a total of 0 rules in 13 ms. Remains 75 /75 variables (removed 0) and now considering 73/73 (removed 0) transitions.
// Phase 1: matrix 73 rows 75 cols
[2025-06-04 07:27:42] [INFO ] Computed 27 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:27:43] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-04 07:27:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:27:43] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 07:27:43] [INFO ] Redundant transitions in 22 ms returned [65]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 71 sub problems to find dead transitions.
// Phase 1: matrix 72 rows 75 cols
[2025-06-04 07:27:43] [INFO ] Computed 27 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 1/75 variables, 27/101 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:27:43] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:27:43] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:27:43] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 72/147 variables, 75/180 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:27:44] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:27:44] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:27:44] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:27:44] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 4/184 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:27:44] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 0/147 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 185 constraints, problems are : Problem set: 0 solved, 71 unsolved in 2301 ms.
Refiners :[Domain max(s): 75/75 constraints, Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 1/75 variables, 27/101 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 8/110 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 72/147 variables, 75/185 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 71/256 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:27:46] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 0/147 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 257 constraints, problems are : Problem set: 0 solved, 71 unsolved in 4171 ms.
Refiners :[Domain max(s): 75/75 constraints, Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6487ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 6487ms
Starting structural reductions in SI_LTL mode, iteration 1 : 75/75 places, 72/73 transitions.
Applied a total of 0 rules in 11 ms. Remains 75 /75 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6705 ms. Remains : 75/75 places, 72/73 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 119 steps (0 resets) in 4 ms. (23 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 560 reset in 181 ms.
Product exploration explored 100000 steps with 562 reset in 203 ms.
Built C files in :
/tmp/ltsmin12888049330049064191
[2025-06-04 07:27:50] [INFO ] Computing symmetric may disable matrix : 72 transitions.
[2025-06-04 07:27:50] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 07:27:50] [INFO ] Computing symmetric may enable matrix : 72 transitions.
[2025-06-04 07:27:50] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 07:27:50] [INFO ] Computing Do-Not-Accords matrix : 72 transitions.
[2025-06-04 07:27:50] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 07:27:50] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12888049330049064191
Running compilation step : cd /tmp/ltsmin12888049330049064191;'/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 306 ms.
Running link step : cd /tmp/ltsmin12888049330049064191;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin12888049330049064191;'/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/stateBased5748347323740522205.hoa' '--buchi-type=spotba'
LTSmin run took 113 ms.
FORMULA ShieldIIPs-PT-003A-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPs-PT-003A-LTLFireability-00 finished in 9078 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((X(X(F(!p0)))||(X(!p1) U ((!p2&&X(!p1))||X(G(!p1))))))) U (X(X(G((X(X(F(!p0)))||(X(!p1) U ((!p2&&X(!p1))||X(G(!p1))))))))||(!p3&&X(X((X(X(F(!p0)))||(X(!p1) U ((!p2&&X(!p1))||X(G(!p1)))))))))))'
Support contains 10 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 75/75 transitions.
Applied a total of 0 rules in 5 ms. Remains 78 /78 variables (removed 0) and now considering 75/75 (removed 0) transitions.
// Phase 1: matrix 75 rows 78 cols
[2025-06-04 07:27:50] [INFO ] Computed 28 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:27:51] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-04 07:27:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:27:51] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2025-06-04 07:27:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:27:51] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:27:51] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:27:51] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/187 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:27:52] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:27:52] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:27:52] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 190 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2546 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 74/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:27:58] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/153 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:28:07] [INFO ] Deduced a trap along path composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/153 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (OVERLAPS) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 266 constraints, problems are : Problem set: 0 solved, 74 unsolved in 29012 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 31571ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 31571ms
Finished structural reductions in LTL mode , in 1 iterations and 31701 ms. Remains : 78/78 places, 75/75 transitions.
Stuttering acceptance computed with spot in 1147 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), p0, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1 (NOT p2)), (AND p0 p1), false, (AND p0 p1)]
Running random walk in product with property : ShieldIIPs-PT-003A-LTLFireability-01
Product exploration explored 100000 steps with 25000 reset in 154 ms.
Product exploration explored 100000 steps with 25000 reset in 159 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 (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (X (NOT p3)), (X (X (NOT p2))), (X (X (NOT (AND p3 p2)))), (X (X (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 88 ms. Reduced automaton from 22 states, 51 edges and 4 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[p0, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
RANDOM walk for 725 steps (3 resets) in 10 ms. (65 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (X (NOT p3)), (X (X (NOT p2))), (X (X (NOT (AND p3 p2)))), (X (X (NOT p3)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 5 factoid took 98 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[p0, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 194 ms :[p0, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 5 out of 78 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 75/75 transitions.
Applied a total of 0 rules in 4 ms. Remains 78 /78 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2025-06-04 07:28:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:28:24] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-04 07:28:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:28:25] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2025-06-04 07:28:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:28:25] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:28:25] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:28:25] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/187 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:28:26] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:28:26] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:28:26] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 190 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2493 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 74/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:28:32] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/153 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:28:41] [INFO ] Deduced a trap along path composed of 8 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/153 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (OVERLAPS) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 266 constraints, problems are : Problem set: 0 solved, 74 unsolved in 28515 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 31018ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 31020ms
Finished structural reductions in LTL mode , in 1 iterations and 31159 ms. Remains : 78/78 places, 75/75 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) (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[p0, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
RANDOM walk for 262 steps (0 resets) in 7 ms. (32 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 1 factoid took 118 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[p0, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 176 ms :[p0, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 201 ms :[p0, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 25000 reset in 121 ms.
Product exploration explored 100000 steps with 25000 reset in 131 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 155 ms :[p0, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 5 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 75/75 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 78 transition count 75
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 10 ms. Remains 78 /78 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 07:28:57] [INFO ] Redundant transitions in 21 ms returned [67]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 73 sub problems to find dead transitions.
// Phase 1: matrix 74 rows 78 cols
[2025-06-04 07:28:57] [INFO ] Computed 28 invariants in 1 ms
[2025-06-04 07:28:57] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:28:58] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:28:58] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:28:58] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:28:58] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 3 ms to minimize.
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:28:58] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 5/111 constraints. Problems are: Problem set: 2 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/111 constraints. Problems are: Problem set: 2 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 74/152 variables, 78/189 constraints. Problems are: Problem set: 2 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 3/192 constraints. Problems are: Problem set: 2 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 0/192 constraints. Problems are: Problem set: 2 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:28:59] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 3 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/152 variables, 1/193 constraints. Problems are: Problem set: 2 solved, 71 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 0/193 constraints. Problems are: Problem set: 2 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:28:59] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:28:59] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/152 variables, 2/195 constraints. Problems are: Problem set: 2 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:28:59] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/152 variables, 1/196 constraints. Problems are: Problem set: 2 solved, 71 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/152 variables, 0/196 constraints. Problems are: Problem set: 2 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:29:00] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 2 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/152 variables, 1/197 constraints. Problems are: Problem set: 2 solved, 71 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/152 variables, 0/197 constraints. Problems are: Problem set: 2 solved, 71 unsolved
At refinement iteration 16 (OVERLAPS) 0/152 variables, 0/197 constraints. Problems are: Problem set: 2 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 197 constraints, problems are : Problem set: 2 solved, 71 unsolved in 3312 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 71 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 75/75 constraints. Problems are: Problem set: 2 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/75 constraints. Problems are: Problem set: 2 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 3/78 variables, 28/103 constraints. Problems are: Problem set: 2 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 3/106 constraints. Problems are: Problem set: 2 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 10/116 constraints. Problems are: Problem set: 2 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/116 constraints. Problems are: Problem set: 2 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 74/152 variables, 78/194 constraints. Problems are: Problem set: 2 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 3/197 constraints. Problems are: Problem set: 2 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 71/268 constraints. Problems are: Problem set: 2 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 0/268 constraints. Problems are: Problem set: 2 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 0/152 variables, 0/268 constraints. Problems are: Problem set: 2 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 268 constraints, problems are : Problem set: 2 solved, 71 unsolved in 3598 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 71/73 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6921ms problems are : Problem set: 2 solved, 71 unsolved
Search for dead transitions found 2 dead transitions in 6922ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 78/78 places, 72/75 transitions.
Graph (complete) has 263 edges and 78 vertex of which 76 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 76 /78 variables (removed 2) and now considering 72/72 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 76/78 places, 72/75 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6976 ms. Remains : 76/78 places, 72/75 transitions.
Built C files in :
/tmp/ltsmin11076363876374960153
[2025-06-04 07:29:04] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11076363876374960153
Running compilation step : cd /tmp/ltsmin11076363876374960153;'/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 160 ms.
Running link step : cd /tmp/ltsmin11076363876374960153;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin11076363876374960153;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10841301008083885042.hoa' '--buchi-type=spotba'
LTSmin run took 1023 ms.
FORMULA ShieldIIPs-PT-003A-LTLFireability-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPs-PT-003A-LTLFireability-01 finished in 74994 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G((p0&&(p0 U p1))))||G(p2))))'
Support contains 3 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 75/75 transitions.
Applied a total of 0 rules in 1 ms. Remains 78 /78 variables (removed 0) and now considering 75/75 (removed 0) transitions.
// Phase 1: matrix 75 rows 78 cols
[2025-06-04 07:29:05] [INFO ] Computed 28 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:29:05] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-04 07:29:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:29:06] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2025-06-04 07:29:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:29:06] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:29:06] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:29:06] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/187 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:29:07] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:29:07] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:29:07] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 190 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2531 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 74/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:29:13] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/153 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:29:22] [INFO ] Deduced a trap along path composed of 8 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/153 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (OVERLAPS) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 266 constraints, problems are : Problem set: 0 solved, 74 unsolved in 28175 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 30718ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 30718ms
Finished structural reductions in LTL mode , in 1 iterations and 30879 ms. Remains : 78/78 places, 75/75 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldIIPs-PT-003A-LTLFireability-02
Stuttering criterion allowed to conclude after 193 steps with 0 reset in 2 ms.
FORMULA ShieldIIPs-PT-003A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-003A-LTLFireability-02 finished in 31068 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 75/75 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 78 transition count 74
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 77 transition count 74
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 76 transition count 73
Applied a total of 4 rules in 7 ms. Remains 76 /78 variables (removed 2) and now considering 73/75 (removed 2) transitions.
// Phase 1: matrix 73 rows 76 cols
[2025-06-04 07:29:36] [INFO ] Computed 28 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:29:37] [INFO ] Implicit Places using invariants in 48 ms returned [62]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/78 places, 73/75 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 59 ms. Remains : 75/78 places, 73/75 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-003A-LTLFireability-04
Product exploration explored 100000 steps with 5561 reset in 138 ms.
Product exploration explored 100000 steps with 5572 reset in 148 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 66 steps (0 resets) in 4 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
// Phase 1: matrix 73 rows 75 cols
[2025-06-04 07:29:37] [INFO ] Computed 27 invariants in 2 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-04 07:29:37] [INFO ] [Real]Absence check using 27 positive place invariants in 5 ms returned sat
[2025-06-04 07:29:37] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-06-04 07:29:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-04 07:29:37] [INFO ] [Nat]Absence check using 27 positive place invariants in 6 ms returned sat
[2025-06-04 07:29:37] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2025-06-04 07:29:37] [INFO ] Computed and/alt/rep : 68/249/68 causal constraints (skipped 4 transitions) in 5 ms.
[2025-06-04 07:29:38] [INFO ] Added : 50 causal constraints over 10 iterations in 210 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 73/73 transitions.
Applied a total of 0 rules in 7 ms. Remains 75 /75 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2025-06-04 07:29:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:29:38] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-04 07:29:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:29:38] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 07:29:38] [INFO ] Redundant transitions in 16 ms returned [65]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 71 sub problems to find dead transitions.
// Phase 1: matrix 72 rows 75 cols
[2025-06-04 07:29:38] [INFO ] Computed 27 invariants in 0 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 1/75 variables, 27/101 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:29:38] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:29:38] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:29:38] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 72/147 variables, 75/180 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:29:39] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:29:39] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:29:39] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:29:39] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 4/184 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:29:39] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 0/147 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 185 constraints, problems are : Problem set: 0 solved, 71 unsolved in 2241 ms.
Refiners :[Domain max(s): 75/75 constraints, Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 1/75 variables, 27/101 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 8/110 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 72/147 variables, 75/185 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 71/256 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:29:41] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 0/147 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 257 constraints, problems are : Problem set: 0 solved, 71 unsolved in 4118 ms.
Refiners :[Domain max(s): 75/75 constraints, Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6367ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 6368ms
Starting structural reductions in SI_LTL mode, iteration 1 : 75/75 places, 72/73 transitions.
Applied a total of 0 rules in 10 ms. Remains 75 /75 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6547 ms. Remains : 75/75 places, 72/73 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 70 steps (0 resets) in 4 ms. (14 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
[2025-06-04 07:29:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-04 07:29:44] [INFO ] [Real]Absence check using 27 positive place invariants in 5 ms returned sat
[2025-06-04 07:29:44] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-06-04 07:29:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-04 07:29:45] [INFO ] [Nat]Absence check using 27 positive place invariants in 5 ms returned sat
[2025-06-04 07:29:45] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-04 07:29:45] [INFO ] Computed and/alt/rep : 68/254/68 causal constraints (skipped 3 transitions) in 5 ms.
[2025-06-04 07:29:45] [INFO ] Added : 61 causal constraints over 13 iterations in 141 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5563 reset in 135 ms.
Product exploration explored 100000 steps with 5604 reset in 147 ms.
Built C files in :
/tmp/ltsmin12971245500610560370
[2025-06-04 07:29:45] [INFO ] Computing symmetric may disable matrix : 72 transitions.
[2025-06-04 07:29:45] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 07:29:45] [INFO ] Computing symmetric may enable matrix : 72 transitions.
[2025-06-04 07:29:45] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 07:29:45] [INFO ] Computing Do-Not-Accords matrix : 72 transitions.
[2025-06-04 07:29:45] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 07:29:45] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12971245500610560370
Running compilation step : cd /tmp/ltsmin12971245500610560370;'/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 160 ms.
Running link step : cd /tmp/ltsmin12971245500610560370;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin12971245500610560370;'/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/stateBased8245219252330131138.hoa' '--buchi-type=spotba'
LTSmin run took 277 ms.
FORMULA ShieldIIPs-PT-003A-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPs-PT-003A-LTLFireability-04 finished in 9048 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((X(p0)&&(p1 U p2))))'
Support contains 8 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 75/75 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 75/75 (removed 0) transitions.
// Phase 1: matrix 75 rows 78 cols
[2025-06-04 07:29:46] [INFO ] Computed 28 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:29:46] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-04 07:29:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:29:46] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2025-06-04 07:29:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:29:46] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:29:46] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:29:46] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/187 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:29:47] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:29:47] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:29:47] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 190 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2446 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 74/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:29:53] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/153 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:30:02] [INFO ] Deduced a trap along path composed of 8 places in 28 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/153 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (OVERLAPS) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 266 constraints, problems are : Problem set: 0 solved, 74 unsolved in 28326 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 30781ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 30781ms
Finished structural reductions in LTL mode , in 1 iterations and 30897 ms. Remains : 78/78 places, 75/75 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-003A-LTLFireability-06
Stuttering criterion allowed to conclude after 312 steps with 2 reset in 2 ms.
FORMULA ShieldIIPs-PT-003A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-003A-LTLFireability-06 finished in 31042 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||G(p1))))'
Support contains 5 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 75/75 transitions.
Applied a total of 0 rules in 1 ms. Remains 78 /78 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2025-06-04 07:30:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:30:17] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-04 07:30:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:30:17] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2025-06-04 07:30:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:30:17] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:30:17] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:30:17] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/187 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:30:18] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:30:18] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:30:18] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 190 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2499 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 74/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:30:24] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/153 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:30:33] [INFO ] Deduced a trap along path composed of 8 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/153 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (OVERLAPS) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 266 constraints, problems are : Problem set: 0 solved, 74 unsolved in 28439 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 30948ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 30948ms
Finished structural reductions in LTL mode , in 1 iterations and 31072 ms. Remains : 78/78 places, 75/75 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-003A-LTLFireability-07
Product exploration explored 100000 steps with 533 reset in 192 ms.
Product exploration explored 100000 steps with 524 reset in 201 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 (NOT p1) p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 99 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
RANDOM walk for 708 steps (2 resets) in 9 ms. (70 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 105 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Support contains 3 out of 78 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 75/75 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 78 transition count 74
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 77 transition count 74
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 76 transition count 73
Applied a total of 4 rules in 12 ms. Remains 76 /78 variables (removed 2) and now considering 73/75 (removed 2) transitions.
// Phase 1: matrix 73 rows 76 cols
[2025-06-04 07:30:48] [INFO ] Computed 28 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:30:49] [INFO ] Implicit Places using invariants in 52 ms returned [62]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/78 places, 73/75 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 67 ms. Remains : 75/78 places, 73/75 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 404 steps (1 resets) in 5 ms. (67 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration explored 100000 steps with 569 reset in 182 ms.
Product exploration explored 100000 steps with 566 reset in 192 ms.
Built C files in :
/tmp/ltsmin5746111138297873711
[2025-06-04 07:30:49] [INFO ] Computing symmetric may disable matrix : 73 transitions.
[2025-06-04 07:30:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 07:30:49] [INFO ] Computing symmetric may enable matrix : 73 transitions.
[2025-06-04 07:30:49] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 07:30:49] [INFO ] Computing Do-Not-Accords matrix : 73 transitions.
[2025-06-04 07:30:49] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 07:30:49] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5746111138297873711
Running compilation step : cd /tmp/ltsmin5746111138297873711;'/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 185 ms.
Running link step : cd /tmp/ltsmin5746111138297873711;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin5746111138297873711;'/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/stateBased17111812220147847984.hoa' '--buchi-type=spotba'
LTSmin run took 140 ms.
FORMULA ShieldIIPs-PT-003A-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPs-PT-003A-LTLFireability-07 finished in 33133 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((p0 U (G(p0)||(X(F(p2))&&p1)))))))'
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 75/75 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 75/75 (removed 0) transitions.
// Phase 1: matrix 75 rows 78 cols
[2025-06-04 07:30:50] [INFO ] Computed 28 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:30:50] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-04 07:30:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:30:50] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2025-06-04 07:30:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:30:50] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:30:50] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:30:50] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/187 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:30:51] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:30:51] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:30:51] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 190 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2467 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 74/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:30:57] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/153 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:31:06] [INFO ] Deduced a trap along path composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/153 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (OVERLAPS) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 266 constraints, problems are : Problem set: 0 solved, 74 unsolved in 28334 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 30808ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 30809ms
Finished structural reductions in LTL mode , in 1 iterations and 30943 ms. Remains : 78/78 places, 75/75 transitions.
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p2), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-003A-LTLFireability-08
Entered a terminal (fully accepting) state of product in 585 steps with 21 reset in 3 ms.
FORMULA ShieldIIPs-PT-003A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-003A-LTLFireability-08 finished in 31179 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(!p0))))'
Support contains 1 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 75/75 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 77 transition count 73
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 75 transition count 73
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 5 place count 74 transition count 72
Applied a total of 5 rules in 10 ms. Remains 74 /78 variables (removed 4) and now considering 72/75 (removed 3) transitions.
// Phase 1: matrix 72 rows 74 cols
[2025-06-04 07:31:21] [INFO ] Computed 27 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:31:21] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-04 07:31:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:31:21] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 07:31:21] [INFO ] Redundant transitions in 19 ms returned [64]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 70 sub problems to find dead transitions.
// Phase 1: matrix 71 rows 74 cols
[2025-06-04 07:31:21] [INFO ] Computed 27 invariants in 0 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 27/101 constraints. Problems are: Problem set: 0 solved, 70 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:31:21] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:31:21] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:31:21] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/145 variables, 74/178 constraints. Problems are: Problem set: 0 solved, 70 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:31:22] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/145 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 179 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1757 ms.
Refiners :[Domain max(s): 74/74 constraints, Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 27/101 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/145 variables, 74/179 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 70/249 constraints. Problems are: Problem set: 0 solved, 70 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:31:23] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/145 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 250 constraints, problems are : Problem set: 0 solved, 70 unsolved in 2464 ms.
Refiners :[Domain max(s): 74/74 constraints, Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4230ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 4230ms
Starting structural reductions in SI_LTL mode, iteration 1 : 74/78 places, 71/75 transitions.
Applied a total of 0 rules in 8 ms. Remains 74 /74 variables (removed 0) and now considering 71/71 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4400 ms. Remains : 74/78 places, 71/75 transitions.
Stuttering acceptance computed with spot in 92 ms :[p0, true, p0]
Running random walk in product with property : ShieldIIPs-PT-003A-LTLFireability-09
Entered a terminal (fully accepting) state of product in 74 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-003A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-003A-LTLFireability-09 finished in 4508 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X((X(p1)||G(p2))))))))'
Support contains 7 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 75/75 transitions.
Applied a total of 0 rules in 1 ms. Remains 78 /78 variables (removed 0) and now considering 75/75 (removed 0) transitions.
// Phase 1: matrix 75 rows 78 cols
[2025-06-04 07:31:25] [INFO ] Computed 28 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:31:25] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-04 07:31:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:31:25] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2025-06-04 07:31:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:31:26] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:31:26] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:31:26] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/187 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:31:27] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:31:27] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:31:27] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 190 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2511 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 74/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:31:33] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/153 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:31:42] [INFO ] Deduced a trap along path composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/153 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (OVERLAPS) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 266 constraints, problems are : Problem set: 0 solved, 74 unsolved in 28758 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 31275ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 31276ms
Finished structural reductions in LTL mode , in 1 iterations and 31404 ms. Remains : 78/78 places, 75/75 transitions.
Stuttering acceptance computed with spot in 324 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-003A-LTLFireability-10
Entered a terminal (fully accepting) state of product in 403 steps with 2 reset in 3 ms.
FORMULA ShieldIIPs-PT-003A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-003A-LTLFireability-10 finished in 31751 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((X(X(F(p0)))||F((G(!p1)||(!p1&&F(!p2)))))))'
Support contains 7 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 75/75 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 78 transition count 74
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 77 transition count 74
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 76 transition count 73
Applied a total of 4 rules in 11 ms. Remains 76 /78 variables (removed 2) and now considering 73/75 (removed 2) transitions.
// Phase 1: matrix 73 rows 76 cols
[2025-06-04 07:31:57] [INFO ] Computed 28 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:31:57] [INFO ] Implicit Places using invariants in 47 ms returned [62]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 48 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/78 places, 73/75 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61 ms. Remains : 75/78 places, 73/75 transitions.
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) p1), (AND p2 p1 (NOT p0)), (AND (NOT p0) p1), (AND p1 p2 (NOT p0)), (AND (NOT p0) p1)]
Running random walk in product with property : ShieldIIPs-PT-003A-LTLFireability-11
Product exploration explored 100000 steps with 2380 reset in 186 ms.
Product exploration explored 100000 steps with 2373 reset in 225 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 (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 130 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0) p2), (AND (NOT p0) p1)]
RANDOM walk for 1123 steps (4 resets) in 13 ms. (80 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p2) p1 p0))), (F p1), (F p2), (F (NOT (OR (NOT p2) (NOT p1) p0))), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 10 factoid took 347 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0) p2), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0) p2), (AND (NOT p0) p1)]
Support contains 7 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 73/73 transitions.
Applied a total of 0 rules in 6 ms. Remains 75 /75 variables (removed 0) and now considering 73/73 (removed 0) transitions.
// Phase 1: matrix 73 rows 75 cols
[2025-06-04 07:31:59] [INFO ] Computed 27 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:31:59] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-04 07:31:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:31:59] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 07:31:59] [INFO ] Redundant transitions in 18 ms returned [65]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 71 sub problems to find dead transitions.
// Phase 1: matrix 72 rows 75 cols
[2025-06-04 07:31:59] [INFO ] Computed 27 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 1/75 variables, 27/101 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:31:59] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:31:59] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:31:59] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 72/147 variables, 75/180 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:32:00] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:32:00] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:32:00] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:32:00] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 4/184 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:32:00] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 0/147 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 185 constraints, problems are : Problem set: 0 solved, 71 unsolved in 2315 ms.
Refiners :[Domain max(s): 75/75 constraints, Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 1/75 variables, 27/101 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 8/110 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 72/147 variables, 75/185 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 71/256 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:32:02] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 0/147 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 257 constraints, problems are : Problem set: 0 solved, 71 unsolved in 4030 ms.
Refiners :[Domain max(s): 75/75 constraints, Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6355ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 6356ms
Starting structural reductions in SI_LTL mode, iteration 1 : 75/75 places, 72/73 transitions.
Applied a total of 0 rules in 6 ms. Remains 75 /75 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6506 ms. Remains : 75/75 places, 72/73 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 p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 131 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1 p2), (AND (NOT p0) p1)]
RANDOM walk for 1181 steps (5 resets) in 10 ms. (107 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p0), (F p1), (F p2), (F (NOT (OR (NOT p2) p0 p1))), (F (NOT (OR (NOT p2) p0 (NOT p1))))]
Knowledge based reduction with 12 factoid took 339 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1 p2), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1 p2), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1 p2), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 1868 reset in 181 ms.
Product exploration explored 100000 steps with 1824 reset in 196 ms.
Built C files in :
/tmp/ltsmin12152837670985113486
[2025-06-04 07:32:07] [INFO ] Computing symmetric may disable matrix : 72 transitions.
[2025-06-04 07:32:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 07:32:07] [INFO ] Computing symmetric may enable matrix : 72 transitions.
[2025-06-04 07:32:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 07:32:07] [INFO ] Computing Do-Not-Accords matrix : 72 transitions.
[2025-06-04 07:32:07] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 07:32:07] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12152837670985113486
Running compilation step : cd /tmp/ltsmin12152837670985113486;'/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 181 ms.
Running link step : cd /tmp/ltsmin12152837670985113486;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin12152837670985113486;'/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/stateBased12559742264900170932.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 72/72 transitions.
Applied a total of 0 rules in 7 ms. Remains 75 /75 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2025-06-04 07:32:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:32:22] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-04 07:32:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:32:22] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 07:32:22] [INFO ] Redundant transitions in 15 ms returned []
Running 71 sub problems to find dead transitions.
[2025-06-04 07:32:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 1/75 variables, 27/101 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:32:22] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:32:22] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:32:22] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 72/147 variables, 75/180 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:32:23] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:32:23] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:32:23] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 3/183 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:32:23] [INFO ] Deduced a trap along path composed of 9 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:32:24] [INFO ] Deduced a trap along path composed of 7 places in 22 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:32:24] [INFO ] Deduced a trap along path composed of 8 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:32:24] [INFO ] Deduced a trap along path composed of 10 places in 22 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 2/187 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/147 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 12 (OVERLAPS) 0/147 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 187 constraints, problems are : Problem set: 0 solved, 71 unsolved in 3393 ms.
Refiners :[Domain max(s): 75/75 constraints, Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 1/75 variables, 27/101 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 6/108 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 72/147 variables, 75/183 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 71/254 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 4/258 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:32:27] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:32:27] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:32:34] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/147 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/147 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 13 (OVERLAPS) 0/147 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 261 constraints, problems are : Problem set: 0 solved, 71 unsolved in 23770 ms.
Refiners :[Domain max(s): 75/75 constraints, Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 27171ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 27171ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 27317 ms. Remains : 75/75 places, 72/72 transitions.
Built C files in :
/tmp/ltsmin11462280763290361701
[2025-06-04 07:32:49] [INFO ] Computing symmetric may disable matrix : 72 transitions.
[2025-06-04 07:32:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 07:32:49] [INFO ] Computing symmetric may enable matrix : 72 transitions.
[2025-06-04 07:32:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 07:32:49] [INFO ] Computing Do-Not-Accords matrix : 72 transitions.
[2025-06-04 07:32:49] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 07:32:49] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11462280763290361701
Running compilation step : cd /tmp/ltsmin11462280763290361701;'/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 177 ms.
Running link step : cd /tmp/ltsmin11462280763290361701;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11462280763290361701;'/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/stateBased679560502244306719.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-04 07:33:04] [INFO ] Flatten gal took : 7 ms
[2025-06-04 07:33:04] [INFO ] Flatten gal took : 6 ms
[2025-06-04 07:33:04] [INFO ] Time to serialize gal into /tmp/LTL1819070988797054407.gal : 2 ms
[2025-06-04 07:33:04] [INFO ] Time to serialize properties into /tmp/LTL1649977362342871610.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1819070988797054407.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5946806628900339834.hoa' '-atoms' '/tmp/LTL1649977362342871610.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL1649977362342871610.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5946806628900339834.hoa
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t17, t18, t19, t20, t30, t41...398
Computing Next relation with stutter on 412 deadlock states
Detected timeout of ITS tools.
[2025-06-04 07:33:19] [INFO ] Flatten gal took : 6 ms
[2025-06-04 07:33:19] [INFO ] Flatten gal took : 6 ms
[2025-06-04 07:33:19] [INFO ] Time to serialize gal into /tmp/LTL2713083932923337870.gal : 1 ms
[2025-06-04 07:33:19] [INFO ] Time to serialize properties into /tmp/LTL11571960329508242959.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2713083932923337870.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11571960329508242959.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((X(X(F("(((p38==1)&&(p48==1))&&(p50==1))"))))||(F((G("((p33==0)||(p48==0))"))||(("((p33==0)||(p48==0))")&&(F("(((p11==0)||(p17==0...177
Formula 0 simplified : F(XXG!"(((p38==1)&&(p48==1))&&(p50==1))" & G(F!"((p33==0)||(p48==0))" & (!"((p33==0)||(p48==0))" | G!"(((p11==0)||(p17==0))||(p27==0...161
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t17, t18, t19, t20, t30, t41...398
Computing Next relation with stutter on 412 deadlock states
Detected timeout of ITS tools.
[2025-06-04 07:33:34] [INFO ] Flatten gal took : 9 ms
[2025-06-04 07:33:34] [INFO ] Applying decomposition
[2025-06-04 07:33:34] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3103764168348840421.txt' '-o' '/tmp/graph3103764168348840421.bin' '-w' '/tmp/graph3103764168348840421.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3103764168348840421.bin' '-l' '-1' '-v' '-w' '/tmp/graph3103764168348840421.weights' '-q' '0' '-e' '0.001'
[2025-06-04 07:33:34] [INFO ] Decomposing Gal with order
[2025-06-04 07:33:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 07:33:34] [INFO ] Removed a total of 43 redundant transitions.
[2025-06-04 07:33:34] [INFO ] Flatten gal took : 36 ms
[2025-06-04 07:33:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 6 ms.
[2025-06-04 07:33:34] [INFO ] Time to serialize gal into /tmp/LTL13690743345668125605.gal : 2 ms
[2025-06-04 07:33:34] [INFO ] Time to serialize properties into /tmp/LTL2978070272139213682.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13690743345668125605.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2978070272139213682.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((X(X(F("(((i5.u14.p38==1)&&(i5.u17.p48==1))&&(i5.u18.p50==1))"))))||(F((G("((i5.u12.p33==0)||(i5.u17.p48==0))"))||(("((i5.u12.p33...250
Formula 0 simplified : F(XXG!"(((i5.u14.p38==1)&&(i5.u17.p48==1))&&(i5.u18.p50==1))" & G(F!"((i5.u12.p33==0)||(i5.u17.p48==0))" & (!"((i5.u12.p33==0)||(i5....234
Reverse transition relation is NOT exact ! Due to transitions t0, t7, t14, t39, t57, t71, i1.t63, i1.u6.t1, i1.u6.t2, i2.t73, i2.i0.u9.t5, i2.i0.u9.t6, i2....526
Computing Next relation with stutter on 412 deadlock states
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-003A-LTLFireability-11 finished in 112392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(p1&&G(p2)))))'
Support contains 6 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 75/75 transitions.
Applied a total of 0 rules in 1 ms. Remains 78 /78 variables (removed 0) and now considering 75/75 (removed 0) transitions.
// Phase 1: matrix 75 rows 78 cols
[2025-06-04 07:33:50] [INFO ] Computed 28 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:33:50] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-04 07:33:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:33:50] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2025-06-04 07:33:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:33:50] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:33:50] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:33:50] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/187 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:33:51] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:33:51] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:33:51] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 190 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2426 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 74/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:33:57] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 7 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/153 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:34:06] [INFO ] Deduced a trap along path composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/153 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (OVERLAPS) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 266 constraints, problems are : Problem set: 0 solved, 74 unsolved in 27768 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 30201ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 30202ms
Finished structural reductions in LTL mode , in 1 iterations and 30333 ms. Remains : 78/78 places, 75/75 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-003A-LTLFireability-14
Product exploration explored 100000 steps with 3137 reset in 171 ms.
Product exploration explored 100000 steps with 3091 reset in 183 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 (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 122 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 139 steps (0 resets) in 4 ms. (27 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 10 factoid took 146 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2025-06-04 07:34:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-04 07:34:21] [INFO ] [Real]Absence check using 28 positive place invariants in 5 ms returned sat
[2025-06-04 07:34:21] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2025-06-04 07:34:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-04 07:34:21] [INFO ] [Nat]Absence check using 28 positive place invariants in 6 ms returned sat
[2025-06-04 07:34:21] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2025-06-04 07:34:21] [INFO ] Computed and/alt/rep : 70/251/70 causal constraints (skipped 4 transitions) in 6 ms.
[2025-06-04 07:34:21] [INFO ] Added : 59 causal constraints over 12 iterations in 155 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 78 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 75/75 transitions.
Applied a total of 0 rules in 0 ms. Remains 78 /78 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2025-06-04 07:34:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:34:21] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-04 07:34:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:34:21] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2025-06-04 07:34:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:34:22] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:34:22] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:34:22] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/187 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:34:23] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:34:23] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:34:23] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 190 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2503 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 74/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:34:29] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/153 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:34:38] [INFO ] Deduced a trap along path composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/153 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (OVERLAPS) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 266 constraints, problems are : Problem set: 0 solved, 74 unsolved in 28464 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 30975ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 30976ms
Finished structural reductions in LTL mode , in 1 iterations and 31093 ms. Remains : 78/78 places, 75/75 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 93 steps (0 resets) in 4 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2025-06-04 07:34:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-04 07:34:53] [INFO ] [Real]Absence check using 28 positive place invariants in 5 ms returned sat
[2025-06-04 07:34:53] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-06-04 07:34:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-04 07:34:53] [INFO ] [Nat]Absence check using 28 positive place invariants in 7 ms returned sat
[2025-06-04 07:34:53] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2025-06-04 07:34:53] [INFO ] Computed and/alt/rep : 70/251/70 causal constraints (skipped 4 transitions) in 7 ms.
[2025-06-04 07:34:53] [INFO ] Added : 59 causal constraints over 12 iterations in 148 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3127 reset in 159 ms.
Product exploration explored 100000 steps with 3127 reset in 176 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 75/75 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 78 transition count 75
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 7 ms. Remains 78 /78 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 07:34:54] [INFO ] Redundant transitions in 18 ms returned [67]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 73 sub problems to find dead transitions.
// Phase 1: matrix 74 rows 78 cols
[2025-06-04 07:34:54] [INFO ] Computed 28 invariants in 1 ms
[2025-06-04 07:34:54] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:34:55] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:34:55] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:34:55] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:34:55] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 2 ms to minimize.
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:34:55] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 2 ms to minimize.
Problem TDEAD20 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 5/111 constraints. Problems are: Problem set: 2 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/111 constraints. Problems are: Problem set: 2 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 74/152 variables, 78/189 constraints. Problems are: Problem set: 2 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 3/192 constraints. Problems are: Problem set: 2 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 0/192 constraints. Problems are: Problem set: 2 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:34:55] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 3 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/152 variables, 1/193 constraints. Problems are: Problem set: 2 solved, 71 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 0/193 constraints. Problems are: Problem set: 2 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:34:56] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:34:56] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/152 variables, 2/195 constraints. Problems are: Problem set: 2 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:34:56] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/152 variables, 1/196 constraints. Problems are: Problem set: 2 solved, 71 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/152 variables, 0/196 constraints. Problems are: Problem set: 2 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:34:57] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 2 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/152 variables, 1/197 constraints. Problems are: Problem set: 2 solved, 71 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/152 variables, 0/197 constraints. Problems are: Problem set: 2 solved, 71 unsolved
At refinement iteration 16 (OVERLAPS) 0/152 variables, 0/197 constraints. Problems are: Problem set: 2 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 197 constraints, problems are : Problem set: 2 solved, 71 unsolved in 3181 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 71 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 75/75 constraints. Problems are: Problem set: 2 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/75 constraints. Problems are: Problem set: 2 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 3/78 variables, 28/103 constraints. Problems are: Problem set: 2 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 3/106 constraints. Problems are: Problem set: 2 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 10/116 constraints. Problems are: Problem set: 2 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/116 constraints. Problems are: Problem set: 2 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 74/152 variables, 78/194 constraints. Problems are: Problem set: 2 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 3/197 constraints. Problems are: Problem set: 2 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 71/268 constraints. Problems are: Problem set: 2 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 0/268 constraints. Problems are: Problem set: 2 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 0/152 variables, 0/268 constraints. Problems are: Problem set: 2 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 268 constraints, problems are : Problem set: 2 solved, 71 unsolved in 3511 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 71/73 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6699ms problems are : Problem set: 2 solved, 71 unsolved
Search for dead transitions found 2 dead transitions in 6699ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 78/78 places, 72/75 transitions.
Graph (complete) has 263 edges and 78 vertex of which 76 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 76 /78 variables (removed 2) and now considering 72/72 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 76/78 places, 72/75 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6737 ms. Remains : 76/78 places, 72/75 transitions.
Built C files in :
/tmp/ltsmin1941037291389167321
[2025-06-04 07:35:01] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1941037291389167321
Running compilation step : cd /tmp/ltsmin1941037291389167321;'/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 163 ms.
Running link step : cd /tmp/ltsmin1941037291389167321;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin1941037291389167321;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1246925527674662508.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 75/75 transitions.
Applied a total of 0 rules in 1 ms. Remains 78 /78 variables (removed 0) and now considering 75/75 (removed 0) transitions.
// Phase 1: matrix 75 rows 78 cols
[2025-06-04 07:35:16] [INFO ] Computed 28 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:35:16] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-04 07:35:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:35:16] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2025-06-04 07:35:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:35:17] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:35:17] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:35:17] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/187 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:35:17] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:35:17] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:35:17] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 190 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2470 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 74/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:35:23] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/153 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:35:32] [INFO ] Deduced a trap along path composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/153 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (OVERLAPS) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 266 constraints, problems are : Problem set: 0 solved, 74 unsolved in 28406 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 30883ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 30883ms
Finished structural reductions in LTL mode , in 1 iterations and 30997 ms. Remains : 78/78 places, 75/75 transitions.
Built C files in :
/tmp/ltsmin8755937370546895244
[2025-06-04 07:35:47] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8755937370546895244
Running compilation step : cd /tmp/ltsmin8755937370546895244;'/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 170 ms.
Running link step : cd /tmp/ltsmin8755937370546895244;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin8755937370546895244;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6799400217909476214.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-04 07:36:02] [INFO ] Flatten gal took : 5 ms
[2025-06-04 07:36:02] [INFO ] Flatten gal took : 5 ms
[2025-06-04 07:36:02] [INFO ] Time to serialize gal into /tmp/LTL11348510309371312972.gal : 2 ms
[2025-06-04 07:36:02] [INFO ] Time to serialize properties into /tmp/LTL9679970480430525376.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11348510309371312972.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3559134298342415334.hoa' '-atoms' '/tmp/LTL9679970480430525376.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9679970480430525376.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3559134298342415334.hoa
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...380
Computing Next relation with stutter on 412 deadlock states
Detected timeout of ITS tools.
[2025-06-04 07:36:17] [INFO ] Flatten gal took : 5 ms
[2025-06-04 07:36:17] [INFO ] Flatten gal took : 5 ms
[2025-06-04 07:36:17] [INFO ] Time to serialize gal into /tmp/LTL16446595520152259001.gal : 2 ms
[2025-06-04 07:36:17] [INFO ] Time to serialize properties into /tmp/LTL17405695485300397516.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16446595520152259001.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17405695485300397516.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((F("(((p8==1)&&(p22==1))||((p1==1)&&(p20==1)))"))||((G("((p8==1)&&(p22==1))"))&&("((p57==0)||(p59==0))")))))
Formula 0 simplified : X(G!"(((p8==1)&&(p22==1))||((p1==1)&&(p20==1)))" & (!"((p57==0)||(p59==0))" | F!"((p8==1)&&(p22==1))"))
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...380
Computing Next relation with stutter on 412 deadlock states
Detected timeout of ITS tools.
[2025-06-04 07:36:32] [INFO ] Flatten gal took : 8 ms
[2025-06-04 07:36:32] [INFO ] Applying decomposition
[2025-06-04 07:36:32] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2683728803681907234.txt' '-o' '/tmp/graph2683728803681907234.bin' '-w' '/tmp/graph2683728803681907234.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2683728803681907234.bin' '-l' '-1' '-v' '-w' '/tmp/graph2683728803681907234.weights' '-q' '0' '-e' '0.001'
[2025-06-04 07:36:32] [INFO ] Decomposing Gal with order
[2025-06-04 07:36:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 07:36:32] [INFO ] Removed a total of 48 redundant transitions.
[2025-06-04 07:36:32] [INFO ] Flatten gal took : 9 ms
[2025-06-04 07:36:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 2 ms.
[2025-06-04 07:36:32] [INFO ] Time to serialize gal into /tmp/LTL12032377259011207484.gal : 1 ms
[2025-06-04 07:36:32] [INFO ] Time to serialize properties into /tmp/LTL1535649360973372325.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12032377259011207484.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1535649360973372325.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((F("(((i2.u3.p8==1)&&(i2.u8.p22==1))||((i2.u0.p1==1)&&(i2.u8.p20==1)))"))||((G("((i2.u3.p8==1)&&(i2.u8.p22==1))"))&&("((i7.u20.p5...184
Formula 0 simplified : X(G!"(((i2.u3.p8==1)&&(i2.u8.p22==1))||((i2.u0.p1==1)&&(i2.u8.p20==1)))" & (!"((i7.u20.p57==0)||(i6.u21.p59==0))" | F!"((i2.u3.p8==1...176
Reverse transition relation is NOT exact ! Due to transitions t0, t7, t14, t42, t57, t73, i1.t72, i1.t63, i1.u6.t1, i1.u6.t2, i1.u9.t5, i1.u9.t6, i2.t60, i...474
Computing Next relation with stutter on 412 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
771 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.73451,121132,1,0,197331,168,868,478582,128,464,133916
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldIIPs-PT-003A-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldIIPs-PT-003A-LTLFireability-14 finished in 170919 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 X((!p1||F((G(!p1)||G(!p0))))))))'
Support contains 6 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 75/75 transitions.
Applied a total of 0 rules in 1 ms. Remains 78 /78 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2025-06-04 07:36:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:36:40] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-04 07:36:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:36:41] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2025-06-04 07:36:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:36:41] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:36:41] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:36:41] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/187 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:36:42] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:36:42] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:36:42] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 190 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2416 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 74/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:36:47] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/153 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:36:57] [INFO ] Deduced a trap along path composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/153 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (OVERLAPS) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 266 constraints, problems are : Problem set: 0 solved, 74 unsolved in 28289 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 30713ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 30713ms
Finished structural reductions in LTL mode , in 1 iterations and 30834 ms. Remains : 78/78 places, 75/75 transitions.
Stuttering acceptance computed with spot in 191 ms :[(AND p0 p1), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1)]
Running random walk in product with property : ShieldIIPs-PT-003A-LTLFireability-15
Product exploration explored 100000 steps with 33333 reset in 130 ms.
Product exploration explored 100000 steps with 33333 reset in 139 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 (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 16 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-003A-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-003A-LTLFireability-15 finished in 31335 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((X(X(F(p0)))||F((G(!p1)||(!p1&&F(!p2)))))))'
[2025-06-04 07:37:12] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2274677279558140136
[2025-06-04 07:37:12] [INFO ] Computing symmetric may disable matrix : 75 transitions.
[2025-06-04 07:37:12] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 07:37:12] [INFO ] Computing symmetric may enable matrix : 75 transitions.
[2025-06-04 07:37:12] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 07:37:12] [INFO ] Applying decomposition
[2025-06-04 07:37:12] [INFO ] Computing Do-Not-Accords matrix : 75 transitions.
[2025-06-04 07:37:12] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 07:37:12] [INFO ] Flatten gal took : 4 ms
[2025-06-04 07:37:12] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2274677279558140136
Running compilation step : cd /tmp/ltsmin2274677279558140136;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13628823057193145870.txt' '-o' '/tmp/graph13628823057193145870.bin' '-w' '/tmp/graph13628823057193145870.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13628823057193145870.bin' '-l' '-1' '-v' '-w' '/tmp/graph13628823057193145870.weights' '-q' '0' '-e' '0.001'
[2025-06-04 07:37:12] [INFO ] Decomposing Gal with order
[2025-06-04 07:37:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 07:37:12] [INFO ] Removed a total of 48 redundant transitions.
[2025-06-04 07:37:12] [INFO ] Flatten gal took : 15 ms
[2025-06-04 07:37:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 7 ms.
[2025-06-04 07:37:12] [INFO ] Time to serialize gal into /tmp/LTLFireability14473468890887166022.gal : 1 ms
[2025-06-04 07:37:12] [INFO ] Time to serialize properties into /tmp/LTLFireability3732396857777980453.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14473468890887166022.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3732396857777980453.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((X(X(F("(((i3.u14.p38==1)&&(i3.u17.p48==1))&&(i3.u18.p50==1))"))))||(F((G(!("((i3.u12.p33==1)&&(i3.u17.p48==1))")))||((!("((i3.u1...253
Formula 0 simplified : F(XXG!"(((i3.u14.p38==1)&&(i3.u17.p48==1))&&(i3.u18.p50==1))" & G(F"((i3.u12.p33==1)&&(i3.u17.p48==1))" & ("((i3.u12.p33==1)&&(i3.u1...225
Compilation finished in 176 ms.
Running link step : cd /tmp/ltsmin2274677279558140136;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin2274677279558140136;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X(X(<>((LTLAPp0==true))))||<>(([](!(LTLAPp1==true))||(!(LTLAPp1==true)&&<>(!(LTLAPp2==true)))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t7, t14, t40, t55, t72, i0.t63, i0.u6.t1, i0.u6.t2, i2.t73, i2.t60, i2.u8.t3, i2.u8.t4, i...474
Computing Next relation with stutter on 412 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: LTL layer: formula: []((X(X(<>((LTLAPp0==true))))||<>(([](!(LTLAPp1==true))||(!(LTLAPp1==true)&&<>(!(LTLAPp2==true)))))))
pins2lts-mc-linux64( 0/ 8), 0.002: "[]((X(X(<>((LTLAPp0==true))))||<>(([](!(LTLAPp1==true))||(!(LTLAPp1==true)&&<>(!(LTLAPp2==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.018: buchi has 6 states
pins2lts-mc-linux64( 0/ 8), 0.064: There are 79 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.064: State length is 79, there are 87 groups
pins2lts-mc-linux64( 0/ 8), 0.064: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.064: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.064: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.064: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.145: [Blue] ~70 levels ~960 states ~2840 transitions
pins2lts-mc-linux64( 7/ 8), 0.153: [Blue] ~66 levels ~1920 states ~4080 transitions
pins2lts-mc-linux64( 7/ 8), 0.172: [Blue] ~66 levels ~3840 states ~6696 transitions
pins2lts-mc-linux64( 7/ 8), 0.216: [Blue] ~66 levels ~7680 states ~12576 transitions
pins2lts-mc-linux64( 0/ 8), 0.330: [Blue] ~103 levels ~15360 states ~23856 transitions
pins2lts-mc-linux64( 7/ 8), 0.523: [Blue] ~90 levels ~30720 states ~51600 transitions
pins2lts-mc-linux64( 7/ 8), 0.695: [Blue] ~90 levels ~61440 states ~113456 transitions
pins2lts-mc-linux64( 7/ 8), 1.039: [Blue] ~90 levels ~122880 states ~247896 transitions
pins2lts-mc-linux64( 0/ 8), 1.562: [Blue] ~103 levels ~245760 states ~462992 transitions
pins2lts-mc-linux64( 0/ 8), 2.386: [Blue] ~103 levels ~491520 states ~963472 transitions
pins2lts-mc-linux64( 5/ 8), 3.430: [Blue] ~119 levels ~983040 states ~1859000 transitions
pins2lts-mc-linux64( 5/ 8), 5.194: [Blue] ~119 levels ~1966080 states ~3929224 transitions
pins2lts-mc-linux64( 5/ 8), 8.453: [Blue] ~127 levels ~3932160 states ~8167912 transitions
pins2lts-mc-linux64( 5/ 8), 15.046: [Blue] ~127 levels ~7864320 states ~16802136 transitions
pins2lts-mc-linux64( 4/ 8), 28.030: [Blue] ~121 levels ~15728640 states ~35568824 transitions
pins2lts-mc-linux64( 4/ 8), 53.763: [Blue] ~124 levels ~31457280 states ~71675592 transitions
pins2lts-mc-linux64( 4/ 8), 106.262: [Blue] ~124 levels ~62914560 states ~155730056 transitions
pins2lts-mc-linux64( 4/ 8), 216.970: [Blue] ~124 levels ~125829120 states ~335636864 transitions
pins2lts-mc-linux64( 4/ 8), 291.509: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 291.553:
pins2lts-mc-linux64( 0/ 8), 291.553: Explored 134141465 states 574620939 transitions, fanout: 4.284
pins2lts-mc-linux64( 0/ 8), 291.553: Total exploration time 291.480 sec (291.420 sec minimum, 291.446 sec on average)
pins2lts-mc-linux64( 0/ 8), 291.553: States per second: 460208, Transitions per second: 1971390
pins2lts-mc-linux64( 0/ 8), 291.553:
pins2lts-mc-linux64( 0/ 8), 291.553: State space has 134217345 states, 7656459 are accepting
pins2lts-mc-linux64( 0/ 8), 291.553: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 291.553: blue states: 134141465 (99.94%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 291.553: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 291.553: all-red states: 95686382 (71.29%), bogus 79686 (0.06%)
pins2lts-mc-linux64( 0/ 8), 291.553:
pins2lts-mc-linux64( 0/ 8), 291.553: Total memory used for local state coloring: 14.4MB
pins2lts-mc-linux64( 0/ 8), 291.553:
pins2lts-mc-linux64( 0/ 8), 291.553: Queue width: 8B, total height: 941877, memory: 7.19MB
pins2lts-mc-linux64( 0/ 8), 291.553: Tree memory: 1039.1MB, 8.1 B/state, compr.: 2.6%
pins2lts-mc-linux64( 0/ 8), 291.553: Tree fill ratio (roots/leafs): 99.0%/5.0%
pins2lts-mc-linux64( 0/ 8), 291.553: Stored 75 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 291.553: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 291.553: Est. total memory use: 1046.3MB (~1031.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2274677279558140136;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X(X(<>((LTLAPp0==true))))||<>(([](!(LTLAPp1==true))||(!(LTLAPp1==true)&&<>(!(LTLAPp2==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2274677279558140136;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X(X(<>((LTLAPp0==true))))||<>(([](!(LTLAPp1==true))||(!(LTLAPp1==true)&&<>(!(LTLAPp2==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-04 08:00:35] [INFO ] Applying decomposition
[2025-06-04 08:00:35] [INFO ] Flatten gal took : 133 ms
[2025-06-04 08:00:35] [INFO ] Decomposing Gal with order
[2025-06-04 08:00:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 08:00:35] [INFO ] Removed a total of 51 redundant transitions.
[2025-06-04 08:00:35] [INFO ] Flatten gal took : 114 ms
[2025-06-04 08:00:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 27 ms.
[2025-06-04 08:00:35] [INFO ] Time to serialize gal into /tmp/LTLFireability5749399115546378153.gal : 53 ms
[2025-06-04 08:00:35] [INFO ] Time to serialize properties into /tmp/LTLFireability4869557551628060630.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5749399115546378153.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4869557551628060630.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((X(X(F("(((u17.p38==1)&&(u20.p48==1))&&(u21.p50==1))"))))||(F((G(!("((i10.u15.p33==1)&&(u20.p48==1))")))||((!("((i10.u15.p33==1)&...232
Formula 0 simplified : F(XXG!"(((u17.p38==1)&&(u20.p48==1))&&(u21.p50==1))" & G(F"((i10.u15.p33==1)&&(u20.p48==1))" & ("((i10.u15.p33==1)&&(u20.p48==1))" |...204
Reverse transition relation is NOT exact ! Due to transitions t31, t33, t39, t44, t45, t48, t52, t55, t61, t63, t67, t70, u8.t1, u8.t2, u10.t3, u10.t4, u11...405
Computing Next relation with stutter on 412 deadlock states
Detected timeout of ITS tools.
[2025-06-04 08:23:59] [INFO ] Flatten gal took : 167 ms
[2025-06-04 08:24:00] [INFO ] Input system was already deterministic with 75 transitions.
[2025-06-04 08:24:00] [INFO ] Transformed 78 places.
[2025-06-04 08:24:00] [INFO ] Transformed 75 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-04 08:24:00] [INFO ] Time to serialize gal into /tmp/LTLFireability11182283587205094547.gal : 4 ms
[2025-06-04 08:24:00] [INFO ] Time to serialize properties into /tmp/LTLFireability1115399248183903888.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11182283587205094547.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1115399248183903888.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((X(X(F("(((p38==1)&&(p48==1))&&(p50==1))"))))||(F((G(!("((p33==1)&&(p48==1))")))||((!("((p33==1)&&(p48==1))"))&&(F(!("(((p11==1)&...186
Formula 0 simplified : F(XXG!"(((p38==1)&&(p48==1))&&(p50==1))" & G(F"((p33==1)&&(p48==1))" & ("((p33==1)&&(p48==1))" | G"(((p11==1)&&(p17==1))&&(p27==1))"...158
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...380
Computing Next relation with stutter on 412 deadlock states
BK_TIME_CONFINEMENT_REACHED
--------------------
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="ShieldIIPs-PT-003A"
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 ShieldIIPs-PT-003A, 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-174894532400284"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-003A.tgz
mv ShieldIIPs-PT-003A 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 '
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 ;