Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K 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 34K 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-004A-LTLCardinality-00
FORMULA_NAME ShieldIIPs-PT-004A-LTLCardinality-01
FORMULA_NAME ShieldIIPs-PT-004A-LTLCardinality-02
FORMULA_NAME ShieldIIPs-PT-004A-LTLCardinality-03
FORMULA_NAME ShieldIIPs-PT-004A-LTLCardinality-04
FORMULA_NAME ShieldIIPs-PT-004A-LTLCardinality-05
FORMULA_NAME ShieldIIPs-PT-004A-LTLCardinality-06
FORMULA_NAME ShieldIIPs-PT-004A-LTLCardinality-07
FORMULA_NAME ShieldIIPs-PT-004A-LTLCardinality-08
FORMULA_NAME ShieldIIPs-PT-004A-LTLCardinality-09
FORMULA_NAME ShieldIIPs-PT-004A-LTLCardinality-10
FORMULA_NAME ShieldIIPs-PT-004A-LTLCardinality-11
FORMULA_NAME ShieldIIPs-PT-004A-LTLCardinality-12
FORMULA_NAME ShieldIIPs-PT-004A-LTLCardinality-13
FORMULA_NAME ShieldIIPs-PT-004A-LTLCardinality-14
FORMULA_NAME ShieldIIPs-PT-004A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749027244807

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-004A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-04 08:54:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-04 08:54:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 08:54:06] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2025-06-04 08:54:06] [INFO ] Transformed 103 places.
[2025-06-04 08:54:06] [INFO ] Transformed 99 transitions.
[2025-06-04 08:54:06] [INFO ] Found NUPN structural information;
[2025-06-04 08:54:06] [INFO ] Parsed PT model containing 103 places and 99 transitions and 438 arcs in 139 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA ShieldIIPs-PT-004A-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-004A-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-004A-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-004A-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-004A-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-004A-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-004A-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 9 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
// Phase 1: matrix 99 rows 103 cols
[2025-06-04 08:54:06] [INFO ] Computed 37 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 08:54:06] [INFO ] Implicit Places using invariants in 225 ms returned []
[2025-06-04 08:54:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 08:54:06] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2025-06-04 08:54: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/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:54:07] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:54:07] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:54:08] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:54:08] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:54:09] [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 08:54:09] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:54:09] [INFO ] Deduced a trap composed of 9 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 08:54:09] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:54:09] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 3/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:54:10] [INFO ] Deduced a trap along path composed of 8 places in 35 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (OVERLAPS) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 253 constraints, problems are : Problem set: 0 solved, 98 unsolved in 5806 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 9/149 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 98/350 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 0/202 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 351 constraints, problems are : Problem set: 0 solved, 98 unsolved in 6699 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 12563ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 12574ms
Finished structural reductions in LTL mode , in 1 iterations and 12996 ms. Remains : 103/103 places, 99/99 transitions.
Support contains 24 out of 103 places after structural reductions.
[2025-06-04 08:54:19] [INFO ] Flatten gal took : 31 ms
[2025-06-04 08:54:19] [INFO ] Flatten gal took : 13 ms
[2025-06-04 08:54:19] [INFO ] Input system was already deterministic with 99 transitions.
Support contains 22 out of 103 places (down from 24) after GAL structural reductions.
RANDOM walk for 1641 steps (5 resets) in 78 ms. (20 steps per ms) remains 0/16 properties
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' '!(X((F(p1)||p0)))'
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2025-06-04 08:54:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 08:54:19] [INFO ] Implicit Places using invariants in 98 ms returned []
[2025-06-04 08:54:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 08:54:20] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2025-06-04 08:54:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:54:21] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:54:21] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:54:21] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:54:21] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:54:22] [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 08:54:22] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:54:22] [INFO ] Deduced a trap composed of 9 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 08:54:22] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:54:22] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 3/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:54:23] [INFO ] Deduced a trap along path composed of 8 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (OVERLAPS) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 253 constraints, problems are : Problem set: 0 solved, 98 unsolved in 5031 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 9/149 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 98/350 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 0/202 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 351 constraints, problems are : Problem set: 0 solved, 98 unsolved in 6641 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 11696ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 11699ms
Finished structural reductions in LTL mode , in 1 iterations and 12049 ms. Remains : 103/103 places, 99/99 transitions.
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 342 ms.
Product exploration explored 100000 steps with 50000 reset in 220 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 (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 20 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-004A-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-004A-LTLCardinality-02 finished in 12954 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)&&F(p1)))'
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 6 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2025-06-04 08:54:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 08:54:32] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-04 08:54:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 08:54:32] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2025-06-04 08:54:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:54:33] [INFO ] Deduced a trap composed of 15 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 08:54:33] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:54:33] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:54:34] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:54:34] [INFO ] Deduced a trap composed of 9 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 08:54:34] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:54:35] [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 08:54:35] [INFO ] Deduced a trap composed of 9 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 08:54:35] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 3/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:54:35] [INFO ] Deduced a trap along path composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (OVERLAPS) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 253 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4913 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 9/149 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 98/350 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 0/202 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 351 constraints, problems are : Problem set: 0 solved, 98 unsolved in 6583 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 11510ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 11511ms
Finished structural reductions in LTL mode , in 1 iterations and 11691 ms. Remains : 103/103 places, 99/99 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-004A-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004A-LTLCardinality-03 finished in 11848 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 99/99 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 103 transition count 98
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 102 transition count 98
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 101 transition count 97
Applied a total of 4 rules in 27 ms. Remains 101 /103 variables (removed 2) and now considering 97/99 (removed 2) transitions.
// Phase 1: matrix 97 rows 101 cols
[2025-06-04 08:54:44] [INFO ] Computed 37 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 08:54:44] [INFO ] Implicit Places using invariants in 67 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/103 places, 97/99 transitions.
Applied a total of 0 rules in 8 ms. Remains 100 /100 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 106 ms. Remains : 100/103 places, 97/99 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLCardinality-04
Stuttering criterion allowed to conclude after 234 steps with 0 reset in 4 ms.
FORMULA ShieldIIPs-PT-004A-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004A-LTLCardinality-04 finished in 235 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 99/99 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 103 transition count 98
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 102 transition count 98
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 101 transition count 97
Applied a total of 4 rules in 14 ms. Remains 101 /103 variables (removed 2) and now considering 97/99 (removed 2) transitions.
[2025-06-04 08:54:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 08:54:44] [INFO ] Implicit Places using invariants in 61 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/103 places, 97/99 transitions.
Applied a total of 0 rules in 5 ms. Remains 100 /100 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 82 ms. Remains : 100/103 places, 97/99 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLCardinality-05
Stuttering criterion allowed to conclude after 4172 steps with 17 reset in 24 ms.
FORMULA ShieldIIPs-PT-004A-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004A-LTLCardinality-05 finished in 158 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
// Phase 1: matrix 99 rows 103 cols
[2025-06-04 08:54:44] [INFO ] Computed 37 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 08:54:45] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-04 08:54:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 08:54:45] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2025-06-04 08:54:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:54:45] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:54:45] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:54:46] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:54:46] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:54:46] [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 08:54:46] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:54:47] [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 08:54:47] [INFO ] Deduced a trap composed of 9 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 08:54:47] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 3/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:54:48] [INFO ] Deduced a trap along path composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (OVERLAPS) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 253 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4834 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 9/149 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 98/350 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 0/202 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 351 constraints, problems are : Problem set: 0 solved, 98 unsolved in 6524 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 11375ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 11376ms
Finished structural reductions in LTL mode , in 1 iterations and 11546 ms. Remains : 103/103 places, 99/99 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 144 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-004A-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004A-LTLCardinality-06 finished in 11704 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 99/99 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 102 transition count 97
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 100 transition count 97
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 99 transition count 96
Applied a total of 5 rules in 17 ms. Remains 99 /103 variables (removed 4) and now considering 96/99 (removed 3) transitions.
// Phase 1: matrix 96 rows 99 cols
[2025-06-04 08:54:56] [INFO ] Computed 36 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 08:54:56] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-04 08:54:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 08:54:56] [INFO ] Implicit Places using invariants and state equation in 97 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 08:54:56] [INFO ] Redundant transitions in 26 ms returned [90]
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 94 sub problems to find dead transitions.
// Phase 1: matrix 95 rows 99 cols
[2025-06-04 08:54:56] [INFO ] Computed 36 invariants in 0 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 36/135 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:54:57] [INFO ] Deduced a trap composed of 14 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 08:54:57] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:54:57] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:54:57] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 95/194 variables, 99/238 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:54:58] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:54:58] [INFO ] Deduced a trap composed of 8 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 08:54:58] [INFO ] Deduced a trap composed of 8 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 08:54:58] [INFO ] Deduced a trap composed of 13 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 08:54:58] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:54:58] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 5/244 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 0/194 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 244 constraints, problems are : Problem set: 0 solved, 94 unsolved in 3511 ms.
Refiners :[Domain max(s): 99/99 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 36/135 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 10/145 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 95/194 variables, 99/244 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 94/338 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:55:01] [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 08:55:01] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:55:01] [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 08:55:01] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (OVERLAPS) 0/194 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 342 constraints, problems are : Problem set: 0 solved, 94 unsolved in 4817 ms.
Refiners :[Domain max(s): 99/99 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8337ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 8338ms
Starting structural reductions in SI_LTL mode, iteration 1 : 99/103 places, 95/99 transitions.
Applied a total of 0 rules in 12 ms. Remains 99 /99 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8569 ms. Remains : 99/103 places, 95/99 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLCardinality-07
Product exploration explored 100000 steps with 5637 reset in 172 ms.
Product exploration explored 100000 steps with 5682 reset in 250 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 52 steps (0 resets) in 9 ms. (5 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 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
[2025-06-04 08:55:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-04 08:55:06] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2025-06-04 08:55:06] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2025-06-04 08:55:06] [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 08:55:06] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2025-06-04 08:55:06] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2025-06-04 08:55:06] [INFO ] Computed and/alt/rep : 94/227/94 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-04 08:55:06] [INFO ] Added : 93 causal constraints over 19 iterations in 372 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 95/95 transitions.
Applied a total of 0 rules in 5 ms. Remains 99 /99 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2025-06-04 08:55:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 08:55:06] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-04 08:55:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 08:55:07] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 08:55:07] [INFO ] Redundant transitions in 21 ms returned []
Running 94 sub problems to find dead transitions.
[2025-06-04 08:55:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 36/135 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:55:07] [INFO ] Deduced a trap composed of 14 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 08:55:07] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:55:07] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:55:07] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 95/194 variables, 99/238 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:55:08] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:55:08] [INFO ] Deduced a trap along path composed of 9 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:55:09] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:55:09] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:55:09] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:55:10] [INFO ] Deduced a trap composed of 8 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 08:55:10] [INFO ] Deduced a trap composed of 8 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 08:55:10] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:55:10] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 4/247 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (OVERLAPS) 0/194 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 247 constraints, problems are : Problem set: 0 solved, 94 unsolved in 4850 ms.
Refiners :[Domain max(s): 99/99 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 36/135 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 12/147 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 95/194 variables, 99/246 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 94/340 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 0/194 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 341 constraints, problems are : Problem set: 0 solved, 94 unsolved in 4354 ms.
Refiners :[Domain max(s): 99/99 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 9244ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 9245ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9429 ms. Remains : 99/99 places, 95/95 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 81 steps (0 resets) in 4 ms. (16 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 126 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
[2025-06-04 08:55:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-04 08:55:16] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2025-06-04 08:55:16] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2025-06-04 08:55:16] [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 08:55:16] [INFO ] [Nat]Absence check using 36 positive place invariants in 12 ms returned sat
[2025-06-04 08:55:16] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2025-06-04 08:55:17] [INFO ] Computed and/alt/rep : 94/227/94 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-04 08:55:17] [INFO ] Added : 93 causal constraints over 19 iterations in 370 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5667 reset in 184 ms.
Product exploration explored 100000 steps with 5693 reset in 196 ms.
Built C files in :
/tmp/ltsmin14770492550098952198
[2025-06-04 08:55:17] [INFO ] Computing symmetric may disable matrix : 95 transitions.
[2025-06-04 08:55:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 08:55:17] [INFO ] Computing symmetric may enable matrix : 95 transitions.
[2025-06-04 08:55:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 08:55:17] [INFO ] Computing Do-Not-Accords matrix : 95 transitions.
[2025-06-04 08:55:17] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 08:55:17] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14770492550098952198
Running compilation step : cd /tmp/ltsmin14770492550098952198;'/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 356 ms.
Running link step : cd /tmp/ltsmin14770492550098952198;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin14770492550098952198;'/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/stateBased8566894103587611813.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 95/95 transitions.
Applied a total of 0 rules in 13 ms. Remains 99 /99 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2025-06-04 08:55:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 08:55:33] [INFO ] Implicit Places using invariants in 111 ms returned []
[2025-06-04 08:55:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 08:55:33] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 08:55:33] [INFO ] Redundant transitions in 20 ms returned []
Running 94 sub problems to find dead transitions.
[2025-06-04 08:55:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 36/135 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:55:33] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:55:33] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:55:33] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:55:33] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 95/194 variables, 99/238 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:55:34] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:55:34] [INFO ] Deduced a trap along path composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:55:35] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:55:35] [INFO ] Deduced a trap composed of 8 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 08:55:35] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:55:36] [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 08:55:36] [INFO ] Deduced a trap composed of 8 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 08:55:36] [INFO ] Deduced a trap composed of 8 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 08:55:36] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 4/247 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (OVERLAPS) 0/194 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 247 constraints, problems are : Problem set: 0 solved, 94 unsolved in 4678 ms.
Refiners :[Domain max(s): 99/99 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 36/135 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 12/147 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 95/194 variables, 99/246 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 94/340 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 0/194 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 341 constraints, problems are : Problem set: 0 solved, 94 unsolved in 4461 ms.
Refiners :[Domain max(s): 99/99 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 9153ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 9154ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9395 ms. Remains : 99/99 places, 95/95 transitions.
Built C files in :
/tmp/ltsmin3363778813622303422
[2025-06-04 08:55:42] [INFO ] Computing symmetric may disable matrix : 95 transitions.
[2025-06-04 08:55:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 08:55:42] [INFO ] Computing symmetric may enable matrix : 95 transitions.
[2025-06-04 08:55:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 08:55:42] [INFO ] Computing Do-Not-Accords matrix : 95 transitions.
[2025-06-04 08:55:42] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 08:55:42] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3363778813622303422
Running compilation step : cd /tmp/ltsmin3363778813622303422;'/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 213 ms.
Running link step : cd /tmp/ltsmin3363778813622303422;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3363778813622303422;'/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/stateBased8477678538310991451.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-04 08:55:57] [INFO ] Flatten gal took : 8 ms
[2025-06-04 08:55:57] [INFO ] Flatten gal took : 7 ms
[2025-06-04 08:55:57] [INFO ] Time to serialize gal into /tmp/LTL8822862686884495745.gal : 2 ms
[2025-06-04 08:55:57] [INFO ] Time to serialize properties into /tmp/LTL8453597536820132879.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/LTL8822862686884495745.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6876969748951711517.hoa' '-atoms' '/tmp/LTL8453597536820132879.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/LTL8453597536820132879.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6876969748951711517.hoa
Detected timeout of ITS tools.
[2025-06-04 08:56:12] [INFO ] Flatten gal took : 7 ms
[2025-06-04 08:56:12] [INFO ] Flatten gal took : 6 ms
[2025-06-04 08:56:12] [INFO ] Time to serialize gal into /tmp/LTL17354600439577020510.gal : 1 ms
[2025-06-04 08:56:12] [INFO ] Time to serialize properties into /tmp/LTL957195820499914880.ltl : 7 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/LTL17354600439577020510.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL957195820499914880.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...275
Read 1 LTL properties
Checking formula 0 : !((G(F("(p54==1)"))))
Formula 0 simplified : FG!"(p54==1)"
Detected timeout of ITS tools.
[2025-06-04 08:56:27] [INFO ] Flatten gal took : 10 ms
[2025-06-04 08:56:27] [INFO ] Applying decomposition
[2025-06-04 08:56:27] [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/graph1995017577574736773.txt' '-o' '/tmp/graph1995017577574736773.bin' '-w' '/tmp/graph1995017577574736773.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1995017577574736773.bin' '-l' '-1' '-v' '-w' '/tmp/graph1995017577574736773.weights' '-q' '0' '-e' '0.001'
[2025-06-04 08:56:27] [INFO ] Decomposing Gal with order
[2025-06-04 08:56:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 08:56:27] [INFO ] Removed a total of 59 redundant transitions.
[2025-06-04 08:56:27] [INFO ] Flatten gal took : 40 ms
[2025-06-04 08:56:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 6 ms.
[2025-06-04 08:56:27] [INFO ] Time to serialize gal into /tmp/LTL17580746567731687458.gal : 2 ms
[2025-06-04 08:56:27] [INFO ] Time to serialize properties into /tmp/LTL9184126261917372231.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/LTL17580746567731687458.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9184126261917372231.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(F("(i3.i0.u19.p54==1)"))))
Formula 0 simplified : FG!"(i3.i0.u19.p54==1)"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-004A-LTLCardinality-07 finished in 106248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(X(X(X(X(p1))))))))'
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
// Phase 1: matrix 99 rows 103 cols
[2025-06-04 08:56:42] [INFO ] Computed 37 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 08:56:43] [INFO ] Implicit Places using invariants in 115 ms returned []
[2025-06-04 08:56:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 08:56:43] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2025-06-04 08:56:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:56:44] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:56:44] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:56:44] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:56:44] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:56:45] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:56:45] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:56:45] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:56:45] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:56:46] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 3/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:56:46] [INFO ] Deduced a trap along path composed of 8 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (OVERLAPS) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 253 constraints, problems are : Problem set: 0 solved, 98 unsolved in 5196 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 9/149 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 98/350 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 0/202 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 351 constraints, problems are : Problem set: 0 solved, 98 unsolved in 6614 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 11870ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 11871ms
Finished structural reductions in LTL mode , in 1 iterations and 12149 ms. Remains : 103/103 places, 99/99 transitions.
Stuttering acceptance computed with spot in 872 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 27 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-004A-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004A-LTLCardinality-08 finished in 13055 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(G(p0)))||(!p0 U (p1||G(!p0))))))'
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2025-06-04 08:56:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 08:56:56] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-04 08:56:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 08:56:56] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2025-06-04 08:56:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:56:56] [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 08:56:57] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:56:57] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:56:57] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:56:57] [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 08:56:58] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:56:58] [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 08:56:58] [INFO ] Deduced a trap composed of 9 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 08:56:58] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 3/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:56:59] [INFO ] Deduced a trap along path composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (OVERLAPS) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 253 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4805 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 9/149 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 98/350 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 0/202 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 351 constraints, problems are : Problem set: 0 solved, 98 unsolved in 6462 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 11281ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 11281ms
Finished structural reductions in LTL mode , in 1 iterations and 11448 ms. Remains : 103/103 places, 99/99 transitions.
Stuttering acceptance computed with spot in 327 ms :[true, (NOT p0), (AND p0 (NOT p1)), false, (NOT p0), false, false, false]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 40 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-004A-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004A-LTLCardinality-09 finished in 11794 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&G(F((p1||G(p2))))))))'
Support contains 5 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2025-06-04 08:57:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 08:57:07] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-04 08:57:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 08:57:07] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2025-06-04 08:57:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:57:08] [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 08:57:08] [INFO ] Deduced a trap composed of 15 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 08:57:08] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:57:09] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:57:09] [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 08:57:09] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:57:10] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:57:10] [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 08:57:10] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 3/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:57:10] [INFO ] Deduced a trap along path composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (OVERLAPS) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 253 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4791 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 9/149 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 98/350 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 0/202 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 351 constraints, problems are : Problem set: 0 solved, 98 unsolved in 6304 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 11117ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 11118ms
Finished structural reductions in LTL mode , in 1 iterations and 11283 ms. Remains : 103/103 places, 99/99 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-004A-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004A-LTLCardinality-15 finished in 11504 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2025-06-04 08:57:19] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15062812107631675611
[2025-06-04 08:57:19] [INFO ] Computing symmetric may disable matrix : 99 transitions.
[2025-06-04 08:57:19] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 08:57:19] [INFO ] Computing symmetric may enable matrix : 99 transitions.
[2025-06-04 08:57:19] [INFO ] Applying decomposition
[2025-06-04 08:57:19] [INFO ] Computation of Complete enable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 08:57:19] [INFO ] Computing Do-Not-Accords matrix : 99 transitions.
[2025-06-04 08:57:19] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 08:57:19] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15062812107631675611
Running compilation step : cd /tmp/ltsmin15062812107631675611;'/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'
[2025-06-04 08:57:19] [INFO ] Flatten gal took : 26 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/graph14152329379464589953.txt' '-o' '/tmp/graph14152329379464589953.bin' '-w' '/tmp/graph14152329379464589953.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14152329379464589953.bin' '-l' '-1' '-v' '-w' '/tmp/graph14152329379464589953.weights' '-q' '0' '-e' '0.001'
[2025-06-04 08:57:19] [INFO ] Decomposing Gal with order
[2025-06-04 08:57:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 08:57:19] [INFO ] Removed a total of 64 redundant transitions.
[2025-06-04 08:57:19] [INFO ] Flatten gal took : 48 ms
[2025-06-04 08:57:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 4 ms.
[2025-06-04 08:57:19] [INFO ] Time to serialize gal into /tmp/LTLCardinality12834398922978529700.gal : 2 ms
[2025-06-04 08:57:19] [INFO ] Time to serialize properties into /tmp/LTLCardinality15499610924339799190.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/LTLCardinality12834398922978529700.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15499610924339799190.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...278
Read 1 LTL properties
Checking formula 0 : !((G(F("(i2.i0.u19.p54==1)"))))
Formula 0 simplified : FG!"(i2.i0.u19.p54==1)"
Compilation finished in 387 ms.
Running link step : cd /tmp/ltsmin15062812107631675611;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin15062812107631675611;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
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( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: 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( 2/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: Initializing POR dependencies: labels 100, guards 99
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.023: LTL layer: formula: [](<>((LTLAPp0==true)))
pins2lts-mc-linux64( 2/ 8), 0.023: "[](<>((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.023: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.065: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.066: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.074: There are 102 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.074: State length is 104, there are 102 groups
pins2lts-mc-linux64( 0/ 8), 0.074: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.074: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.074: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.074: Visible groups: 0 / 102, labels: 1 / 102
pins2lts-mc-linux64( 0/ 8), 0.074: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.074: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.209: [Blue] ~101 levels ~960 states ~1752 transitions
pins2lts-mc-linux64( 0/ 8), 0.232: [Blue] ~127 levels ~1920 states ~2896 transitions
pins2lts-mc-linux64( 0/ 8), 0.265: [Blue] ~127 levels ~3840 states ~5416 transitions
pins2lts-mc-linux64( 4/ 8), 0.325: [Blue] ~156 levels ~7680 states ~12448 transitions
pins2lts-mc-linux64( 0/ 8), 0.510: [Blue] ~127 levels ~15360 states ~21408 transitions
pins2lts-mc-linux64( 1/ 8), 1.012: [Blue] ~123 levels ~30720 states ~45400 transitions
pins2lts-mc-linux64( 1/ 8), 1.625: [Blue] ~124 levels ~61440 states ~88744 transitions
pins2lts-mc-linux64( 6/ 8), 2.480: [Blue] ~106 levels ~122880 states ~187832 transitions
pins2lts-mc-linux64( 6/ 8), 3.431: [Blue] ~106 levels ~245760 states ~382936 transitions
pins2lts-mc-linux64( 0/ 8), 4.876: [Blue] ~136 levels ~491520 states ~765720 transitions
pins2lts-mc-linux64( 0/ 8), 7.278: [Blue] ~140 levels ~983040 states ~1554864 transitions
pins2lts-mc-linux64( 1/ 8), 11.407: [Blue] ~124 levels ~1966080 states ~3205408 transitions
pins2lts-mc-linux64( 0/ 8), 19.645: [Blue] ~140 levels ~3932160 states ~6436120 transitions
pins2lts-mc-linux64( 0/ 8), 36.814: [Blue] ~140 levels ~7864320 states ~13235848 transitions
pins2lts-mc-linux64( 2/ 8), 72.119: [Blue] ~125 levels ~15728640 states ~26947688 transitions
pins2lts-mc-linux64( 2/ 8), 140.290: [Blue] ~125 levels ~31457280 states ~53930104 transitions
pins2lts-mc-linux64( 0/ 8), 276.497: [Blue] ~175 levels ~62914560 states ~108515496 transitions
pins2lts-mc-linux64( 0/ 8), 567.328: [Blue] ~175 levels ~125829120 states ~218815384 transitions
pins2lts-mc-linux64( 1/ 8), 644.909: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 644.946:
pins2lts-mc-linux64( 0/ 8), 644.946: Explored 134221686 states 239766246 transitions, fanout: 1.786
pins2lts-mc-linux64( 0/ 8), 644.946: Total exploration time 644.850 sec (644.790 sec minimum, 644.825 sec on average)
pins2lts-mc-linux64( 0/ 8), 644.946: States per second: 208144, Transitions per second: 371817
pins2lts-mc-linux64( 0/ 8), 644.946:
pins2lts-mc-linux64( 0/ 8), 644.946: State space has 134216802 states, 134214796 are accepting
pins2lts-mc-linux64( 0/ 8), 644.946: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 644.946: blue states: 134221686 (100.00%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 644.946: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 644.946: all-red states: 134214796 (100.00%), bogus 6026 (0.00%)
pins2lts-mc-linux64( 0/ 8), 644.946:
pins2lts-mc-linux64( 0/ 8), 644.946: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 644.946:
pins2lts-mc-linux64( 0/ 8), 644.946: Queue width: 8B, total height: 1195, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 644.946: Tree memory: 1026.9MB, 8.0 B/state, compr.: 1.9%
pins2lts-mc-linux64( 0/ 8), 644.946: Tree fill ratio (roots/leafs): 99.0%/1.0%
pins2lts-mc-linux64( 0/ 8), 644.946: Stored 99 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 644.946: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 644.946: Est. total memory use: 1026.9MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15062812107631675611;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15062812107631675611;'/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' '--ltl' '[](<>((LTLAPp0==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)
Reverse transition relation is NOT exact ! Due to transitions t21, t49, i0.t95, i0.t0, i0.i1.t87, i0.i1.u6.t1, i0.i1.u6.t2, i0.i2.t85, i0.i2.t92, i0.i2.u8....697
Computing Next relation with stutter on 7520 deadlock states
Detected timeout of ITS tools.
[2025-06-04 09:18:23] [INFO ] Applying decomposition
[2025-06-04 09:18:23] [INFO ] Flatten gal took : 21 ms
[2025-06-04 09:18:23] [INFO ] Decomposing Gal with order
[2025-06-04 09:18:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 09:18:23] [INFO ] Removed a total of 68 redundant transitions.
[2025-06-04 09:18:24] [INFO ] Flatten gal took : 17 ms
[2025-06-04 09:18:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 2 ms.
[2025-06-04 09:18:24] [INFO ] Time to serialize gal into /tmp/LTLCardinality4916647292357742442.gal : 12 ms
[2025-06-04 09:18:24] [INFO ] Time to serialize properties into /tmp/LTLCardinality6775628094545727170.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/LTLCardinality4916647292357742442.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6775628094545727170.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(F("(u22.p54==1)"))))
Formula 0 simplified : FG!"(u22.p54==1)"
Reverse transition relation is NOT exact ! Due to transitions t40, t41, t46, t48, t55, t57, t66, t67, t70, t71, t80, t82, t85, t86, t95, t98, u8.t1, u8.t2,...488
Computing Next relation with stutter on 7520 deadlock states
232 unique states visited
232 strongly connected components in search stack
233 transitions explored
232 items max in DFS search stack
68505 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,685.072,3668280,1,0,4.87316e+06,169,695,2.03722e+07,78,363,3734251
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPs-PT-004A-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 2166206 ms.

BK_STOP 1749029412228

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-004A"
export BK_EXAMINATION="LTLCardinality"
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-004A, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r198-tall-174894532500299"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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