Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K 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:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rwxr-xr-x 1 mcc users 24K May 29 14:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749199916280

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TCPcondis-PT-40
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-06 08:51:58] [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 08:51:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 08:51:58] [WARNING] Skipping unknown tool specific annotation: Tina
[2025-06-06 08:51:58] [WARNING] Unknown XML tag in source file: size
[2025-06-06 08:51:58] [WARNING] Unknown XML tag in source file: color
[2025-06-06 08:51:58] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2025-06-06 08:51:58] [INFO ] Transformed 30 places.
[2025-06-06 08:51:58] [INFO ] Transformed 32 transitions.
[2025-06-06 08:51:58] [INFO ] Parsed PT model containing 30 places and 32 transitions and 108 arcs in 283 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA TCPcondis-PT-40-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-40-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-40-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-40-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 8 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2025-06-06 08:51:58] [INFO ] Computed 9 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:52:02] [INFO ] Implicit Places using invariants in 3576 ms returned []
[2025-06-06 08:52:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:52:02] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 3681 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2025-06-06 08:52: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/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 620 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 559 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1216ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 1229ms
Finished structural reductions in LTL mode , in 1 iterations and 4934 ms. Remains : 30/30 places, 32/32 transitions.
Support contains 23 out of 30 places after structural reductions.
[2025-06-06 08:52:03] [INFO ] Flatten gal took : 18 ms
[2025-06-06 08:52:03] [INFO ] Flatten gal took : 6 ms
[2025-06-06 08:52:03] [INFO ] Input system was already deterministic with 32 transitions.
Reduction of identical properties reduced properties to check from 23 to 20
RANDOM walk for 33134 steps (6 resets) in 110 ms. (298 steps per ms) remains 0/20 properties
FORMULA TCPcondis-PT-40-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X((X(!p1) U ((p0&&X(!p1))||X(G(!p1))))))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2025-06-06 08:52:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:52:04] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-06 08:52:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:52:04] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2025-06-06 08:52:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 446 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 523 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 992ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 993ms
Finished structural reductions in LTL mode , in 1 iterations and 1072 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-00
Product exploration explored 100000 steps with 1625 reset in 314 ms.
Product exploration explored 100000 steps with 1653 reset in 268 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 : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 269 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 31786 steps (6 resets) in 68 ms. (460 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 469 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2025-06-06 08:52:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:52:07] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-06 08:52:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:52:07] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2025-06-06 08:52: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/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 530 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 480 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1017ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 1018ms
Finished structural reductions in LTL mode , in 1 iterations and 1113 ms. Remains : 30/30 places, 32/32 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 : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 289 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 38463 steps (8 resets) in 76 ms. (499 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 491 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 1587 reset in 215 ms.
Product exploration explored 100000 steps with 1633 reset in 236 ms.
Built C files in :
/tmp/ltsmin14801410852521875707
[2025-06-06 08:52:10] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14801410852521875707
Running compilation step : cd /tmp/ltsmin14801410852521875707;'/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 254 ms.
Running link step : cd /tmp/ltsmin14801410852521875707;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin14801410852521875707;'/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/stateBased4288220103607058905.hoa' '--buchi-type=spotba'
LTSmin run took 262 ms.
FORMULA TCPcondis-PT-40-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-40-LTLFireability-00 finished in 6970 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(((p1 U p2)&&p0))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 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 28 transition count 30
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 26 transition count 28
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 26 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 26 transition count 26
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 10 place count 26 transition count 24
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 14 place count 24 transition count 24
Applied a total of 14 rules in 28 ms. Remains 24 /30 variables (removed 6) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 24 cols
[2025-06-06 08:52:11] [INFO ] Computed 9 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:52:11] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-06 08:52:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:52:11] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 08:52:11] [INFO ] Redundant transitions in 0 ms returned []
Running 22 sub problems to find dead transitions.
[2025-06-06 08:52: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/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 24/48 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 0/48 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 33 constraints, problems are : Problem set: 0 solved, 22 unsolved in 211 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 24/48 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 22/55 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 0/48 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 55 constraints, problems are : Problem set: 0 solved, 22 unsolved in 299 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 515ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 516ms
Starting structural reductions in SI_LTL mode, iteration 1 : 24/30 places, 24/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 631 ms. Remains : 24/30 places, 24/32 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-01
Product exploration explored 100000 steps with 1336 reset in 233 ms.
Stack based approach found an accepted trace after 31461 steps with 421 reset with depth 75 and stack size 75 in 79 ms.
FORMULA TCPcondis-PT-40-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-40-LTLFireability-01 finished in 1089 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) U (G(p1)&&p2))))))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 28
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 26 transition count 26
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 10 place count 26 transition count 24
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 14 place count 24 transition count 24
Applied a total of 14 rules in 10 ms. Remains 24 /30 variables (removed 6) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 24 cols
[2025-06-06 08:52:12] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:52:12] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-06 08:52:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:52:12] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 08:52:12] [INFO ] Redundant transitions in 0 ms returned []
Running 22 sub problems to find dead transitions.
[2025-06-06 08:52:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 24/48 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 0/48 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 33 constraints, problems are : Problem set: 0 solved, 22 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 24/48 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 22/55 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 0/48 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 55 constraints, problems are : Problem set: 0 solved, 22 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 488ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 489ms
Starting structural reductions in SI_LTL mode, iteration 1 : 24/30 places, 24/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 571 ms. Remains : 24/30 places, 24/32 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-02
Product exploration explored 100000 steps with 1819 reset in 189 ms.
Stack based approach found an accepted trace after 1380 steps with 29 reset with depth 23 and stack size 23 in 3 ms.
FORMULA TCPcondis-PT-40-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-40-LTLFireability-02 finished in 936 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(F(p0))||G(p1))))))))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2025-06-06 08:52:13] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:52:13] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-06 08:52:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:52:13] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2025-06-06 08:52:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 466 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 476 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 948ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 949ms
Finished structural reductions in LTL mode , in 1 iterations and 1035 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 323 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-03
Product exploration explored 100000 steps with 129 reset in 274 ms.
Stack based approach found an accepted trace after 82047 steps with 104 reset with depth 34 and stack size 34 in 209 ms.
FORMULA TCPcondis-PT-40-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-40-LTLFireability-03 finished in 1866 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((F(p0) U X(X(p1))))))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 24 transition count 26
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 24 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 24 transition count 24
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 14 place count 24 transition count 22
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 18 place count 22 transition count 22
Applied a total of 18 rules in 10 ms. Remains 22 /30 variables (removed 8) and now considering 22/32 (removed 10) transitions.
// Phase 1: matrix 22 rows 22 cols
[2025-06-06 08:52:15] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:52:15] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-06 08:52:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:52:15] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 08:52:15] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2025-06-06 08:52:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 22/44 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 0/44 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/44 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 22/44 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/44 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/44 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 276 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 467ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 468ms
Starting structural reductions in SI_LTL mode, iteration 1 : 22/30 places, 22/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 565 ms. Remains : 22/30 places, 22/32 transitions.
Stuttering acceptance computed with spot in 311 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), false]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-06
Product exploration explored 100000 steps with 21271 reset in 139 ms.
Product exploration explored 100000 steps with 21352 reset in 172 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 : [(AND (NOT p0) (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 258 ms. Reduced automaton from 7 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 238 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), false, false]
RANDOM walk for 3200 steps (0 resets) in 10 ms. (290 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 340 ms. Reduced automaton from 6 states, 18 edges and 2 AP (stutter insensitive) to 5 states, 16 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), false]
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), false]
[2025-06-06 08:52:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 08:52:17] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-06 08:52:17] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 2 factoid took 383 ms. Reduced automaton from 5 states, 16 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA TCPcondis-PT-40-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-40-LTLFireability-06 finished in 2880 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)||X(X(G(!p1))))) U X(p2)))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2025-06-06 08:52:18] [INFO ] Computed 9 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:52:18] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-06 08:52:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:52:18] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2025-06-06 08:52: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/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 424 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 483 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 911ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 912ms
Finished structural reductions in LTL mode , in 1 iterations and 989 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 288 ms :[(NOT p2), (AND (NOT p0) (NOT p2) p1), (NOT p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-07
Product exploration explored 100000 steps with 19670 reset in 108 ms.
Product exploration explored 100000 steps with 19420 reset in 118 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 : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 133 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[(NOT p2), (NOT p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
RANDOM walk for 4350 steps (0 resets) in 10 ms. (395 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT p2)))]
False Knowledge obtained : [(F p1), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 284 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[(NOT p2), (NOT p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 269 ms :[(NOT p2), (NOT p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
[2025-06-06 08:52:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 08:52:20] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 08:52:20] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 3 ms returned sat
[2025-06-06 08:52:21] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-06 08:52:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 08:52:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 08:52:21] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 1 ms returned sat
[2025-06-06 08:52:21] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-06 08:52:21] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-06 08:52:21] [INFO ] Added : 16 causal constraints over 4 iterations in 24 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2025-06-06 08:52:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:52:21] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-06 08:52:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:52:21] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2025-06-06 08:52: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/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 443 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 447 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 895ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 895ms
Finished structural reductions in LTL mode , in 1 iterations and 959 ms. Remains : 30/30 places, 32/32 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 : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT p2)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 108 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[(NOT p2), (NOT p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
RANDOM walk for 7018 steps (0 resets) in 15 ms. (438 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT p2)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p2)))]
False Knowledge obtained : [(F p1), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 215 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[(NOT p2), (NOT p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 260 ms :[(NOT p2), (NOT p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
[2025-06-06 08:52:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 08:52:23] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 08:52:23] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2025-06-06 08:52:23] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-06 08:52:23] [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 08:52:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 08:52:23] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2025-06-06 08:52:23] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-06 08:52:23] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-06 08:52:23] [INFO ] Added : 16 causal constraints over 4 iterations in 25 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 236 ms :[(NOT p2), (NOT p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Product exploration explored 100000 steps with 13676 reset in 121 ms.
Product exploration explored 100000 steps with 13552 reset in 124 ms.
Applying partial POR strategy [false, false, true, false, false, true]
Stuttering acceptance computed with spot in 269 ms :[(NOT p2), (NOT p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 30 transition count 32
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 29 transition count 31
Deduced a syphon composed of 3 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 29 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 29 transition count 29
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 7 place count 29 transition count 31
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 29 transition count 31
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 9 rules in 8 ms. Remains 29 /30 variables (removed 1) and now considering 31/32 (removed 1) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 08:52:24] [INFO ] Redundant transitions in 0 ms returned []
Running 29 sub problems to find dead transitions.
// Phase 1: matrix 31 rows 29 cols
[2025-06-06 08:52:24] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD19 is UNSAT
At refinement iteration 3 (OVERLAPS) 31/60 variables, 29/38 constraints. Problems are: Problem set: 7 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/38 constraints. Problems are: Problem set: 7 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 0/60 variables, 0/38 constraints. Problems are: Problem set: 7 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 38 constraints, problems are : Problem set: 7 solved, 22 unsolved in 261 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 22 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 4/4 constraints. Problems are: Problem set: 7 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 7 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 5/29 variables, 4/8 constraints. Problems are: Problem set: 7 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/9 constraints. Problems are: Problem set: 7 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 7 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 31/60 variables, 29/38 constraints. Problems are: Problem set: 7 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 22/60 constraints. Problems are: Problem set: 7 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/60 constraints. Problems are: Problem set: 7 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/60 constraints. Problems are: Problem set: 7 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 60 constraints, problems are : Problem set: 7 solved, 22 unsolved in 353 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 22/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 619ms problems are : Problem set: 7 solved, 22 unsolved
Search for dead transitions found 7 dead transitions in 619ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 29/30 places, 24/32 transitions.
Graph (complete) has 63 edges and 29 vertex of which 24 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 24 /29 variables (removed 5) and now considering 24/24 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 24/30 places, 24/32 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 637 ms. Remains : 24/30 places, 24/32 transitions.
Built C files in :
/tmp/ltsmin6618932606349480177
[2025-06-06 08:52:24] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6618932606349480177
Running compilation step : cd /tmp/ltsmin6618932606349480177;'/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 95 ms.
Running link step : cd /tmp/ltsmin6618932606349480177;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin6618932606349480177;'/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/stateBased6538738432618013865.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2025-06-06 08:52:39] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:52:39] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-06 08:52:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:52:40] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2025-06-06 08:52:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 421 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 467 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 894ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 894ms
Finished structural reductions in LTL mode , in 1 iterations and 974 ms. Remains : 30/30 places, 32/32 transitions.
Built C files in :
/tmp/ltsmin17293256643162132980
[2025-06-06 08:52:40] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17293256643162132980
Running compilation step : cd /tmp/ltsmin17293256643162132980;'/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 101 ms.
Running link step : cd /tmp/ltsmin17293256643162132980;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin17293256643162132980;'/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/stateBased15768914265731814608.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-06 08:52:56] [INFO ] Flatten gal took : 4 ms
[2025-06-06 08:52:56] [INFO ] Flatten gal took : 3 ms
[2025-06-06 08:52:56] [INFO ] Time to serialize gal into /tmp/LTL2093557749215000916.gal : 4 ms
[2025-06-06 08:52:56] [INFO ] Time to serialize properties into /tmp/LTL13405536646399991033.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/LTL2093557749215000916.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1349515241955736309.hoa' '-atoms' '/tmp/LTL13405536646399991033.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/LTL13405536646399991033.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1349515241955736309.hoa
Detected timeout of ITS tools.
[2025-06-06 08:53:11] [INFO ] Flatten gal took : 9 ms
[2025-06-06 08:53:11] [INFO ] Flatten gal took : 9 ms
[2025-06-06 08:53:11] [INFO ] Time to serialize gal into /tmp/LTL15525021632238780565.gal : 1 ms
[2025-06-06 08:53:11] [INFO ] Time to serialize properties into /tmp/LTL422007174637403576.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/LTL15525021632238780565.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL422007174637403576.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((G((F("((FINWAIT1>=1)&&(xFINACK>=1))"))||(X(X(G(!("((SYNRCVD>=1)&&(xSYNACK>=1))")))))))U(X("((FINACK>=1)&&(xLASTACK>=1))"))))
Formula 0 simplified : F(G!"((FINWAIT1>=1)&&(xFINACK>=1))" & XXF"((SYNRCVD>=1)&&(xSYNACK>=1))") R X!"((FINACK>=1)&&(xLASTACK>=1))"
Detected timeout of ITS tools.
[2025-06-06 08:53:26] [INFO ] Flatten gal took : 7 ms
[2025-06-06 08:53:26] [INFO ] Applying decomposition
[2025-06-06 08:53:26] [INFO ] Flatten gal took : 3 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/graph13136367669369453035.txt' '-o' '/tmp/graph13136367669369453035.bin' '-w' '/tmp/graph13136367669369453035.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13136367669369453035.bin' '-l' '-1' '-v' '-w' '/tmp/graph13136367669369453035.weights' '-q' '0' '-e' '0.001'
[2025-06-06 08:53:26] [INFO ] Decomposing Gal with order
[2025-06-06 08:53:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 08:53:26] [INFO ] Removed a total of 24 redundant transitions.
[2025-06-06 08:53:26] [INFO ] Flatten gal took : 40 ms
[2025-06-06 08:53:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2025-06-06 08:53:26] [INFO ] Time to serialize gal into /tmp/LTL10371580579967105271.gal : 2 ms
[2025-06-06 08:53:26] [INFO ] Time to serialize properties into /tmp/LTL14145379750089909024.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/LTL10371580579967105271.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14145379750089909024.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("((i1.i0.u1.FINWAIT1>=1)&&(i1.i1.u6.xFINACK>=1))"))||(X(X(G(!("((i1.i0.u0.SYNRCVD>=1)&&(i1.i0.u0.xSYNACK>=1))")))))))U(X("((u...194
Formula 0 simplified : F(G!"((i1.i0.u1.FINWAIT1>=1)&&(i1.i1.u6.xFINACK>=1))" & XXF"((i1.i0.u0.SYNRCVD>=1)&&(i1.i0.u0.xSYNACK>=1))") R X!"((u8.FINACK>=1)&&(...175
Detected timeout of ITS tools.
Treatment of property TCPcondis-PT-40-LTLFireability-07 finished in 83197 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&F(!p1)&&X(X((p2&&X(G((G(p0)||p3)))))))))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2025-06-06 08:53:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:53:41] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-06 08:53:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:53:41] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2025-06-06 08:53:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 421 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 466 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 894ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 895ms
Finished structural reductions in LTL mode , in 1 iterations and 970 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 667 ms :[(OR (NOT p0) (NOT p2) p1), (NOT p0), (OR (NOT p2) (AND (NOT p0) (NOT p3))), p1, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) p1 (NOT p3)) (AND p1 (NOT p2))), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) p1 (NOT p3)), (AND p1 (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) p1 (NOT p3))), (AND p1 (NOT p0))]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-08
Product exploration explored 100000 steps with 258 reset in 208 ms.
Product exploration explored 100000 steps with 251 reset in 236 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 : [(AND (NOT p0) (NOT p1) p2 p3), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p0) p2))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 206 ms. Reduced automaton from 16 states, 62 edges and 4 AP (stutter sensitive) to 16 states, 60 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 682 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p2) (AND (NOT p0) (NOT p3))), p1, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) p1 (NOT p3)) (AND p1 (NOT p2))), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) p1 (NOT p3)), (AND p1 (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) p1 (NOT p3))), (AND p1 (NOT p0))]
Reduction of identical properties reduced properties to check from 28 to 19
RANDOM walk for 40051 steps (8 resets) in 104 ms. (381 steps per ms) remains 7/19 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 275 ms. (144 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
[2025-06-06 08:53:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf7 is UNSAT
Problem apf23 is UNSAT
After SMT solving in domain Real declared 4/62 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 17 ms.
Refiners :[Positive P Invariants (semi-flows): 0/3 constraints, Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2 p3), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p0) p2))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND p1 p2)))), (G (OR (NOT p2) (NOT p0) p3)), (G (OR (NOT p2) p0 p3))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p3)))), (F p1), (F (NOT (AND (NOT p0) p3))), (F (NOT (OR (NOT p1) (NOT p0) p3))), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR (NOT p1) p2 (NOT p0) p3))), (F (NOT (OR (NOT p1) p2 p0 p3))), (F (NOT p2)), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p1) p0))), (F (NOT p3)), (F (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p3)))), (F (NOT (OR p2 (NOT p0) p3))), (F (NOT (OR p2 p0))), (F (NOT (OR p2 p0 p3))), (F p0), (F (NOT (OR (NOT p1) p0 p3))), (F (NOT (AND p2 (NOT p0)))), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p3)))), (F (NOT (OR p0 p3))), (F (NOT (OR (NOT p2) (NOT p0)))), (F (NOT (AND (OR (NOT p1) (NOT p2)) (OR (NOT p1) (NOT p3)))))]
Knowledge based reduction with 12 factoid took 1185 ms. Reduced automaton from 16 states, 60 edges and 4 AP (stutter sensitive) to 14 states, 47 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 623 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p2) (AND (NOT p0) (NOT p3))), p1, (AND (NOT p0) (NOT p2)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (AND p1 (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND p1 (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 640 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p2) (AND (NOT p0) (NOT p3))), p1, (AND (NOT p0) (NOT p2)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (AND p1 (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND p1 (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0))]
[2025-06-06 08:53:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 08:53:47] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 08:53:47] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2 p3), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p0) p2))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND p1 p2)))), (G (OR (NOT p2) (NOT p0) p3)), (G (OR (NOT p2) p0 p3))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p3)))), (F p1), (F (NOT (AND (NOT p0) p3))), (F (NOT (OR (NOT p1) (NOT p0) p3))), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR (NOT p1) p2 (NOT p0) p3))), (F (NOT (OR (NOT p1) p2 p0 p3))), (F (NOT p2)), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p1) p0))), (F (NOT p3)), (F (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p3)))), (F (NOT (OR p2 (NOT p0) p3))), (F (NOT (OR p2 p0))), (F (NOT (OR p2 p0 p3))), (F p0), (F (NOT (OR (NOT p1) p0 p3))), (F (NOT (AND p2 (NOT p0)))), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p3)))), (F (NOT (OR p0 p3))), (F (NOT (OR (NOT p2) (NOT p0)))), (F (NOT (AND (OR (NOT p1) (NOT p2)) (OR (NOT p1) (NOT p3))))), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 12 factoid took 1195 ms. Reduced automaton from 14 states, 47 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA TCPcondis-PT-40-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-40-LTLFireability-08 finished in 6982 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 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 25 transition count 27
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 25 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 25 transition count 25
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 12 place count 25 transition count 23
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 16 place count 23 transition count 23
Applied a total of 16 rules in 3 ms. Remains 23 /30 variables (removed 7) and now considering 23/32 (removed 9) transitions.
// Phase 1: matrix 23 rows 23 cols
[2025-06-06 08:53:48] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:53:48] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-06 08:53:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:53:48] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 08:53:48] [INFO ] Redundant transitions in 1 ms returned []
Running 21 sub problems to find dead transitions.
[2025-06-06 08:53: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/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 23/46 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 0/46 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/46 variables, and 32 constraints, problems are : Problem set: 0 solved, 21 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 23/46 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 21/53 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 0/46 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/46 variables, and 53 constraints, problems are : Problem set: 0 solved, 21 unsolved in 311 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 505ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 505ms
Starting structural reductions in SI_LTL mode, iteration 1 : 23/30 places, 23/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 572 ms. Remains : 23/30 places, 23/32 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 191 ms.
Stack based approach found an accepted trace after 13628 steps with 0 reset with depth 13629 and stack size 13629 in 30 ms.
FORMULA TCPcondis-PT-40-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-40-LTLFireability-11 finished in 853 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F((G(p1)||X(F(p2))))))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2025-06-06 08:53:49] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:53:49] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-06 08:53:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:53:49] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2025-06-06 08:53:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 408 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 460 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 872ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 872ms
Finished structural reductions in LTL mode , in 1 iterations and 942 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-12
Product exploration explored 100000 steps with 2793 reset in 179 ms.
Stack based approach found an accepted trace after 80597 steps with 2093 reset with depth 55 and stack size 55 in 156 ms.
FORMULA TCPcondis-PT-40-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-40-LTLFireability-12 finished in 1413 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((F(p1)&&p0)))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2025-06-06 08:53:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:53:50] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-06 08:53:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:53:50] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2025-06-06 08:53:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 422 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 463 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 895ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 895ms
Finished structural reductions in LTL mode , in 1 iterations and 977 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-14
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-40-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-40-LTLFireability-14 finished in 1206 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)&&X(F(p1))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2025-06-06 08:53:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:53:51] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-06 08:53:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:53:51] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2025-06-06 08:53: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/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 459 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 469 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 940ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 940ms
Finished structural reductions in LTL mode , in 1 iterations and 1033 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-15
Product exploration explored 100000 steps with 14439 reset in 199 ms.
Product exploration explored 100000 steps with 14654 reset in 133 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 : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 99 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1481 steps (0 resets) in 5 ms. (246 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 109 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 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
[2025-06-06 08:53:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 08:53:53] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 08:53:53] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 5 factoid took 137 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA TCPcondis-PT-40-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-40-LTLFireability-15 finished in 2101 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)||X(X(G(!p1))))) U X(p2)))'
[2025-06-06 08:53:54] [INFO ] Flatten gal took : 7 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4571237448579606055
[2025-06-06 08:53:54] [INFO ] Computing symmetric may disable matrix : 32 transitions.
[2025-06-06 08:53:54] [INFO ] Applying decomposition
[2025-06-06 08:53:54] [INFO ] Flatten gal took : 2 ms
[2025-06-06 08:53:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph14011370562076621714.txt' '-o' '/tmp/graph14011370562076621714.bin' '-w' '/tmp/graph14011370562076621714.weights'
[2025-06-06 08:53:54] [INFO ] Computing symmetric may enable matrix : 32 transitions.
[2025-06-06 08:53:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 08:53:54] [INFO ] Computing Do-Not-Accords matrix : 32 transitions.
[2025-06-06 08:53:54] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14011370562076621714.bin' '-l' '-1' '-v' '-w' '/tmp/graph14011370562076621714.weights' '-q' '0' '-e' '0.001'
[2025-06-06 08:53:54] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4571237448579606055
Running compilation step : cd /tmp/ltsmin4571237448579606055;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-06 08:53:54] [INFO ] Decomposing Gal with order
[2025-06-06 08:53:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 08:53:54] [INFO ] Removed a total of 24 redundant transitions.
[2025-06-06 08:53:54] [INFO ] Flatten gal took : 5 ms
[2025-06-06 08:53:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-06 08:53:54] [INFO ] Time to serialize gal into /tmp/LTLFireability13044824713484858798.gal : 1 ms
[2025-06-06 08:53:54] [INFO ] Time to serialize properties into /tmp/LTLFireability1016655136030437146.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/LTLFireability13044824713484858798.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1016655136030437146.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((G((F("((i0.i0.u3.FINWAIT1>=1)&&(i0.i1.u8.xFINACK>=1))"))||(X(X(G(!("((i0.i0.u1.SYNRCVD>=1)&&(i0.i0.u1.xSYNACK>=1))")))))))U(X("((i...203
Formula 0 simplified : F(G!"((i0.i0.u3.FINWAIT1>=1)&&(i0.i1.u8.xFINACK>=1))" & XXF"((i0.i0.u1.SYNRCVD>=1)&&(i0.i0.u1.xSYNACK>=1))") R X!"((i2.i0.u2.FINACK>...184
Compilation finished in 107 ms.
Running link step : cd /tmp/ltsmin4571237448579606055;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin4571237448579606055;'/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' '([]((<>((LTLAPp0==true))||X(X([](!(LTLAPp1==true)))))) U X((LTLAPp2==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: LTL layer: formula: ([]((<>((LTLAPp0==true))||X(X([](!(LTLAPp1==true)))))) U X((LTLAPp2==true)))
pins2lts-mc-linux64( 6/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: "([]((<>((LTLAPp0==true))||X(X([](!(LTLAPp1==true)))))) U X((LTLAPp2==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.062: DFS-FIFO for weak LTL, using special progress label 36
pins2lts-mc-linux64( 0/ 8), 0.062: There are 37 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.062: State length is 31, there are 43 groups
pins2lts-mc-linux64( 0/ 8), 0.062: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.062: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.062: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.062: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.293: ~110 levels ~960 states ~29560 transitions
pins2lts-mc-linux64( 4/ 8), 0.474: ~217 levels ~1920 states ~64560 transitions
pins2lts-mc-linux64( 4/ 8), 0.634: ~394 levels ~3840 states ~99984 transitions
pins2lts-mc-linux64( 4/ 8), 0.682: ~403 levels ~7680 states ~110752 transitions
pins2lts-mc-linux64( 4/ 8), 0.757: ~403 levels ~15360 states ~133032 transitions
pins2lts-mc-linux64( 4/ 8), 0.862: ~403 levels ~30720 states ~180208 transitions
pins2lts-mc-linux64( 4/ 8), 1.052: ~403 levels ~61440 states ~284688 transitions
pins2lts-mc-linux64( 4/ 8), 1.323: ~403 levels ~122880 states ~479232 transitions
pins2lts-mc-linux64( 4/ 8), 1.769: ~403 levels ~245760 states ~964440 transitions
pins2lts-mc-linux64( 5/ 8), 2.247: ~459 levels ~491520 states ~1946408 transitions
pins2lts-mc-linux64( 4/ 8), 2.768: ~403 levels ~983040 states ~3920552 transitions
pins2lts-mc-linux64( 4/ 8), 4.000: ~403 levels ~1966080 states ~8079112 transitions
pins2lts-mc-linux64( 4/ 8), 7.039: ~403 levels ~3932160 states ~16664496 transitions
pins2lts-mc-linux64( 5/ 8), 12.765: ~459 levels ~7864320 states ~34178752 transitions
pins2lts-mc-linux64( 2/ 8), 24.468: ~477 levels ~15728640 states ~68042936 transitions
pins2lts-mc-linux64( 2/ 8), 47.707: ~477 levels ~31457280 states ~139844456 transitions
pins2lts-mc-linux64( 5/ 8), 99.807: ~459 levels ~62914560 states ~290251464 transitions
pins2lts-mc-linux64( 0/ 8), 117.902: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 117.993:
pins2lts-mc-linux64( 0/ 8), 117.993: mean standard work distribution: 4.6% (states) 2.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 117.993:
pins2lts-mc-linux64( 0/ 8), 117.993: Explored 63657137 states 311374315 transitions, fanout: 4.891
pins2lts-mc-linux64( 0/ 8), 117.993: Total exploration time 117.920 sec (117.830 sec minimum, 117.889 sec on average)
pins2lts-mc-linux64( 0/ 8), 117.993: States per second: 539833, Transitions per second: 2640556
pins2lts-mc-linux64( 0/ 8), 117.993:
pins2lts-mc-linux64( 0/ 8), 117.993: Progress states detected: 70518274
pins2lts-mc-linux64( 0/ 8), 117.993: Redundant explorations: -52.5716
pins2lts-mc-linux64( 0/ 8), 117.993:
pins2lts-mc-linux64( 0/ 8), 117.993: Queue width: 8B, total height: 70521553, memory: 538.04MB
pins2lts-mc-linux64( 0/ 8), 117.993: Tree memory: 1108.8MB, 8.7 B/state, compr.: 6.9%
pins2lts-mc-linux64( 0/ 8), 117.993: Tree fill ratio (roots/leafs): 99.0%/33.0%
pins2lts-mc-linux64( 0/ 8), 117.993: Stored 32 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 117.993: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 117.993: Est. total memory use: 1646.8MB (~1562.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4571237448579606055;'/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' '([]((<>((LTLAPp0==true))||X(X([](!(LTLAPp1==true)))))) U X((LTLAPp2==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4571237448579606055;'/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' '([]((<>((LTLAPp0==true))||X(X([](!(LTLAPp1==true)))))) U X((LTLAPp2==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-06 09:14:32] [INFO ] Flatten gal took : 3 ms
[2025-06-06 09:14:32] [INFO ] Time to serialize gal into /tmp/LTLFireability138758785374437782.gal : 0 ms
[2025-06-06 09:14:32] [INFO ] Time to serialize properties into /tmp/LTLFireability1147538950089093741.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/LTLFireability138758785374437782.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1147538950089093741.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...296
Read 1 LTL properties
Checking formula 0 : !(((G((F("((FINWAIT1>=1)&&(xFINACK>=1))"))||(X(X(G(!("((SYNRCVD>=1)&&(xSYNACK>=1))")))))))U(X("((FINACK>=1)&&(xLASTACK>=1))"))))
Formula 0 simplified : F(G!"((FINWAIT1>=1)&&(xFINACK>=1))" & XXF"((SYNRCVD>=1)&&(xSYNACK>=1))") R X!"((FINACK>=1)&&(xLASTACK>=1))"
Detected timeout of ITS tools.
[2025-06-06 09:35:12] [INFO ] Flatten gal took : 231 ms
[2025-06-06 09:35:13] [INFO ] Input system was already deterministic with 32 transitions.
[2025-06-06 09:35:14] [INFO ] Transformed 30 places.
[2025-06-06 09:35:14] [INFO ] Transformed 32 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-06 09:35:14] [INFO ] Time to serialize gal into /tmp/LTLFireability12305079310340497867.gal : 11 ms
[2025-06-06 09:35:14] [INFO ] Time to serialize properties into /tmp/LTLFireability2765366482058097798.ltl : 5 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/LTLFireability12305079310340497867.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2765366482058097798.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G((F("((FINWAIT1>=1)&&(xFINACK>=1))"))||(X(X(G(!("((SYNRCVD>=1)&&(xSYNACK>=1))")))))))U(X("((FINACK>=1)&&(xLASTACK>=1))"))))
Formula 0 simplified : F(G!"((FINWAIT1>=1)&&(xFINACK>=1))" & XXF"((SYNRCVD>=1)&&(xSYNACK>=1))") R X!"((FINACK>=1)&&(xLASTACK>=1))"

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="TCPcondis-PT-40"
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 TCPcondis-PT-40, 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 r240-tall-174915589400236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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