Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K 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 88K 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 ShieldPPPs-PT-010A-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749220576107

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-010A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-06 14:36:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 14:36:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 14:36:17] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2025-06-06 14:36:17] [INFO ] Transformed 313 places.
[2025-06-06 14:36:17] [INFO ] Transformed 263 transitions.
[2025-06-06 14:36:17] [INFO ] Found NUPN structural information;
[2025-06-06 14:36:17] [INFO ] Parsed PT model containing 313 places and 263 transitions and 1006 arcs in 177 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldPPPs-PT-010A-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010A-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010A-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 49 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 313 cols
[2025-06-06 14:36:17] [INFO ] Computed 111 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 14:36:18] [INFO ] Implicit Places using invariants in 415 ms returned []
[2025-06-06 14:36:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 14:36:18] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 739 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2025-06-06 14:36:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:36:27] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:36:28] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 2/739 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:36:31] [INFO ] Deduced a trap composed of 11 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-06 14:36:31] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 2/741 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:36:32] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:36:35] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/576 variables, 1/743 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/576 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:36:43] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:36:43] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/576 variables, 2/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:36:44] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:36:46] [INFO ] Deduced a trap composed of 18 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-06 14:36:46] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/576 variables, 3/748 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 576/576 variables, and 748 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30020 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 11/435 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/748 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 262/1010 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1010 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30014 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60114ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 60128ms
Finished structural reductions in LTL mode , in 1 iterations and 60933 ms. Remains : 313/313 places, 263/263 transitions.
Support contains 47 out of 313 places after structural reductions.
[2025-06-06 14:37:18] [INFO ] Flatten gal took : 60 ms
[2025-06-06 14:37:18] [INFO ] Flatten gal took : 23 ms
[2025-06-06 14:37:18] [INFO ] Input system was already deterministic with 263 transitions.
Support contains 45 out of 313 places (down from 47) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 28 to 26
RANDOM walk for 13034 steps (15 resets) in 485 ms. (26 steps per ms) remains 0/26 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(p0))'
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 7 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2025-06-06 14:37:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 14:37:19] [INFO ] Implicit Places using invariants in 166 ms returned []
[2025-06-06 14:37:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 14:37:19] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2025-06-06 14:37:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:37:28] [INFO ] Deduced a trap composed of 18 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-06 14:37:29] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 2/739 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:37:31] [INFO ] Deduced a trap composed of 11 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-06 14:37:32] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 2/741 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:37:33] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:37:36] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/576 variables, 1/743 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/576 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:37:44] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:37:44] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/576 variables, 2/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:37:45] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:37:47] [INFO ] Deduced a trap composed of 18 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-06 14:37:47] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/576 variables, 3/748 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 576/576 variables, and 748 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30016 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 11/435 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/748 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 262/1010 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1010 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30020 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60073ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 60074ms
Finished structural reductions in LTL mode , in 1 iterations and 60521 ms. Remains : 313/313 places, 263/263 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 522 ms.
Product exploration explored 100000 steps with 50000 reset in 385 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 18 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-010A-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-010A-LTLFireability-00 finished in 61738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0))&&(X(p1) U ((X(p1)&&p2)||X(G(p1)))))))'
Support contains 5 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 10 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2025-06-06 14:38:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 14:38:21] [INFO ] Implicit Places using invariants in 163 ms returned []
[2025-06-06 14:38:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 14:38:21] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2025-06-06 14:38:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:38:30] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:38:31] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 2/739 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:38:33] [INFO ] Deduced a trap composed of 11 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-06 14:38:34] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 2/741 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:38:35] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:38:38] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/576 variables, 1/743 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/576 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:38:45] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:38:45] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/576 variables, 2/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:38:47] [INFO ] Deduced a trap composed of 12 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-06 14:38:48] [INFO ] Deduced a trap composed of 18 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-06 14:38:49] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/576 variables, 3/748 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 576/576 variables, and 748 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30016 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 11/435 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/748 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 262/1010 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1010 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30010 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60056ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 60057ms
Finished structural reductions in LTL mode , in 1 iterations and 60491 ms. Remains : 313/313 places, 263/263 transitions.
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p0), true]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-01
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-010A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010A-LTLFireability-01 finished in 60774 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 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 311 transition count 261
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 310 transition count 260
Applied a total of 4 rules in 41 ms. Remains 310 /313 variables (removed 3) and now considering 260/263 (removed 3) transitions.
// Phase 1: matrix 260 rows 310 cols
[2025-06-06 14:39:21] [INFO ] Computed 111 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 14:39:22] [INFO ] Implicit Places using invariants in 146 ms returned []
[2025-06-06 14:39:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 14:39:22] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 14:39:22] [INFO ] Redundant transitions in 10 ms returned []
Running 258 sub problems to find dead transitions.
[2025-06-06 14:39:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 260/570 variables, 310/731 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:39:29] [INFO ] Deduced a trap composed of 17 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-06 14:39:29] [INFO ] Deduced a trap composed of 17 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-06 14:39:29] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 3 ms to minimize.
At refinement iteration 5 (OVERLAPS) 0/570 variables, 3/734 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:39:31] [INFO ] Deduced a trap composed of 10 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-06 14:39:32] [INFO ] Deduced a trap composed of 17 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-06 14:39:32] [INFO ] Deduced a trap composed of 17 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-06 14:39:32] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 4/738 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/570 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:39:42] [INFO ] Deduced a trap along path composed of 9 places in 36 ms of which 11 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/570 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:39:43] [INFO ] Deduced a trap composed of 17 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-06 14:39:43] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/570 variables, 2/741 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:39:50] [INFO ] Deduced a trap along path composed of 16 places in 24 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/570 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:39:52] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/570 variables, and 743 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30010 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 10/431 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 260/570 variables, 310/741 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 258/999 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 2/1001 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/570 variables, and 1001 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30017 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60051ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 60053ms
Starting structural reductions in SI_LTL mode, iteration 1 : 310/313 places, 260/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60521 ms. Remains : 310/313 places, 260/263 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-02
Stuttering criterion allowed to conclude after 666 steps with 0 reset in 10 ms.
FORMULA ShieldPPPs-PT-010A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010A-LTLFireability-02 finished in 60602 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0&&F(p1)))||G(p2))))'
Support contains 3 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 3 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 313 cols
[2025-06-06 14:40:22] [INFO ] Computed 111 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 14:40:22] [INFO ] Implicit Places using invariants in 160 ms returned []
[2025-06-06 14:40:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 14:40:22] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2025-06-06 14:40:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:40:31] [INFO ] Deduced a trap composed of 18 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-06 14:40:32] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 2/739 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:40:34] [INFO ] Deduced a trap composed of 11 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-06 14:40:35] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 2/741 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:40:36] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:40:39] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/576 variables, 1/743 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/576 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:40:47] [INFO ] Deduced a trap composed of 18 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-06 14:40:47] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/576 variables, 2/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:40:48] [INFO ] Deduced a trap composed of 12 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-06 14:40:50] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:40:50] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/576 variables, 3/748 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 576/576 variables, and 748 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30015 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 11/435 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/748 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 262/1010 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1010 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30017 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60072ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 60073ms
Finished structural reductions in LTL mode , in 1 iterations and 60482 ms. Remains : 313/313 places, 263/263 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 379 ms.
Product exploration explored 100000 steps with 50000 reset in 383 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) p2))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p1)), (X (X (NOT (AND (NOT p1) p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 18 factoid took 23 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-010A-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-010A-LTLFireability-03 finished in 61476 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(p0))||(F(G(p1))&&F(p2)))))'
Support contains 5 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 261
Applied a total of 4 rules in 21 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
// Phase 1: matrix 261 rows 311 cols
[2025-06-06 14:41:24] [INFO ] Computed 111 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 14:41:24] [INFO ] Implicit Places using invariants in 173 ms returned []
[2025-06-06 14:41:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 14:41:24] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 14:41:24] [INFO ] Redundant transitions in 4 ms returned []
Running 260 sub problems to find dead transitions.
[2025-06-06 14:41:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:41:32] [INFO ] Deduced a trap composed of 11 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-06 14:41:33] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:41:33] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:41:33] [INFO ] Deduced a trap composed of 18 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-06 14:41:33] [INFO ] Deduced a trap composed of 18 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-06 14:41:33] [INFO ] Deduced a trap composed of 18 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-06 14:41:33] [INFO ] Deduced a trap composed of 20 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-06 14:41:34] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 8/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (OVERLAPS) 0/572 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 741 constraints, problems are : Problem set: 0 solved, 260 unsolved in 20158 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 8/430 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/1001 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 1001 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30018 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50200ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 50201ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50681 ms. Remains : 311/313 places, 261/263 transitions.
Stuttering acceptance computed with spot in 91 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-04
Product exploration explored 100000 steps with 302 reset in 365 ms.
Product exploration explored 100000 steps with 310 reset in 445 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 125 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 1567 steps (0 resets) in 27 ms. (55 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p0), (F p1), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 13 factoid took 353 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 107 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
[2025-06-06 14:42:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 14:42:16] [INFO ] [Real]Absence check using 111 positive place invariants in 60 ms returned sat
[2025-06-06 14:42:17] [INFO ] [Real]Absence check using state equation in 519 ms returned sat
[2025-06-06 14:42:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 14:42:17] [INFO ] [Nat]Absence check using 111 positive place invariants in 49 ms returned sat
[2025-06-06 14:42:17] [INFO ] [Nat]Absence check using state equation in 481 ms returned sat
[2025-06-06 14:42:17] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 13 ms.
[2025-06-06 14:42:26] [INFO ] Added : 260 causal constraints over 53 iterations in 8146 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2025-06-06 14:42:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 14:42:26] [INFO ] [Real]Absence check using 111 positive place invariants in 40 ms returned sat
[2025-06-06 14:42:26] [INFO ] [Real]Absence check using state equation in 424 ms returned sat
[2025-06-06 14:42:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 14:42:26] [INFO ] [Nat]Absence check using 111 positive place invariants in 40 ms returned sat
[2025-06-06 14:42:27] [INFO ] [Nat]Absence check using state equation in 538 ms returned sat
[2025-06-06 14:42:27] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 13 ms.
[2025-06-06 14:42:33] [INFO ] Added : 260 causal constraints over 53 iterations in 5961 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 5 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 16 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2025-06-06 14:42:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 14:42:33] [INFO ] Implicit Places using invariants in 162 ms returned []
[2025-06-06 14:42:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 14:42:33] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 14:42:33] [INFO ] Redundant transitions in 4 ms returned []
Running 260 sub problems to find dead transitions.
[2025-06-06 14:42: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/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:42:41] [INFO ] Deduced a trap composed of 11 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-06 14:42:42] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:42:42] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:42:42] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:42:42] [INFO ] Deduced a trap composed of 18 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-06 14:42:42] [INFO ] Deduced a trap composed of 18 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-06 14:42:42] [INFO ] Deduced a trap composed of 20 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-06 14:42:43] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 8/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (OVERLAPS) 0/572 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 741 constraints, problems are : Problem set: 0 solved, 260 unsolved in 19851 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 8/430 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/1001 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 1001 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30014 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49887ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 49891ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 50349 ms. Remains : 311/311 places, 261/261 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 122 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 1773 steps (0 resets) in 64 ms. (27 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p0), (F p1), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 13 factoid took 316 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 98 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
[2025-06-06 14:43:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 14:43:24] [INFO ] [Real]Absence check using 111 positive place invariants in 59 ms returned sat
[2025-06-06 14:43:25] [INFO ] [Real]Absence check using state equation in 514 ms returned sat
[2025-06-06 14:43:25] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 14:43:25] [INFO ] [Nat]Absence check using 111 positive place invariants in 50 ms returned sat
[2025-06-06 14:43:25] [INFO ] [Nat]Absence check using state equation in 476 ms returned sat
[2025-06-06 14:43:25] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 13 ms.
[2025-06-06 14:43:33] [INFO ] Added : 260 causal constraints over 53 iterations in 8036 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2025-06-06 14:43:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 14:43:34] [INFO ] [Real]Absence check using 111 positive place invariants in 43 ms returned sat
[2025-06-06 14:43:34] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2025-06-06 14:43:34] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 14:43:34] [INFO ] [Nat]Absence check using 111 positive place invariants in 37 ms returned sat
[2025-06-06 14:43:35] [INFO ] [Nat]Absence check using state equation in 544 ms returned sat
[2025-06-06 14:43:35] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 14 ms.
[2025-06-06 14:43:41] [INFO ] Added : 260 causal constraints over 53 iterations in 5845 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 111 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 312 reset in 400 ms.
Product exploration explored 100000 steps with 312 reset in 413 ms.
Built C files in :
/tmp/ltsmin3595659770866964713
[2025-06-06 14:43:42] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2025-06-06 14:43:42] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 14:43:42] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2025-06-06 14:43:42] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 14:43:42] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2025-06-06 14:43:42] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 14:43:42] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3595659770866964713
Running compilation step : cd /tmp/ltsmin3595659770866964713;'/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 635 ms.
Running link step : cd /tmp/ltsmin3595659770866964713;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin3595659770866964713;'/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/stateBased3088276168410340557.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 15 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2025-06-06 14:43:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 14:43:57] [INFO ] Implicit Places using invariants in 162 ms returned []
[2025-06-06 14:43:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 14:43:57] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 14:43:57] [INFO ] Redundant transitions in 2 ms returned []
Running 260 sub problems to find dead transitions.
[2025-06-06 14:43:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:44:04] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:44:05] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:44:05] [INFO ] Deduced a trap composed of 11 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-06 14:44:05] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:44:05] [INFO ] Deduced a trap composed of 18 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-06 14:44:05] [INFO ] Deduced a trap composed of 18 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-06 14:44:06] [INFO ] Deduced a trap composed of 20 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-06 14:44:06] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 8/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (OVERLAPS) 0/572 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 741 constraints, problems are : Problem set: 0 solved, 260 unsolved in 19446 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 8/430 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/1001 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 1001 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30010 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49476ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 49478ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49920 ms. Remains : 311/311 places, 261/261 transitions.
Built C files in :
/tmp/ltsmin15380138982710039006
[2025-06-06 14:44:47] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2025-06-06 14:44:47] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 14:44:47] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2025-06-06 14:44:47] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 14:44:47] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2025-06-06 14:44:47] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 14:44:47] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15380138982710039006
Running compilation step : cd /tmp/ltsmin15380138982710039006;'/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 514 ms.
Running link step : cd /tmp/ltsmin15380138982710039006;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin15380138982710039006;'/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/stateBased5967100303106313992.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-06 14:45:02] [INFO ] Flatten gal took : 19 ms
[2025-06-06 14:45:02] [INFO ] Flatten gal took : 17 ms
[2025-06-06 14:45:02] [INFO ] Time to serialize gal into /tmp/LTL11008104842084598817.gal : 4 ms
[2025-06-06 14:45:02] [INFO ] Time to serialize properties into /tmp/LTL13131717170521146898.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/LTL11008104842084598817.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18034659624183957145.hoa' '-atoms' '/tmp/LTL13131717170521146898.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...320
Loading property file /tmp/LTL13131717170521146898.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18034659624183957145.hoa
Detected timeout of ITS tools.
[2025-06-06 14:45:17] [INFO ] Flatten gal took : 17 ms
[2025-06-06 14:45:17] [INFO ] Flatten gal took : 15 ms
[2025-06-06 14:45:17] [INFO ] Time to serialize gal into /tmp/LTL17161068003702082216.gal : 3 ms
[2025-06-06 14:45:17] [INFO ] Time to serialize properties into /tmp/LTL6872522087283557716.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17161068003702082216.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6872522087283557716.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((X(F("((p35==1)&&(p56==1))")))||((F(G("((p99==1)&&(p116==1))")))&&(F("(p27==1)"))))))
Formula 0 simplified : F(XG!"((p35==1)&&(p56==1))" & (GF!"((p99==1)&&(p116==1))" | G!"(p27==1)"))
Detected timeout of ITS tools.
[2025-06-06 14:45:32] [INFO ] Flatten gal took : 15 ms
[2025-06-06 14:45:32] [INFO ] Applying decomposition
[2025-06-06 14:45:32] [INFO ] Flatten gal took : 14 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/graph11687960488084655209.txt' '-o' '/tmp/graph11687960488084655209.bin' '-w' '/tmp/graph11687960488084655209.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11687960488084655209.bin' '-l' '-1' '-v' '-w' '/tmp/graph11687960488084655209.weights' '-q' '0' '-e' '0.001'
[2025-06-06 14:45:32] [INFO ] Decomposing Gal with order
[2025-06-06 14:45:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 14:45:32] [INFO ] Removed a total of 60 redundant transitions.
[2025-06-06 14:45:32] [INFO ] Flatten gal took : 63 ms
[2025-06-06 14:45:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 14 ms.
[2025-06-06 14:45:32] [INFO ] Time to serialize gal into /tmp/LTL9936527443376626162.gal : 7 ms
[2025-06-06 14:45:32] [INFO ] Time to serialize properties into /tmp/LTL9578324527121123089.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9936527443376626162.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9578324527121123089.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...254
Read 1 LTL properties
Checking formula 0 : !((G((X(F("((i1.i0.u12.p35==1)&&(i1.i0.u20.p56==1))")))||((F(G("((i3.i2.u35.p99==1)&&(i3.i2.u41.p116==1))")))&&(F("(i0.i3.u10.p27==1)"...161
Formula 0 simplified : F(XG!"((i1.i0.u12.p35==1)&&(i1.i0.u20.p56==1))" & (GF!"((i3.i2.u35.p99==1)&&(i3.i2.u41.p116==1))" | G!"(i0.i3.u10.p27==1)"))
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-010A-LTLFireability-04 finished in 263860 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 261
Applied a total of 4 rules in 17 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
[2025-06-06 14:45:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 14:45:48] [INFO ] Implicit Places using invariants in 168 ms returned []
[2025-06-06 14:45:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 14:45:48] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 14:45:48] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2025-06-06 14:45:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:45:55] [INFO ] Deduced a trap composed of 11 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-06 14:45:56] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:45:56] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:45:56] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:45:56] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:45:56] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:45:57] [INFO ] Deduced a trap composed of 20 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-06 14:45:58] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 8/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (OVERLAPS) 0/572 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 741 constraints, problems are : Problem set: 0 solved, 260 unsolved in 20130 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 8/430 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/1001 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 1001 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30017 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50170ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 50171ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50619 ms. Remains : 311/313 places, 261/263 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-06
Product exploration explored 100000 steps with 277 reset in 468 ms.
Product exploration explored 100000 steps with 280 reset in 394 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
RANDOM walk for 1436 steps (0 resets) in 15 ms. (89 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 103 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2025-06-06 14:46:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 14:46:39] [INFO ] [Real]Absence check using 111 positive place invariants in 86 ms returned sat
[2025-06-06 14:46:40] [INFO ] [Real]Absence check using state equation in 595 ms returned sat
[2025-06-06 14:46:40] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 14:46:40] [INFO ] [Nat]Absence check using 111 positive place invariants in 41 ms returned sat
[2025-06-06 14:46:41] [INFO ] [Nat]Absence check using state equation in 393 ms returned sat
[2025-06-06 14:46:41] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 14 ms.
[2025-06-06 14:46:52] [INFO ] Added : 252 causal constraints over 54 iterations in 11193 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 14 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2025-06-06 14:46:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 14:46:52] [INFO ] Implicit Places using invariants in 152 ms returned []
[2025-06-06 14:46:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 14:46:52] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 14:46:52] [INFO ] Redundant transitions in 0 ms returned []
Running 260 sub problems to find dead transitions.
[2025-06-06 14:46:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:47:00] [INFO ] Deduced a trap composed of 11 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-06 14:47:00] [INFO ] Deduced a trap composed of 18 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-06 14:47:01] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:47:01] [INFO ] Deduced a trap composed of 18 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-06 14:47:01] [INFO ] Deduced a trap composed of 18 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-06 14:47:01] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:47:01] [INFO ] Deduced a trap composed of 20 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-06 14:47:02] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 8/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (OVERLAPS) 0/572 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 741 constraints, problems are : Problem set: 0 solved, 260 unsolved in 19697 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 8/430 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/1001 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 1001 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30014 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49735ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 49735ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 50166 ms. Remains : 311/311 places, 261/261 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 1484 steps (0 resets) in 15 ms. (92 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 89 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2025-06-06 14:47:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 14:47:43] [INFO ] [Real]Absence check using 111 positive place invariants in 90 ms returned sat
[2025-06-06 14:47:43] [INFO ] [Real]Absence check using state equation in 573 ms returned sat
[2025-06-06 14:47:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 14:47:43] [INFO ] [Nat]Absence check using 111 positive place invariants in 40 ms returned sat
[2025-06-06 14:47:44] [INFO ] [Nat]Absence check using state equation in 391 ms returned sat
[2025-06-06 14:47:44] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 16 ms.
[2025-06-06 14:47:56] [INFO ] Added : 260 causal constraints over 56 iterations in 12528 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 278 reset in 362 ms.
Product exploration explored 100000 steps with 278 reset in 405 ms.
Built C files in :
/tmp/ltsmin10783424553259850313
[2025-06-06 14:47:57] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2025-06-06 14:47:57] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 14:47:57] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2025-06-06 14:47:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 14:47:57] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2025-06-06 14:47:57] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 14:47:57] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10783424553259850313
Running compilation step : cd /tmp/ltsmin10783424553259850313;'/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 526 ms.
Running link step : cd /tmp/ltsmin10783424553259850313;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin10783424553259850313;'/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/stateBased15811494502227989198.hoa' '--buchi-type=spotba'
LTSmin run took 9121 ms.
FORMULA ShieldPPPs-PT-010A-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-010A-LTLFireability-06 finished in 139429 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((X(X(X(X(p0))))||(p1 U p2))))))'
Support contains 6 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 7 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 313 cols
[2025-06-06 14:48:07] [INFO ] Computed 111 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 14:48:07] [INFO ] Implicit Places using invariants in 174 ms returned []
[2025-06-06 14:48:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 14:48:07] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2025-06-06 14:48: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/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:48:16] [INFO ] Deduced a trap composed of 18 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-06 14:48:17] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 2/739 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:48:19] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:48:20] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 2/741 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:48:21] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:48:24] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/576 variables, 1/743 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/576 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:48:31] [INFO ] Deduced a trap composed of 18 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-06 14:48:31] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/576 variables, 2/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:48:33] [INFO ] Deduced a trap composed of 12 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-06 14:48:34] [INFO ] Deduced a trap composed of 18 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-06 14:48:35] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/576 variables, 3/748 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 576/576 variables, and 748 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30017 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 11/435 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/748 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 262/1010 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1010 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30019 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60059ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 60060ms
Finished structural reductions in LTL mode , in 1 iterations and 60485 ms. Remains : 313/313 places, 263/263 transitions.
Stuttering acceptance computed with spot in 561 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-07
Product exploration explored 100000 steps with 12488 reset in 256 ms.
Product exploration explored 100000 steps with 12483 reset in 280 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 p2) (NOT p1) p0), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 102 ms. Reduced automaton from 13 states, 20 edges and 3 AP (stutter sensitive) to 13 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 465 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
RANDOM walk for 10683 steps (12 resets) in 76 ms. (138 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 p2 p0))), (F p1), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 381 ms. Reduced automaton from 13 states, 20 edges and 3 AP (stutter sensitive) to 13 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 469 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 455 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 6 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 5 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2025-06-06 14:49:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 14:49:11] [INFO ] Implicit Places using invariants in 175 ms returned []
[2025-06-06 14:49:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 14:49:11] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2025-06-06 14:49:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:49:19] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:49:20] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 2/739 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:49:23] [INFO ] Deduced a trap composed of 11 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-06 14:49:23] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 2/741 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:49:24] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:49:27] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/576 variables, 1/743 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/576 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:49:35] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:49:35] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/576 variables, 2/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:49:36] [INFO ] Deduced a trap composed of 12 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-06 14:49:38] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:49:38] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/576 variables, 3/748 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 576/576 variables, and 748 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30012 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 11/435 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/748 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 262/1010 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1010 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30012 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60052ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 60054ms
Finished structural reductions in LTL mode , in 1 iterations and 60470 ms. Remains : 313/313 places, 263/263 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 114 ms. Reduced automaton from 13 states, 20 edges and 3 AP (stutter sensitive) to 13 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 523 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
RANDOM walk for 10849 steps (12 resets) in 61 ms. (174 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 p2 p0))), (F p1), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 330 ms. Reduced automaton from 13 states, 20 edges and 3 AP (stutter sensitive) to 13 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 498 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 473 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 476 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 12498 reset in 252 ms.
Product exploration explored 100000 steps with 12526 reset in 283 ms.
Applying partial POR strategy [false, false, false, false, false, false, false, true, true, false, false, true, true]
Stuttering acceptance computed with spot in 503 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 6 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 313 transition count 263
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 40 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 14:50:15] [INFO ] Redundant transitions in 0 ms returned []
Running 262 sub problems to find dead transitions.
// Phase 1: matrix 263 rows 313 cols
[2025-06-06 14:50:15] [INFO ] Computed 111 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:50:20] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 3 ms to minimize.
Problem TDEAD87 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:50:20] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
Problem TDEAD88 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 2/426 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/426 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/739 constraints. Problems are: Problem set: 2 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:50:26] [INFO ] Deduced a trap composed of 18 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-06 14:50:26] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:50:26] [INFO ] Deduced a trap composed of 18 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-06 14:50:26] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:50:26] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 5/744 constraints. Problems are: Problem set: 2 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:50:28] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/745 constraints. Problems are: Problem set: 2 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:50:30] [INFO ] Deduced a trap composed of 18 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-06 14:50:31] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/576 variables, 2/747 constraints. Problems are: Problem set: 2 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:50:37] [INFO ] Deduced a trap along path composed of 16 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/576 variables, 1/748 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/576 variables, 0/748 constraints. Problems are: Problem set: 2 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:50:44] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 576/576 variables, and 749 constraints, problems are : Problem set: 2 solved, 260 unsolved in 30014 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 260 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 3/313 variables, 111/421 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 3/424 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 11/435 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/435 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/748 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 260/1008 constraints. Problems are: Problem set: 2 solved, 260 unsolved
SMT process timed out in 60048ms, After SMT, problems are : Problem set: 2 solved, 260 unsolved
Search for dead transitions found 2 dead transitions in 60050ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 313/313 places, 261/263 transitions.
Graph (complete) has 822 edges and 313 vertex of which 311 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 311 /313 variables (removed 2) and now considering 261/261 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 311/313 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60114 ms. Remains : 311/313 places, 261/263 transitions.
Built C files in :
/tmp/ltsmin15765756012373360287
[2025-06-06 14:51:15] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15765756012373360287
Running compilation step : cd /tmp/ltsmin15765756012373360287;'/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 418 ms.
Running link step : cd /tmp/ltsmin15765756012373360287;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15765756012373360287;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5214755909058022648.hoa' '--buchi-type=spotba'
LTSmin run took 3610 ms.
FORMULA ShieldPPPs-PT-010A-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-010A-LTLFireability-07 finished in 191976 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(X(X((p0&&F(p1))))))||F(p2)))))'
Support contains 5 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 12 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 313 cols
[2025-06-06 14:51:19] [INFO ] Computed 111 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 14:51:19] [INFO ] Implicit Places using invariants in 149 ms returned []
[2025-06-06 14:51:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 14:51:19] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2025-06-06 14:51:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:51:28] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:51:29] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 2/739 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:51:31] [INFO ] Deduced a trap composed of 11 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-06 14:51:32] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 2/741 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:51:33] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:51:36] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/576 variables, 1/743 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/576 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:51:43] [INFO ] Deduced a trap composed of 18 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-06 14:51:43] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/576 variables, 2/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:51:45] [INFO ] Deduced a trap composed of 12 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-06 14:51:46] [INFO ] Deduced a trap composed of 18 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-06 14:51:47] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/576 variables, 3/748 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 576/576 variables, and 748 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30012 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 11/435 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/748 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 262/1010 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1010 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30019 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60050ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 60051ms
Finished structural reductions in LTL mode , in 1 iterations and 60454 ms. Remains : 313/313 places, 263/263 transitions.
Stuttering acceptance computed with spot in 346 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-08
Product exploration explored 100000 steps with 14285 reset in 243 ms.
Product exploration explored 100000 steps with 14285 reset in 275 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 p2) p0 p1), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 9 states, 10 edges and 3 AP (stutter sensitive) to 9 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 348 ms :[(AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
RANDOM walk for 1944 steps (0 resets) in 18 ms. (102 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (X (NOT p2)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT p1)), (F p2), (F (NOT (OR p2 p1))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 2 factoid took 222 ms. Reduced automaton from 9 states, 10 edges and 3 AP (stutter sensitive) to 9 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 381 ms :[(AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 318 ms :[(AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Support contains 5 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 6 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2025-06-06 14:52:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 14:52:22] [INFO ] Implicit Places using invariants in 154 ms returned []
[2025-06-06 14:52:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 14:52:22] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2025-06-06 14:52:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:52:30] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:52:31] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 2/739 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:52:34] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:52:34] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 2/741 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:52:35] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:52:39] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/576 variables, 1/743 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/576 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:52:46] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:52:46] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/576 variables, 2/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:52:47] [INFO ] Deduced a trap composed of 12 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-06 14:52:49] [INFO ] Deduced a trap composed of 18 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-06 14:52:49] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/576 variables, 3/748 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 576/576 variables, and 748 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30011 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 11/435 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/748 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 262/1010 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1010 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30011 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60047ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 60048ms
Finished structural reductions in LTL mode , in 1 iterations and 60460 ms. Remains : 313/313 places, 263/263 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 69 ms. Reduced automaton from 9 states, 10 edges and 3 AP (stutter sensitive) to 9 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 327 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2)]
RANDOM walk for 2237 steps (1 resets) in 24 ms. (89 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p2) p1 p0)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p1 p2))), (F (NOT p1)), (F p2), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 1 factoid took 205 ms. Reduced automaton from 9 states, 10 edges and 3 AP (stutter sensitive) to 9 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 335 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2)]
Stuttering acceptance computed with spot in 353 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2)]
Stuttering acceptance computed with spot in 314 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2)]
Product exploration explored 100000 steps with 14285 reset in 245 ms.
Product exploration explored 100000 steps with 14285 reset in 274 ms.
Applying partial POR strategy [true, true, false, false, false, false, false, false, true]
Stuttering acceptance computed with spot in 355 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2)]
Support contains 5 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 313 transition count 263
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 19 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 14:53:25] [INFO ] Redundant transitions in 1 ms returned []
Running 262 sub problems to find dead transitions.
// Phase 1: matrix 263 rows 313 cols
[2025-06-06 14:53:25] [INFO ] Computed 111 invariants in 2 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:53:30] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 3 ms to minimize.
Problem TDEAD87 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:53:30] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 2 ms to minimize.
Problem TDEAD88 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 2/426 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/426 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/739 constraints. Problems are: Problem set: 2 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:53:36] [INFO ] Deduced a trap composed of 18 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-06 14:53:36] [INFO ] Deduced a trap composed of 18 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-06 14:53:36] [INFO ] Deduced a trap composed of 18 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-06 14:53:36] [INFO ] Deduced a trap composed of 18 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-06 14:53:36] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 5/744 constraints. Problems are: Problem set: 2 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:53:38] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/745 constraints. Problems are: Problem set: 2 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:53:40] [INFO ] Deduced a trap composed of 18 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-06 14:53:41] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/576 variables, 2/747 constraints. Problems are: Problem set: 2 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:53:47] [INFO ] Deduced a trap along path composed of 16 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/576 variables, 1/748 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/576 variables, 0/748 constraints. Problems are: Problem set: 2 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:53:54] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 576/576 variables, and 749 constraints, problems are : Problem set: 2 solved, 260 unsolved in 30012 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 260 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 3/313 variables, 111/421 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 3/424 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 11/435 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/435 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/748 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 260/1008 constraints. Problems are: Problem set: 2 solved, 260 unsolved
SMT process timed out in 60043ms, After SMT, problems are : Problem set: 2 solved, 260 unsolved
Search for dead transitions found 2 dead transitions in 60044ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 313/313 places, 261/263 transitions.
Graph (complete) has 822 edges and 313 vertex of which 311 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 311 /313 variables (removed 2) and now considering 261/261 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 311/313 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60077 ms. Remains : 311/313 places, 261/263 transitions.
Built C files in :
/tmp/ltsmin203556697224220010
[2025-06-06 14:54:25] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin203556697224220010
Running compilation step : cd /tmp/ltsmin203556697224220010;'/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 414 ms.
Running link step : cd /tmp/ltsmin203556697224220010;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin203556697224220010;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10651960625485777941.hoa' '--buchi-type=spotba'
LTSmin run took 142 ms.
FORMULA ShieldPPPs-PT-010A-LTLFireability-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-010A-LTLFireability-08 finished in 186508 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 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 311 transition count 261
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 310 transition count 260
Applied a total of 4 rules in 19 ms. Remains 310 /313 variables (removed 3) and now considering 260/263 (removed 3) transitions.
// Phase 1: matrix 260 rows 310 cols
[2025-06-06 14:54:25] [INFO ] Computed 111 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 14:54:25] [INFO ] Implicit Places using invariants in 157 ms returned []
[2025-06-06 14:54:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 14:54:26] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 14:54:26] [INFO ] Redundant transitions in 1 ms returned []
Running 258 sub problems to find dead transitions.
[2025-06-06 14:54:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 260/570 variables, 310/731 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:54:33] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:54:33] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:54:33] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 2 ms to minimize.
At refinement iteration 5 (OVERLAPS) 0/570 variables, 3/734 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:54:35] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:54:36] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:54:36] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:54:36] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 4/738 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/570 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:54:46] [INFO ] Deduced a trap along path composed of 9 places in 17 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/570 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:54:47] [INFO ] Deduced a trap composed of 17 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-06 14:54:47] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/570 variables, 2/741 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:54:54] [INFO ] Deduced a trap along path composed of 16 places in 22 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/570 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:54:56] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/570 variables, and 743 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30011 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 10/431 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 260/570 variables, 310/741 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 258/999 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 2/1001 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 1)
(s9 1)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 1)
(s25 0)
(s26 0)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 1)
(s40 0)
(s41 1)
(s42 0)
(s43 0)
(s44 1)
(s45 1)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 1)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 1)
(s56 1)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 1)
(s64 1)
(s65 0)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 1)
(s71 1)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 1)
(s82 0)
(s83 0)
(s84 0)
(s85 1)
(s86 0)
(s87 1)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 1)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 1)
(s100 0)
(s101 1)
(s102 0)
(s103 1)
(s104 0)
(s105 0)
(s106 1)
(s107 1)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 1)
(s116 0)
(s117 1)
(s118 1)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 1)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 1)
(s135 0)
(s136 1)
(s137 0)
(s138 0)
(s139 1)
(s140 0)
(s141 1)
(s142 0)
(s143 0)
(s144 0)
(s145 1)
(s146 0)
(s147 1)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 0)
(s155 0)
(s156 1)
(s157 1)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 1)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 1)
(s172 1)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 1)
(s180 0)
(s181 0)
(s182 0)
(s183 1)
(s184 0)
(s185 0)
(s186 0)
(s187 1)
(s188 1)
(s189 0)
(s190 0)
(s191 0)
(s192 1)
(s193 1)
(s194 0)
(s195 1)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 1)
(s203 1)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 1)
(s209 1)
(s210 0)
(s211 0)
(s212 1)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 1)
(s219 1)
(s220 0)
(s221 1)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 1)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 1)
(s233 0)
(s234 1)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 1)
(s240 1)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 1)
(s246 0)
(s247 0)
(s248 0)
(s249 1)
(s250 1)
(s251 0)
(s252 1)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/570 variables, and 1001 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30014 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60040ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 60041ms
Starting structural reductions in SI_LTL mode, iteration 1 : 310/313 places, 260/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60479 ms. Remains : 310/313 places, 260/263 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-09
Product exploration explored 100000 steps with 200 reset in 388 ms.
Product exploration explored 100000 steps with 204 reset in 408 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 60 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 55 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1772 steps (0 resets) in 16 ms. (104 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 78 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 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 310 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 310/310 places, 260/260 transitions.
Applied a total of 0 rules in 6 ms. Remains 310 /310 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2025-06-06 14:55:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 14:55:27] [INFO ] Implicit Places using invariants in 148 ms returned []
[2025-06-06 14:55:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 14:55:27] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 14:55:27] [INFO ] Redundant transitions in 0 ms returned []
Running 258 sub problems to find dead transitions.
[2025-06-06 14:55:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 260/570 variables, 310/731 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:55:35] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:55:35] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:55:35] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 2 ms to minimize.
At refinement iteration 5 (OVERLAPS) 0/570 variables, 3/734 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:55:36] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:55:37] [INFO ] Deduced a trap composed of 17 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-06 14:55:37] [INFO ] Deduced a trap composed of 17 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-06 14:55:37] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 4/738 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/570 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:55:47] [INFO ] Deduced a trap along path composed of 9 places in 14 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/570 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:55:48] [INFO ] Deduced a trap composed of 17 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-06 14:55:48] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/570 variables, 2/741 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:55:55] [INFO ] Deduced a trap along path composed of 16 places in 24 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/570 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:55:57] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/570 variables, and 743 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30011 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 10/431 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 260/570 variables, 310/741 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 258/999 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 2/1001 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/570 variables, and 1001 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30015 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60040ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 60042ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60448 ms. Remains : 310/310 places, 260/260 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 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 1715 steps (0 resets) in 19 ms. (85 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 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 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 202 reset in 369 ms.
Product exploration explored 100000 steps with 200 reset in 405 ms.
Built C files in :
/tmp/ltsmin17603051410805627463
[2025-06-06 14:56:29] [INFO ] Computing symmetric may disable matrix : 260 transitions.
[2025-06-06 14:56:29] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 14:56:29] [INFO ] Computing symmetric may enable matrix : 260 transitions.
[2025-06-06 14:56:29] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 14:56:29] [INFO ] Computing Do-Not-Accords matrix : 260 transitions.
[2025-06-06 14:56:29] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 14:56:29] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17603051410805627463
Running compilation step : cd /tmp/ltsmin17603051410805627463;'/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 526 ms.
Running link step : cd /tmp/ltsmin17603051410805627463;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin17603051410805627463;'/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/stateBased84409275770627100.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 310 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 310/310 places, 260/260 transitions.
Applied a total of 0 rules in 15 ms. Remains 310 /310 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2025-06-06 14:56:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 14:56:44] [INFO ] Implicit Places using invariants in 154 ms returned []
[2025-06-06 14:56:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 14:56:44] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 14:56:44] [INFO ] Redundant transitions in 1 ms returned []
Running 258 sub problems to find dead transitions.
[2025-06-06 14:56:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 260/570 variables, 310/731 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:56:52] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:56:52] [INFO ] Deduced a trap composed of 17 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-06 14:56:52] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 2 ms to minimize.
At refinement iteration 5 (OVERLAPS) 0/570 variables, 3/734 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:56:53] [INFO ] Deduced a trap composed of 10 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-06 14:56:54] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:56:54] [INFO ] Deduced a trap composed of 17 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-06 14:56:55] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 4/738 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/570 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:57:04] [INFO ] Deduced a trap along path composed of 9 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/570 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:57:06] [INFO ] Deduced a trap composed of 17 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-06 14:57:06] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/570 variables, 2/741 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:57:13] [INFO ] Deduced a trap along path composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/570 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:57:14] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/570 variables, and 743 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30017 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 10/431 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 260/570 variables, 310/741 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 258/999 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 2/1001 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/570 variables, and 1001 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30016 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60051ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 60051ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60477 ms. Remains : 310/310 places, 260/260 transitions.
Built C files in :
/tmp/ltsmin14319521948689347588
[2025-06-06 14:57:44] [INFO ] Computing symmetric may disable matrix : 260 transitions.
[2025-06-06 14:57:44] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 14:57:44] [INFO ] Computing symmetric may enable matrix : 260 transitions.
[2025-06-06 14:57:44] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 14:57:44] [INFO ] Computing Do-Not-Accords matrix : 260 transitions.
[2025-06-06 14:57:44] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 14:57:44] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14319521948689347588
Running compilation step : cd /tmp/ltsmin14319521948689347588;'/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 526 ms.
Running link step : cd /tmp/ltsmin14319521948689347588;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin14319521948689347588;'/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/stateBased1247820785843433923.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-06 14:58:00] [INFO ] Flatten gal took : 15 ms
[2025-06-06 14:58:00] [INFO ] Flatten gal took : 10 ms
[2025-06-06 14:58:00] [INFO ] Time to serialize gal into /tmp/LTL15487132649946083562.gal : 1 ms
[2025-06-06 14:58:00] [INFO ] Time to serialize properties into /tmp/LTL14455897777794216987.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15487132649946083562.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6105140248103180829.hoa' '-atoms' '/tmp/LTL14455897777794216987.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...319
Loading property file /tmp/LTL14455897777794216987.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6105140248103180829.hoa
Detected timeout of ITS tools.
[2025-06-06 14:58:15] [INFO ] Flatten gal took : 12 ms
[2025-06-06 14:58:15] [INFO ] Flatten gal took : 9 ms
[2025-06-06 14:58:15] [INFO ] Time to serialize gal into /tmp/LTL5611725422096830791.gal : 1 ms
[2025-06-06 14:58:15] [INFO ] Time to serialize properties into /tmp/LTL16324182202748716801.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/LTL5611725422096830791.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16324182202748716801.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((p74==0)||(p76==0))"))))
Formula 0 simplified : FG!"((p74==0)||(p76==0))"
Detected timeout of ITS tools.
[2025-06-06 14:58:30] [INFO ] Flatten gal took : 14 ms
[2025-06-06 14:58:30] [INFO ] Applying decomposition
[2025-06-06 14:58:30] [INFO ] Flatten gal took : 9 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/graph4980445153381539403.txt' '-o' '/tmp/graph4980445153381539403.bin' '-w' '/tmp/graph4980445153381539403.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4980445153381539403.bin' '-l' '-1' '-v' '-w' '/tmp/graph4980445153381539403.weights' '-q' '0' '-e' '0.001'
[2025-06-06 14:58:30] [INFO ] Decomposing Gal with order
[2025-06-06 14:58:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 14:58:30] [INFO ] Removed a total of 60 redundant transitions.
[2025-06-06 14:58:30] [INFO ] Flatten gal took : 16 ms
[2025-06-06 14:58:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 4 ms.
[2025-06-06 14:58:30] [INFO ] Time to serialize gal into /tmp/LTL2904479279354744229.gal : 4 ms
[2025-06-06 14:58:30] [INFO ] Time to serialize properties into /tmp/LTL8938319598289509.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/LTL2904479279354744229.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8938319598289509.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...251
Read 1 LTL properties
Checking formula 0 : !((G(F("((i2.i1.u26.p74==0)||(i2.i3.u27.p76==0))"))))
Formula 0 simplified : FG!"((i2.i1.u26.p74==0)||(i2.i3.u27.p76==0))"
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-010A-LTLFireability-09 finished in 259554 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 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 4 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 313 cols
[2025-06-06 14:58:45] [INFO ] Computed 111 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 14:58:45] [INFO ] Implicit Places using invariants in 167 ms returned []
[2025-06-06 14:58:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 14:58:45] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2025-06-06 14:58: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/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:58:54] [INFO ] Deduced a trap composed of 18 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-06 14:58:55] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 2/739 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:58:57] [INFO ] Deduced a trap composed of 11 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-06 14:58:58] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 2/741 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:58:59] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:59:02] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/576 variables, 1/743 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/576 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:59:09] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:59:09] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/576 variables, 2/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:59:11] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 14:59:12] [INFO ] Deduced a trap composed of 18 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-06 14:59:12] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/576 variables, 3/748 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 576/576 variables, and 748 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30008 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 11/435 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/748 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 262/1010 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1010 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30015 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60046ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 60047ms
Finished structural reductions in LTL mode , in 1 iterations and 60473 ms. Remains : 313/313 places, 263/263 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-12
Product exploration explored 100000 steps with 715 reset in 359 ms.
Product exploration explored 100000 steps with 684 reset in 385 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 p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 92 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 1173 steps (0 resets) in 9 ms. (117 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 102 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 59 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p1)]
[2025-06-06 14:59:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 14:59:47] [INFO ] [Real]Absence check using 111 positive place invariants in 65 ms returned sat
[2025-06-06 14:59:47] [INFO ] [Real]Absence check using state equation in 489 ms returned sat
[2025-06-06 14:59:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 14:59:48] [INFO ] [Nat]Absence check using 111 positive place invariants in 49 ms returned sat
[2025-06-06 14:59:48] [INFO ] [Nat]Absence check using state equation in 912 ms returned sat
[2025-06-06 14:59:48] [INFO ] Computed and/alt/rep : 262/723/262 causal constraints (skipped 0 transitions) in 17 ms.
[2025-06-06 15:00:02] [INFO ] Added : 252 causal constraints over 52 iterations in 13568 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 313 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 261
Applied a total of 4 rules in 15 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
// Phase 1: matrix 261 rows 311 cols
[2025-06-06 15:00:02] [INFO ] Computed 111 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:00:02] [INFO ] Implicit Places using invariants in 178 ms returned []
[2025-06-06 15:00:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:00:02] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 15:00:02] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2025-06-06 15:00:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:00:10] [INFO ] Deduced a trap composed of 11 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-06 15:00:11] [INFO ] Deduced a trap composed of 18 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-06 15:00:11] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:00:11] [INFO ] Deduced a trap composed of 18 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-06 15:00:11] [INFO ] Deduced a trap composed of 18 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-06 15:00:11] [INFO ] Deduced a trap composed of 18 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-06 15:00:11] [INFO ] Deduced a trap composed of 20 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-06 15:00:12] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 8/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (OVERLAPS) 0/572 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 741 constraints, problems are : Problem set: 0 solved, 260 unsolved in 19884 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 8/430 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/1001 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 1001 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30016 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49922ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 49922ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50377 ms. Remains : 311/313 places, 261/263 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
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 62 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 1277 steps (0 resets) in 18 ms. (67 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 86 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 56 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p1), (NOT p1)]
[2025-06-06 15:00:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 15:00:53] [INFO ] [Real]Absence check using 111 positive place invariants in 70 ms returned sat
[2025-06-06 15:00:54] [INFO ] [Real]Absence check using state equation in 576 ms returned sat
[2025-06-06 15:00:54] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 15:00:54] [INFO ] [Nat]Absence check using 111 positive place invariants in 57 ms returned sat
[2025-06-06 15:00:54] [INFO ] [Nat]Absence check using state equation in 411 ms returned sat
[2025-06-06 15:00:54] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 13 ms.
[2025-06-06 15:01:01] [INFO ] Added : 237 causal constraints over 48 iterations in 6369 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 355 reset in 343 ms.
Product exploration explored 100000 steps with 349 reset in 377 ms.
Built C files in :
/tmp/ltsmin12094722186430679841
[2025-06-06 15:01:01] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2025-06-06 15:01:01] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 15:01:01] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2025-06-06 15:01:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 15:01:01] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2025-06-06 15:01:01] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 15:01:01] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12094722186430679841
Running compilation step : cd /tmp/ltsmin12094722186430679841;'/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 512 ms.
Running link step : cd /tmp/ltsmin12094722186430679841;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin12094722186430679841;'/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/stateBased8996012254699333610.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 14 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2025-06-06 15:01:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:01:17] [INFO ] Implicit Places using invariants in 135 ms returned []
[2025-06-06 15:01:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:01:17] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 15:01:17] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2025-06-06 15:01:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:01:24] [INFO ] Deduced a trap composed of 11 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-06 15:01:25] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:01:25] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:01:25] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:01:25] [INFO ] Deduced a trap composed of 18 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-06 15:01:25] [INFO ] Deduced a trap composed of 18 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-06 15:01:26] [INFO ] Deduced a trap composed of 20 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-06 15:01:26] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 8/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (OVERLAPS) 0/572 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 741 constraints, problems are : Problem set: 0 solved, 260 unsolved in 19730 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 8/430 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/1001 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 1001 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30020 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49772ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 49773ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 50182 ms. Remains : 311/311 places, 261/261 transitions.
Built C files in :
/tmp/ltsmin3962609981105316026
[2025-06-06 15:02:07] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2025-06-06 15:02:07] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 15:02:07] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2025-06-06 15:02:07] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 15:02:07] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2025-06-06 15:02:07] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 15:02:07] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3962609981105316026
Running compilation step : cd /tmp/ltsmin3962609981105316026;'/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 524 ms.
Running link step : cd /tmp/ltsmin3962609981105316026;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin3962609981105316026;'/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/stateBased1982192823824755904.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-06 15:02:22] [INFO ] Flatten gal took : 8 ms
[2025-06-06 15:02:22] [INFO ] Flatten gal took : 8 ms
[2025-06-06 15:02:22] [INFO ] Time to serialize gal into /tmp/LTL14104328332931781810.gal : 1 ms
[2025-06-06 15:02:22] [INFO ] Time to serialize properties into /tmp/LTL8432274285212607130.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14104328332931781810.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10551646288426728842.hoa' '-atoms' '/tmp/LTL8432274285212607130.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...319
Loading property file /tmp/LTL8432274285212607130.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10551646288426728842.hoa
Detected timeout of ITS tools.
[2025-06-06 15:02:37] [INFO ] Flatten gal took : 9 ms
[2025-06-06 15:02:37] [INFO ] Flatten gal took : 8 ms
[2025-06-06 15:02:37] [INFO ] Time to serialize gal into /tmp/LTL18370635313112362000.gal : 1 ms
[2025-06-06 15:02:37] [INFO ] Time to serialize properties into /tmp/LTL573355249495073706.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/LTL18370635313112362000.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL573355249495073706.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 : !(((X("((((p49==1)&&(p60==1))||(p67==0))||(p86==0))"))&&(F("((p67==1)&&(p86==1))"))))
Formula 0 simplified : X!"((((p49==1)&&(p60==1))||(p67==0))||(p86==0))" | G!"((p67==1)&&(p86==1))"
Detected timeout of ITS tools.
[2025-06-06 15:02:52] [INFO ] Flatten gal took : 9 ms
[2025-06-06 15:02:52] [INFO ] Applying decomposition
[2025-06-06 15:02:52] [INFO ] Flatten gal took : 8 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/graph11232633324132634083.txt' '-o' '/tmp/graph11232633324132634083.bin' '-w' '/tmp/graph11232633324132634083.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11232633324132634083.bin' '-l' '-1' '-v' '-w' '/tmp/graph11232633324132634083.weights' '-q' '0' '-e' '0.001'
[2025-06-06 15:02:52] [INFO ] Decomposing Gal with order
[2025-06-06 15:02:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 15:02:52] [INFO ] Removed a total of 60 redundant transitions.
[2025-06-06 15:02:52] [INFO ] Flatten gal took : 16 ms
[2025-06-06 15:02:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 4 ms.
[2025-06-06 15:02:52] [INFO ] Time to serialize gal into /tmp/LTL361967325916334354.gal : 3 ms
[2025-06-06 15:02:52] [INFO ] Time to serialize properties into /tmp/LTL14675435229083353438.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/LTL361967325916334354.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14675435229083353438.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...254
Read 1 LTL properties
Checking formula 0 : !(((X("((((i1.i2.u18.p49==1)&&(i1.i2.u21.p60==1))||(i2.i1.u24.p67==0))||(i2.i0.u31.p86==0))"))&&(F("((i2.i1.u24.p67==1)&&(i2.i0.u31.p8...166
Formula 0 simplified : X!"((((i1.i2.u18.p49==1)&&(i1.i2.u21.p60==1))||(i2.i1.u24.p67==0))||(i2.i0.u31.p86==0))" | G!"((i2.i1.u24.p67==1)&&(i2.i0.u31.p86==1...158
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-010A-LTLFireability-12 finished in 262272 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 3 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 313 cols
[2025-06-06 15:03:07] [INFO ] Computed 111 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:03:07] [INFO ] Implicit Places using invariants in 150 ms returned []
[2025-06-06 15:03:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:03:08] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2025-06-06 15:03:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:03:16] [INFO ] Deduced a trap composed of 18 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-06 15:03:17] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 2/739 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:03:19] [INFO ] Deduced a trap composed of 11 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-06 15:03:20] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 2/741 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:03:21] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:03:24] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/576 variables, 1/743 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/576 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:03:31] [INFO ] Deduced a trap composed of 18 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-06 15:03:31] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/576 variables, 2/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:03:33] [INFO ] Deduced a trap composed of 12 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-06 15:03:34] [INFO ] Deduced a trap composed of 18 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-06 15:03:34] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/576 variables, 3/748 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 576/576 variables, and 748 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30010 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 11/435 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/748 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 262/1010 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1010 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30013 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60041ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 60042ms
Finished structural reductions in LTL mode , in 1 iterations and 60437 ms. Remains : 313/313 places, 263/263 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-13
Stuttering criterion allowed to conclude after 4119 steps with 12 reset in 18 ms.
FORMULA ShieldPPPs-PT-010A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010A-LTLFireability-13 finished in 60542 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)||G((F(p2)&&F(p3)))))))'
Support contains 7 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 261
Applied a total of 4 rules in 19 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
// Phase 1: matrix 261 rows 311 cols
[2025-06-06 15:04:08] [INFO ] Computed 111 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:04:08] [INFO ] Implicit Places using invariants in 146 ms returned []
[2025-06-06 15:04:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:04:08] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 15:04:08] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2025-06-06 15:04:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:04:16] [INFO ] Deduced a trap composed of 11 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-06 15:04:16] [INFO ] Deduced a trap composed of 18 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-06 15:04:16] [INFO ] Deduced a trap composed of 11 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-06 15:04:17] [INFO ] Deduced a trap composed of 18 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-06 15:04:17] [INFO ] Deduced a trap composed of 18 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-06 15:04:17] [INFO ] Deduced a trap composed of 18 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-06 15:04:17] [INFO ] Deduced a trap composed of 20 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-06 15:04:18] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 8/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (OVERLAPS) 0/572 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 741 constraints, problems are : Problem set: 0 solved, 260 unsolved in 19435 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 8/430 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/1001 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 1001 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30011 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49465ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 49466ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49887 ms. Remains : 311/313 places, 261/263 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p3))]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-14
Product exploration explored 100000 steps with 375 reset in 390 ms.
Product exploration explored 100000 steps with 370 reset in 423 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT p2)), (X (AND (NOT p1) (NOT p3) (NOT p0))), (X (NOT p3)), (X (NOT (AND p1 (NOT p3) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (NOT p3))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 104 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter insensitive) to 3 states, 7 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3))]
RANDOM walk for 1856 steps (0 resets) in 22 ms. (80 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT p2)), (X (AND (NOT p1) (NOT p3) (NOT p0))), (X (NOT p3)), (X (NOT (AND p1 (NOT p3) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (NOT p3))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (F (NOT (OR p0 (NOT p1) p2))), (F p0), (F (NOT (OR p0 (NOT p1) p3))), (F p2), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F p3), (F p1)]
Knowledge based reduction with 17 factoid took 336 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter insensitive) to 3 states, 7 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 107 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3))]
[2025-06-06 15:04:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 15:05:00] [INFO ] [Real]Absence check using 111 positive place invariants in 41 ms returned sat
[2025-06-06 15:05:00] [INFO ] [Real]Absence check using state equation in 476 ms returned sat
[2025-06-06 15:05:00] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 15:05:00] [INFO ] [Nat]Absence check using 111 positive place invariants in 43 ms returned sat
[2025-06-06 15:05:01] [INFO ] [Nat]Absence check using state equation in 484 ms returned sat
[2025-06-06 15:05:01] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 14 ms.
[2025-06-06 15:05:07] [INFO ] Added : 252 causal constraints over 51 iterations in 5989 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2))
[2025-06-06 15:05:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 15:05:07] [INFO ] [Real]Absence check using 111 positive place invariants in 40 ms returned sat
[2025-06-06 15:05:07] [INFO ] [Real]Absence check using state equation in 490 ms returned sat
[2025-06-06 15:05:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 15:05:08] [INFO ] [Nat]Absence check using 111 positive place invariants in 41 ms returned sat
[2025-06-06 15:05:08] [INFO ] [Nat]Absence check using state equation in 403 ms returned sat
[2025-06-06 15:05:08] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 12 ms.
[2025-06-06 15:05:19] [INFO ] Added : 260 causal constraints over 53 iterations in 10653 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p3))
Support contains 7 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 13 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2025-06-06 15:05:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:05:19] [INFO ] Implicit Places using invariants in 145 ms returned []
[2025-06-06 15:05:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:05:19] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 15:05:19] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2025-06-06 15:05:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:05:27] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:05:27] [INFO ] Deduced a trap composed of 18 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-06 15:05:27] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:05:27] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:05:27] [INFO ] Deduced a trap composed of 18 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-06 15:05:28] [INFO ] Deduced a trap composed of 18 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-06 15:05:28] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:05:29] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 8/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (OVERLAPS) 0/572 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 741 constraints, problems are : Problem set: 0 solved, 260 unsolved in 19689 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 8/430 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/1001 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 1)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 1)
(s25 0)
(s26 1)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 1)
(s39 0)
(s40 1)
(s41 1)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 1)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 0)
(s54 0)
(s55 1)
(s56 0)
(s57 1)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 1)
(s64 0)
(s65 1)
(s66 0)
(s67 0)
(s68 0)
(s69 1)
(s70 0)
(s71 1)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 1)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 1)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s100 1)
(s101 0)
(s102 1)
(s103 1)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 1)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 1)
(s118 0)
(s119 1)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 1)
(s132 0)
(s133 1)
(s134 0)
(s135 1)
(s136 0)
(s137 0)
(s138 1)
(s139 1)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 1)
(s148 0)
(s149 1)
(s150 1)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 1)
(s156 0)
(s157 0)
(s158 1)
(s159 0)
(s160 0)
(s161 1)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 1)
(s167 0)
(s168 1)
(s169 0)
(s170 0)
(s171 1)
(s172 0)
(s173 1)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 1)
(s179 1)
(s180 0)
(s181 1)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 1)
(s189 1)
(s190 0)
(s191 1)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 1)
(s198 0)
(s199 1)
(s200 0)
(s201 0)
(s202 0)
(s203 1)
(s204 1)
(s205 0)
(s206 0)
(s207 1)
(s208 0)
(s209 0)
(s210 1)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 1)
(s216 0)
(s217 0)
(s218 0)
(s219 1)
(s220 0)
(s221 1)
(s222 1)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 1)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 1)
(s235 1)
(s236 0)
(s237 0)
(s238 1)
(s239 0)
(s240 0)
(s241 1)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 1)
(s247 0)
(s248 0)
(s249 0)
(s250 1)
(s251 0)
(s252 1)
(s253 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 1001 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30018 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49726ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 49728ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 50141 ms. Remains : 311/311 places, 261/261 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (AND (NOT p0) (NOT p1) (NOT p3))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 92 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter insensitive) to 3 states, 7 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3))]
RANDOM walk for 1769 steps (1 resets) in 17 ms. (98 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (AND (NOT p0) (NOT p1) (NOT p3))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (F (NOT (OR p0 (NOT p1) p2))), (F p0), (F (NOT (OR p0 (NOT p1) p3))), (F p2), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F p3), (F p1)]
Knowledge based reduction with 17 factoid took 324 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter insensitive) to 3 states, 7 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 115 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3))]
[2025-06-06 15:06:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 15:06:10] [INFO ] [Real]Absence check using 111 positive place invariants in 41 ms returned sat
[2025-06-06 15:06:10] [INFO ] [Real]Absence check using state equation in 482 ms returned sat
[2025-06-06 15:06:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 15:06:10] [INFO ] [Nat]Absence check using 111 positive place invariants in 43 ms returned sat
[2025-06-06 15:06:11] [INFO ] [Nat]Absence check using state equation in 473 ms returned sat
[2025-06-06 15:06:11] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 14 ms.
[2025-06-06 15:06:17] [INFO ] Added : 252 causal constraints over 51 iterations in 5907 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2))
[2025-06-06 15:06:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 15:06:17] [INFO ] [Real]Absence check using 111 positive place invariants in 41 ms returned sat
[2025-06-06 15:06:17] [INFO ] [Real]Absence check using state equation in 492 ms returned sat
[2025-06-06 15:06:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 15:06:18] [INFO ] [Nat]Absence check using 111 positive place invariants in 39 ms returned sat
[2025-06-06 15:06:18] [INFO ] [Nat]Absence check using state equation in 399 ms returned sat
[2025-06-06 15:06:18] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 11 ms.
[2025-06-06 15:06:28] [INFO ] Added : 260 causal constraints over 53 iterations in 10121 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p3))
Stuttering acceptance computed with spot in 136 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 374 reset in 368 ms.
Product exploration explored 100000 steps with 374 reset in 405 ms.
Built C files in :
/tmp/ltsmin1415329349152993298
[2025-06-06 15:06:29] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2025-06-06 15:06:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 15:06:29] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2025-06-06 15:06:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 15:06:29] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2025-06-06 15:06:29] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 15:06:29] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1415329349152993298
Running compilation step : cd /tmp/ltsmin1415329349152993298;'/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 525 ms.
Running link step : cd /tmp/ltsmin1415329349152993298;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin1415329349152993298;'/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/stateBased10389313807107590710.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 13 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2025-06-06 15:06:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:06:44] [INFO ] Implicit Places using invariants in 150 ms returned []
[2025-06-06 15:06:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:06:45] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 15:06:45] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2025-06-06 15:06: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/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:06:52] [INFO ] Deduced a trap composed of 11 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-06 15:06:53] [INFO ] Deduced a trap composed of 18 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-06 15:06:53] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:06:53] [INFO ] Deduced a trap composed of 18 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-06 15:06:53] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:06:53] [INFO ] Deduced a trap composed of 18 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-06 15:06:53] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:06:54] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 8/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (OVERLAPS) 0/572 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 741 constraints, problems are : Problem set: 0 solved, 260 unsolved in 19465 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 8/430 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/1001 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 1001 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30022 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49509ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 49509ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49960 ms. Remains : 311/311 places, 261/261 transitions.
Built C files in :
/tmp/ltsmin1761634708923963720
[2025-06-06 15:07:34] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2025-06-06 15:07:34] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 15:07:34] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2025-06-06 15:07:34] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 15:07:34] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2025-06-06 15:07:34] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 15:07:34] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1761634708923963720
Running compilation step : cd /tmp/ltsmin1761634708923963720;'/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 531 ms.
Running link step : cd /tmp/ltsmin1761634708923963720;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1761634708923963720;'/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/stateBased10338442438565999757.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-06 15:07:49] [INFO ] Flatten gal took : 10 ms
[2025-06-06 15:07:49] [INFO ] Flatten gal took : 8 ms
[2025-06-06 15:07:49] [INFO ] Time to serialize gal into /tmp/LTL11963626486133646752.gal : 1 ms
[2025-06-06 15:07:49] [INFO ] Time to serialize properties into /tmp/LTL393466718113864206.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11963626486133646752.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3931766566834390500.hoa' '-atoms' '/tmp/LTL393466718113864206.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/LTL393466718113864206.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3931766566834390500.hoa
Detected timeout of ITS tools.
[2025-06-06 15:08:04] [INFO ] Flatten gal took : 8 ms
[2025-06-06 15:08:04] [INFO ] Flatten gal took : 8 ms
[2025-06-06 15:08:04] [INFO ] Time to serialize gal into /tmp/LTL17979540290724035435.gal : 1 ms
[2025-06-06 15:08:04] [INFO ] Time to serialize properties into /tmp/LTL16474163322357792967.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/LTL17979540290724035435.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16474163322357792967.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(((G("(p269==1)"))||(G((F("((p101==1)&&(p122==1))"))&&(F("((p223==1)&&(p239==1))")))))||("((p1==1)&&(p26==1))")))))
Formula 0 simplified : G(F!"(p269==1)" & F(G!"((p101==1)&&(p122==1))" | G!"((p223==1)&&(p239==1))") & FG!"((p1==1)&&(p26==1))")
Detected timeout of ITS tools.
[2025-06-06 15:08:19] [INFO ] Flatten gal took : 10 ms
[2025-06-06 15:08:19] [INFO ] Applying decomposition
[2025-06-06 15:08:19] [INFO ] Flatten gal took : 7 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/graph14098006452269184458.txt' '-o' '/tmp/graph14098006452269184458.bin' '-w' '/tmp/graph14098006452269184458.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14098006452269184458.bin' '-l' '-1' '-v' '-w' '/tmp/graph14098006452269184458.weights' '-q' '0' '-e' '0.001'
[2025-06-06 15:08:20] [INFO ] Decomposing Gal with order
[2025-06-06 15:08:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 15:08:20] [INFO ] Removed a total of 60 redundant transitions.
[2025-06-06 15:08:20] [INFO ] Flatten gal took : 15 ms
[2025-06-06 15:08:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 4 ms.
[2025-06-06 15:08:20] [INFO ] Time to serialize gal into /tmp/LTL18307581188784094507.gal : 3 ms
[2025-06-06 15:08:20] [INFO ] Time to serialize properties into /tmp/LTL14136204342197320466.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/LTL18307581188784094507.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14136204342197320466.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...256
Read 1 LTL properties
Checking formula 0 : !((G(F(((G("(i8.i0.u96.p269==1)"))||(G((F("((i3.i3.u36.p101==1)&&(i3.i3.u43.p122==1))"))&&(F("((i7.i2.u79.p223==1)&&(i7.i2.u85.p239==1...211
Formula 0 simplified : G(F!"(i8.i0.u96.p269==1)" & F(G!"((i3.i3.u36.p101==1)&&(i3.i3.u43.p122==1))" | G!"((i7.i2.u79.p223==1)&&(i7.i2.u85.p239==1))") & FG!...196
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-010A-LTLFireability-14 finished in 266953 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&&(p1||F(p2))))))'
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 312 transition count 262
Applied a total of 2 rules in 13 ms. Remains 312 /313 variables (removed 1) and now considering 262/263 (removed 1) transitions.
// Phase 1: matrix 262 rows 312 cols
[2025-06-06 15:08:35] [INFO ] Computed 111 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:08:35] [INFO ] Implicit Places using invariants in 148 ms returned []
[2025-06-06 15:08:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:08:35] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 15:08:35] [INFO ] Redundant transitions in 0 ms returned []
Running 261 sub problems to find dead transitions.
[2025-06-06 15:08:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 311/311 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 111/422 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 262/574 variables, 312/735 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:08:43] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:08:43] [INFO ] Deduced a trap composed of 11 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-06 15:08:43] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:08:43] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:08:43] [INFO ] Deduced a trap composed of 18 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-06 15:08:43] [INFO ] Deduced a trap composed of 18 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-06 15:08:44] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:08:44] [INFO ] Deduced a trap composed of 18 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-06 15:08:44] [INFO ] Deduced a trap composed of 18 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-06 15:08:44] [INFO ] Deduced a trap composed of 18 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-06 15:08:44] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:08:45] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 12/747 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:08:51] [INFO ] Deduced a trap along path composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 1/748 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (OVERLAPS) 0/574 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 748 constraints, problems are : Problem set: 0 solved, 261 unsolved in 28400 ms.
Refiners :[Domain max(s): 312/312 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 311/311 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 111/422 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 12/435 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 262/574 variables, 312/747 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 261/1008 constraints. Problems are: Problem set: 0 solved, 261 unsolved
SMT process timed out in 58432ms, After SMT, problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 58433ms
Starting structural reductions in SI_LTL mode, iteration 1 : 312/313 places, 262/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58835 ms. Remains : 312/313 places, 262/263 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-15
Product exploration explored 100000 steps with 7511 reset in 293 ms.
Product exploration explored 100000 steps with 7251 reset in 340 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 p0 (NOT p1) p2), (X p2), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 123 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (55 resets) in 210 ms. (189 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 1/1 properties
[2025-06-06 15:09:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 6/10 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 302/312 variables, 108/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 302/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 262/574 variables, 312/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/574 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 735 constraints, problems are : Problem set: 0 solved, 1 unsolved in 149 ms.
Refiners :[Domain max(s): 312/312 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf5 is UNSAT
After SMT solving in domain Int declared 4/574 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 41 ms.
Refiners :[Domain max(s): 4/312 constraints, Positive P Invariants (semi-flows): 0/111 constraints, State Equation: 0/312 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 195ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (G (OR p2 (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (AND (OR p2 p0) (OR p2 p1))))]
Knowledge based reduction with 14 factoid took 326 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 262/262 transitions.
Applied a total of 0 rules in 10 ms. Remains 312 /312 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2025-06-06 15:09:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:09:35] [INFO ] Implicit Places using invariants in 169 ms returned []
[2025-06-06 15:09:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:09:36] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 15:09:36] [INFO ] Redundant transitions in 1 ms returned []
Running 261 sub problems to find dead transitions.
[2025-06-06 15:09:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 311/311 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 111/422 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 262/574 variables, 312/735 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:09:43] [INFO ] Deduced a trap composed of 11 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-06 15:09:43] [INFO ] Deduced a trap composed of 11 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-06 15:09:44] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:09:44] [INFO ] Deduced a trap composed of 18 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-06 15:09:44] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:09:44] [INFO ] Deduced a trap composed of 18 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-06 15:09:44] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:09:45] [INFO ] Deduced a trap composed of 18 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-06 15:09:45] [INFO ] Deduced a trap composed of 18 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-06 15:09:45] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:09:45] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:09:46] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 12/747 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:09:51] [INFO ] Deduced a trap along path composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 1/748 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (OVERLAPS) 0/574 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 748 constraints, problems are : Problem set: 0 solved, 261 unsolved in 28769 ms.
Refiners :[Domain max(s): 312/312 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 311/311 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 111/422 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 12/435 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 262/574 variables, 312/747 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 261/1008 constraints. Problems are: Problem set: 0 solved, 261 unsolved
SMT process timed out in 58806ms, After SMT, problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 58808ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 59263 ms. Remains : 312/312 places, 262/262 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p2), (X p2), (X (NOT (AND (NOT p2) p0))), (X p0), (X (X (NOT p2))), (X (X (AND (NOT p2) p0))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 100 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
RANDOM walk for 18 steps (0 resets) in 6 ms. (2 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p2), (X p2), (X (NOT (AND (NOT p2) p0))), (X p0), (X (X (NOT p2))), (X (X (AND (NOT p2) p0))), (X (X p0))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0)), (F (NOT (OR p2 (NOT p0))))]
Knowledge based reduction with 7 factoid took 179 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 7609 reset in 322 ms.
Product exploration explored 100000 steps with 6964 reset in 393 ms.
Built C files in :
/tmp/ltsmin16067737385242581220
[2025-06-06 15:10:36] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2025-06-06 15:10:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 15:10:36] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2025-06-06 15:10:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 15:10:36] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2025-06-06 15:10:36] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 15:10:36] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16067737385242581220
Running compilation step : cd /tmp/ltsmin16067737385242581220;'/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 549 ms.
Running link step : cd /tmp/ltsmin16067737385242581220;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin16067737385242581220;'/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/stateBased9924712091460784629.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 262/262 transitions.
Applied a total of 0 rules in 10 ms. Remains 312 /312 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2025-06-06 15:10:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:10:51] [INFO ] Implicit Places using invariants in 160 ms returned []
[2025-06-06 15:10:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:10:51] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 15:10:51] [INFO ] Redundant transitions in 1 ms returned []
Running 261 sub problems to find dead transitions.
[2025-06-06 15:10:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 311/311 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 111/422 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 262/574 variables, 312/735 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:10:59] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:10:59] [INFO ] Deduced a trap composed of 11 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-06 15:10:59] [INFO ] Deduced a trap composed of 18 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-06 15:11:00] [INFO ] Deduced a trap composed of 18 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-06 15:11:00] [INFO ] Deduced a trap composed of 18 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-06 15:11:00] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:11:00] [INFO ] Deduced a trap composed of 18 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-06 15:11:00] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:11:00] [INFO ] Deduced a trap composed of 18 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-06 15:11:00] [INFO ] Deduced a trap composed of 18 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-06 15:11:01] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:11:01] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 12/747 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:11:07] [INFO ] Deduced a trap along path composed of 16 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 1/748 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (OVERLAPS) 0/574 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 748 constraints, problems are : Problem set: 0 solved, 261 unsolved in 28180 ms.
Refiners :[Domain max(s): 312/312 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 311/311 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 111/422 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 12/435 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 262/574 variables, 312/747 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 261/1008 constraints. Problems are: Problem set: 0 solved, 261 unsolved
SMT process timed out in 58221ms, After SMT, problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 58223ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 58666 ms. Remains : 312/312 places, 262/262 transitions.
Built C files in :
/tmp/ltsmin10832554895861761922
[2025-06-06 15:11:50] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2025-06-06 15:11:50] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 15:11:50] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2025-06-06 15:11:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 15:11:50] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2025-06-06 15:11:50] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 15:11:50] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10832554895861761922
Running compilation step : cd /tmp/ltsmin10832554895861761922;'/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 536 ms.
Running link step : cd /tmp/ltsmin10832554895861761922;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin10832554895861761922;'/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/stateBased7540357165936996211.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-06 15:12:05] [INFO ] Flatten gal took : 10 ms
[2025-06-06 15:12:05] [INFO ] Flatten gal took : 7 ms
[2025-06-06 15:12:05] [INFO ] Time to serialize gal into /tmp/LTL2564530659730475958.gal : 1 ms
[2025-06-06 15:12:05] [INFO ] Time to serialize properties into /tmp/LTL5265826160803652977.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2564530659730475958.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10627108683176700401.hoa' '-atoms' '/tmp/LTL5265826160803652977.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5265826160803652977.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10627108683176700401.hoa
Detected timeout of ITS tools.
[2025-06-06 15:12:20] [INFO ] Flatten gal took : 7 ms
[2025-06-06 15:12:20] [INFO ] Flatten gal took : 7 ms
[2025-06-06 15:12:20] [INFO ] Time to serialize gal into /tmp/LTL4257101318744930992.gal : 2 ms
[2025-06-06 15:12:20] [INFO ] Time to serialize properties into /tmp/LTL3481409654498797561.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/LTL4257101318744930992.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3481409654498797561.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 : !((F(G(("((p296==0)||(p298==0))")&&((F("((p295==0)||(p312==0))"))||("((p296==1)&&(p298==1))"))))))
Formula 0 simplified : GF(!"((p296==0)||(p298==0))" | (!"((p296==1)&&(p298==1))" & G!"((p295==0)||(p312==0))"))
Detected timeout of ITS tools.
[2025-06-06 15:12:35] [INFO ] Flatten gal took : 13 ms
[2025-06-06 15:12:35] [INFO ] Applying decomposition
[2025-06-06 15:12:35] [INFO ] Flatten gal took : 7 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/graph2994325586754472960.txt' '-o' '/tmp/graph2994325586754472960.bin' '-w' '/tmp/graph2994325586754472960.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2994325586754472960.bin' '-l' '-1' '-v' '-w' '/tmp/graph2994325586754472960.weights' '-q' '0' '-e' '0.001'
[2025-06-06 15:12:35] [INFO ] Decomposing Gal with order
[2025-06-06 15:12:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 15:12:35] [INFO ] Removed a total of 60 redundant transitions.
[2025-06-06 15:12:35] [INFO ] Flatten gal took : 30 ms
[2025-06-06 15:12:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 126 labels/synchronizations in 5 ms.
[2025-06-06 15:12:35] [INFO ] Time to serialize gal into /tmp/LTL4473615825320672555.gal : 2 ms
[2025-06-06 15:12:35] [INFO ] Time to serialize properties into /tmp/LTL8088167270212823798.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/LTL4473615825320672555.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8088167270212823798.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...254
Read 1 LTL properties
Checking formula 0 : !((F(G(("((i9.i0.i1.u105.p296==0)||(i9.i0.i1.u106.p298==0))")&&((F("((i9.i0.i1.u105.p295==0)||(i9.i1.i2.u110.p312==0))"))||("((i9.i0.i...203
Formula 0 simplified : GF(!"((i9.i0.i1.u105.p296==0)||(i9.i0.i1.u106.p298==0))" | (!"((i9.i0.i1.u105.p296==1)&&(i9.i0.i1.u106.p298==1))" & G!"((i9.i0.i1.u1...195
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-010A-LTLFireability-15 finished in 255531 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(p0))||(F(G(p1))&&F(p2)))))'
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)))'
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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)||G((F(p2)&&F(p3)))))))'
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&&(p1||F(p2))))))'
[2025-06-06 15:12:51] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1525375335428777682
[2025-06-06 15:12:51] [INFO ] Applying decomposition
[2025-06-06 15:12:51] [INFO ] Computing symmetric may disable matrix : 263 transitions.
[2025-06-06 15:12:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 15:12:51] [INFO ] Computing symmetric may enable matrix : 263 transitions.
[2025-06-06 15:12:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 15:12:51] [INFO ] Flatten gal took : 7 ms
[2025-06-06 15:12:51] [INFO ] Computing Do-Not-Accords matrix : 263 transitions.
[2025-06-06 15:12:51] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 15:12:51] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1525375335428777682
Running compilation step : cd /tmp/ltsmin1525375335428777682;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '144' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8225438859022370398.txt' '-o' '/tmp/graph8225438859022370398.bin' '-w' '/tmp/graph8225438859022370398.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8225438859022370398.bin' '-l' '-1' '-v' '-w' '/tmp/graph8225438859022370398.weights' '-q' '0' '-e' '0.001'
[2025-06-06 15:12:51] [INFO ] Decomposing Gal with order
[2025-06-06 15:12:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 15:12:51] [INFO ] Removed a total of 60 redundant transitions.
[2025-06-06 15:12:51] [INFO ] Flatten gal took : 13 ms
[2025-06-06 15:12:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 124 labels/synchronizations in 4 ms.
[2025-06-06 15:12:51] [INFO ] Time to serialize gal into /tmp/LTLFireability5313900282952357856.gal : 3 ms
[2025-06-06 15:12:51] [INFO ] Time to serialize properties into /tmp/LTLFireability14828096684976483051.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5313900282952357856.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14828096684976483051.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 5 LTL properties
Checking formula 0 : !((G((X(F("((i1.i0.u12.p35==1)&&(i1.i0.u20.p56==1))")))||((F(G("((i3.i1.u35.p99==1)&&(i3.i1.u41.p116==1))")))&&(F("(i0.i2.u10.p27==1)"...161
Formula 0 simplified : F(XG!"((i1.i0.u12.p35==1)&&(i1.i0.u20.p56==1))" & (GF!"((i3.i1.u35.p99==1)&&(i3.i1.u41.p116==1))" | G!"(i0.i2.u10.p27==1)"))
Compilation finished in 522 ms.
Running link step : cd /tmp/ltsmin1525375335428777682;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin1525375335428777682;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X(<>((LTLAPp0==true)))||(<>([]((LTLAPp1==true)))&&<>((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin1525375335428777682;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X(<>((LTLAPp0==true)))||(<>([]((LTLAPp1==true)))&&<>((LTLAPp2==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1525375335428777682;'/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' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin1525375335428777682;'/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' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1525375335428777682;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X((LTLAPp4==true))&&<>((LTLAPp5==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin1525375335428777682;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X((LTLAPp4==true))&&<>((LTLAPp5==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1525375335428777682;'/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' '[](<>(((LTLAPp6==true)||[]((LTLAPp7==true))||[]((<>((LTLAPp8==true))&&<>((LTLAPp9==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin1525375335428777682;'/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' '[](<>(((LTLAPp6==true)||[]((LTLAPp7==true))||[]((<>((LTLAPp8==true))&&<>((LTLAPp9==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1525375335428777682;'/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' '<>([](((LTLAPp10==true)&&((LTLAPp11==true)||<>((LTLAPp12==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin1525375335428777682;'/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' '<>([](((LTLAPp10==true)&&((LTLAPp11==true)||<>((LTLAPp12==true))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 5760 s
Running LTSmin : cd /tmp/ltsmin1525375335428777682;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X(<>((LTLAPp0==true)))||(<>([]((LTLAPp1==true)))&&<>((LTLAPp2==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.011: LTL layer: formula: []((X(<>((LTLAPp0==true)))||(<>([]((LTLAPp1==true)))&&<>((LTLAPp2==true)))))
pins2lts-mc-linux64( 4/ 8), 0.011: "[]((X(<>((LTLAPp0==true)))||(<>([]((LTLAPp1==true)))&&<>((LTLAPp2==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.011: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.058: There are 277 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.058: State length is 314, there are 271 groups
pins2lts-mc-linux64( 0/ 8), 0.058: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.058: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.058: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.058: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.134: [Blue] ~117 levels ~960 states ~7512 transitions
pins2lts-mc-linux64( 6/ 8), 0.210: [Blue] ~224 levels ~1920 states ~15352 transitions
pins2lts-mc-linux64( 1/ 8), 0.297: [Blue] ~441 levels ~3840 states ~27760 transitions
pins2lts-mc-linux64( 1/ 8), 0.354: [Blue] ~471 levels ~7680 states ~34056 transitions
pins2lts-mc-linux64( 1/ 8), 0.469: [Blue] ~471 levels ~15360 states ~48032 transitions
pins2lts-mc-linux64( 6/ 8), 0.680: [Blue] ~565 levels ~30720 states ~82864 transitions
pins2lts-mc-linux64( 6/ 8), 1.057: [Blue] ~565 levels ~61440 states ~147024 transitions
pins2lts-mc-linux64( 6/ 8), 1.665: [Blue] ~565 levels ~122880 states ~279728 transitions
pins2lts-mc-linux64( 6/ 8), 2.813: [Blue] ~605 levels ~245760 states ~547320 transitions
pins2lts-mc-linux64( 6/ 8), 4.857: [Blue] ~701 levels ~491520 states ~1094768 transitions
pins2lts-mc-linux64( 7/ 8), 8.327: [Blue] ~544 levels ~983040 states ~2745176 transitions
pins2lts-mc-linux64( 3/ 8), 14.690: [Blue] ~544 levels ~1966080 states ~6280160 transitions
pins2lts-mc-linux64( 3/ 8), 27.787: [Blue] ~544 levels ~3932160 states ~13279640 transitions
pins2lts-mc-linux64( 3/ 8), 53.611: [Blue] ~547 levels ~7864320 states ~24998920 transitions
pins2lts-mc-linux64( 6/ 8), 105.456: [Blue] ~701 levels ~15728640 states ~45525648 transitions
pins2lts-mc-linux64( 6/ 8), 209.726: [Blue] ~701 levels ~31457280 states ~95493664 transitions
pins2lts-mc-linux64( 6/ 8), 422.877: [Blue] ~749 levels ~62914560 states ~194145056 transitions
pins2lts-mc-linux64( 5/ 8), 522.099: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 522.125:
pins2lts-mc-linux64( 0/ 8), 522.125: Explored 75559541 states 258801063 transitions, fanout: 3.425
pins2lts-mc-linux64( 0/ 8), 522.125: Total exploration time 522.060 sec (522.030 sec minimum, 522.040 sec on average)
pins2lts-mc-linux64( 0/ 8), 522.125: States per second: 144733, Transitions per second: 495730
pins2lts-mc-linux64( 0/ 8), 522.125:
pins2lts-mc-linux64( 0/ 8), 522.125: State space has 75394327 states, 74955020 are accepting
pins2lts-mc-linux64( 0/ 8), 522.125: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 522.125: blue states: 75559541 (100.22%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 522.125: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 522.125: all-red states: 74955020 (99.42%), bogus 181963 (0.24%)
pins2lts-mc-linux64( 0/ 8), 522.125:
pins2lts-mc-linux64( 0/ 8), 522.125: Total memory used for local state coloring: 0.1MB
pins2lts-mc-linux64( 0/ 8), 522.125:
pins2lts-mc-linux64( 0/ 8), 522.125: Queue width: 8B, total height: 4573, memory: 0.03MB
pins2lts-mc-linux64( 0/ 8), 522.125: Tree memory: 831.2MB, 11.6 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 522.125: Tree fill ratio (roots/leafs): 56.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 522.125: Stored 264 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 522.125: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 522.125: Est. total memory use: 831.2MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1525375335428777682;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X(<>((LTLAPp0==true)))||(<>([]((LTLAPp1==true)))&&<>((LTLAPp2==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1525375335428777682;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X(<>((LTLAPp0==true)))||(<>([]((LTLAPp1==true)))&&<>((LTLAPp2==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:121)
at java.base/java.lang.Thread.run(Thread.java:1583)

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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