Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r030-smll-174853814000476.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 ClientsAndServers-PT-N0005P1, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853814000476
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 123K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 8 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 9.2K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748931830816

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N0005P1
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 06:23:53] [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-03 06:23:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 06:23:53] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2025-06-03 06:23:53] [INFO ] Transformed 25 places.
[2025-06-03 06:23:53] [INFO ] Transformed 18 transitions.
[2025-06-03 06:23:53] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 296 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 11 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2025-06-03 06:23:54] [INFO ] Computed 8 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:23:54] [INFO ] Implicit Places using invariants in 257 ms returned []
[2025-06-03 06:23:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:23:54] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2025-06-03 06:23:54] [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, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/43 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/43 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 33 constraints, problems are : Problem set: 0 solved, 17 unsolved in 765 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/43 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 50 constraints, problems are : Problem set: 0 solved, 17 unsolved in 584 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1390ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 1411ms
Finished structural reductions in LTL mode , in 1 iterations and 1875 ms. Remains : 25/25 places, 18/18 transitions.
Support contains 21 out of 25 places after structural reductions.
[2025-06-03 06:23:56] [INFO ] Flatten gal took : 22 ms
[2025-06-03 06:23:56] [INFO ] Flatten gal took : 8 ms
[2025-06-03 06:23:56] [INFO ] Input system was already deterministic with 18 transitions.
Reduction of identical properties reduced properties to check from 18 to 17
RANDOM walk for 7857 steps (5 resets) in 149 ms. (52 steps per ms) remains 0/17 properties
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((X(X((p0&&F(p1))))&&(p0 U p2))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 9 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2025-06-03 06:23:57] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:23:57] [INFO ] Implicit Places using invariants in 67 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 69 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 81 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 646 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1), (AND (NOT p2) p0 (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-01
Product exploration explored 100000 steps with 1097 reset in 437 ms.
Product exploration explored 100000 steps with 1090 reset in 273 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 p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (OR p2 p0))), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (OR p2 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 173 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 412 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1), (AND p0 (NOT p2) (NOT p1))]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 2316 steps (3 resets) in 24 ms. (92 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (OR p2 p0))), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (OR p2 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2 p1))), (F p2), (F (NOT p1)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 15 factoid took 791 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 419 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1), (AND p0 (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 418 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1), (AND p0 (NOT p2) (NOT p1))]
// Phase 1: matrix 18 rows 21 cols
[2025-06-03 06:24:00] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 06:24:00] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 06:24:00] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-03 06:24:00] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 06:24:00] [INFO ] [Nat]Absence check using 4 positive place invariants in 7 ms returned sat
[2025-06-03 06:24:00] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-03 06:24:00] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 06:24:01] [INFO ] Added : 14 causal constraints over 3 iterations in 23 ms. Result :sat
Could not prove EG (NOT p0)
[2025-06-03 06:24:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 06:24:01] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-03 06:24:01] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-03 06:24:01] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-03 06:24:01] [INFO ] Added : 15 causal constraints over 3 iterations in 32 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2025-06-03 06:24:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:24:01] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-03 06:24:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:24:01] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2025-06-03 06:24:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 25 constraints, problems are : Problem set: 0 solved, 17 unsolved in 459 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 42 constraints, problems are : Problem set: 0 solved, 17 unsolved in 468 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 937ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 938ms
Finished structural reductions in LTL mode , in 1 iterations and 1037 ms. Remains : 21/21 places, 18/18 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 p2) p1), (X (AND (NOT p0) (NOT p2))), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (NOT (OR p0 p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT (OR p0 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 190 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 387 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1), (AND p0 (NOT p2) (NOT p1))]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 2142 steps (2 resets) in 24 ms. (85 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (AND (NOT p0) (NOT p2))), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (NOT (OR p0 p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT (OR p0 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2 p1))), (F p2), (F (NOT p1)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 15 factoid took 645 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 392 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1), (AND p0 (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 463 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1), (AND p0 (NOT p2) (NOT p1))]
[2025-06-03 06:24:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 06:24:04] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-03 06:24:04] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-03 06:24:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 06:24:04] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-03 06:24:04] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2025-06-03 06:24:04] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-03 06:24:04] [INFO ] Added : 14 causal constraints over 3 iterations in 31 ms. Result :sat
Could not prove EG (NOT p0)
[2025-06-03 06:24:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 06:24:04] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-03 06:24:04] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-03 06:24:04] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 06:24:04] [INFO ] Added : 15 causal constraints over 3 iterations in 32 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 423 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1), (AND p0 (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 1107 reset in 162 ms.
Product exploration explored 100000 steps with 1086 reset in 157 ms.
Applying partial POR strategy [false, false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 320 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1), (AND p0 (NOT p2) (NOT p1))]
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 21 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 6 place count 21 transition count 18
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 21 transition count 18
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 13 place count 17 transition count 14
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 17 place count 17 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 17 transition count 14
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 16 transition count 13
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 16 transition count 13
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 20 rules in 27 ms. Remains 16 /21 variables (removed 5) and now considering 13/18 (removed 5) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 06:24:06] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
// Phase 1: matrix 13 rows 16 cols
[2025-06-03 06:24:06] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 1/16 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD11 is UNSAT
At refinement iteration 4 (OVERLAPS) 13/29 variables, 16/20 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/20 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/29 variables, 0/20 constraints. Problems are: Problem set: 5 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 29/29 variables, and 20 constraints, problems are : Problem set: 5 solved, 7 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 7 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 6/16 variables, 4/4 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 13/29 variables, 16/20 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 7/27 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/27 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/29 variables, 0/27 constraints. Problems are: Problem set: 5 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 29/29 variables, and 27 constraints, problems are : Problem set: 5 solved, 7 unsolved in 173 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 7/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 376ms problems are : Problem set: 5 solved, 7 unsolved
Search for dead transitions found 5 dead transitions in 376ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 16/21 places, 8/18 transitions.
Graph (complete) has 18 edges and 16 vertex of which 11 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 3 ms. Remains 11 /16 variables (removed 5) and now considering 8/8 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/21 places, 8/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 430 ms. Remains : 11/21 places, 8/18 transitions.
Built C files in :
/tmp/ltsmin1887042540004158404
[2025-06-03 06:24:06] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1887042540004158404
Running compilation step : cd /tmp/ltsmin1887042540004158404;'/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 486 ms.
Running link step : cd /tmp/ltsmin1887042540004158404;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 80 ms.
Running LTSmin : cd /tmp/ltsmin1887042540004158404;'/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/stateBased14473133338080416520.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2025-06-03 06:24:21] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:24:21] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-03 06:24:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:24:21] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2025-06-03 06:24: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/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 25 constraints, problems are : Problem set: 0 solved, 17 unsolved in 410 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 42 constraints, problems are : Problem set: 0 solved, 17 unsolved in 420 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 855ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 855ms
Finished structural reductions in LTL mode , in 1 iterations and 964 ms. Remains : 21/21 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin5987272448524277582
[2025-06-03 06:24:22] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5987272448524277582
Running compilation step : cd /tmp/ltsmin5987272448524277582;'/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 122 ms.
Running link step : cd /tmp/ltsmin5987272448524277582;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin5987272448524277582;'/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/stateBased1659432742893265019.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 06:24:37] [INFO ] Flatten gal took : 12 ms
[2025-06-03 06:24:37] [INFO ] Flatten gal took : 4 ms
[2025-06-03 06:24:37] [INFO ] Time to serialize gal into /tmp/LTL14099594736696221921.gal : 2 ms
[2025-06-03 06:24:37] [INFO ] Time to serialize properties into /tmp/LTL11520447092344324198.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14099594736696221921.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11050863991537728905.hoa' '-atoms' '/tmp/LTL11520447092344324198.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL11520447092344324198.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11050863991537728905.hoa
Detected timeout of ITS tools.
[2025-06-03 06:24:52] [INFO ] Flatten gal took : 4 ms
[2025-06-03 06:24:52] [INFO ] Flatten gal took : 3 ms
[2025-06-03 06:24:52] [INFO ] Time to serialize gal into /tmp/LTL10723396068150006811.gal : 1 ms
[2025-06-03 06:24:52] [INFO ] Time to serialize properties into /tmp/LTL17350774873089930766.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/LTL10723396068150006811.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17350774873089930766.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((X(X(("(SpA>=1)")&&(F("(Ci>=1)")))))&&(("(SpA>=1)")U("((CA>=1)&&(CwA>=1))")))))
Formula 0 simplified : G(XX(!"(SpA>=1)" | G!"(Ci>=1)") | (!"(SpA>=1)" R !"((CA>=1)&&(CwA>=1))"))
Detected timeout of ITS tools.
[2025-06-03 06:25:08] [INFO ] Flatten gal took : 3 ms
[2025-06-03 06:25:08] [INFO ] Applying decomposition
[2025-06-03 06:25:08] [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/graph4629861190138689611.txt' '-o' '/tmp/graph4629861190138689611.bin' '-w' '/tmp/graph4629861190138689611.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4629861190138689611.bin' '-l' '-1' '-v' '-w' '/tmp/graph4629861190138689611.weights' '-q' '0' '-e' '0.001'
[2025-06-03 06:25:08] [INFO ] Decomposing Gal with order
[2025-06-03 06:25:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 06:25:08] [INFO ] Removed a total of 1 redundant transitions.
[2025-06-03 06:25:08] [INFO ] Flatten gal took : 64 ms
[2025-06-03 06:25:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-03 06:25:08] [INFO ] Time to serialize gal into /tmp/LTL14479103499952774699.gal : 2 ms
[2025-06-03 06:25:08] [INFO ] Time to serialize properties into /tmp/LTL18032615641239913477.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/LTL14479103499952774699.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18032615641239913477.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 : !((F((X(X(("(i0.u0.SpA>=1)")&&(F("(u4.Ci>=1)")))))&&(("(i0.u0.SpA>=1)")U("((i0.u0.CA>=1)&&(u4.CwA>=1))")))))
Formula 0 simplified : G(XX(!"(i0.u0.SpA>=1)" | G!"(u4.Ci>=1)") | (!"(i0.u0.SpA>=1)" R !"((i0.u0.CA>=1)&&(u4.CwA>=1))"))
Detected timeout of ITS tools.
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-01 finished in 86216 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(F(p0))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2025-06-03 06:25:23] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:25:23] [INFO ] Implicit Places using invariants in 52 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-02
Product exploration explored 100000 steps with 33333 reset in 112 ms.
Product exploration explored 100000 steps with 33333 reset in 79 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 13 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-02 finished in 387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 21 transition count 12
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 16 place count 15 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 16 place count 15 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 13 transition count 10
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 28 place count 9 transition count 6
Applied a total of 28 rules in 7 ms. Remains 9 /25 variables (removed 16) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2025-06-03 06:25:23] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:25:23] [INFO ] Implicit Places using invariants in 30 ms returned [6, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/25 places, 6/18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 7 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 6 transition count 5
Applied a total of 2 rules in 2 ms. Remains 6 /7 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 6 cols
[2025-06-03 06:25:23] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:25:23] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-03 06:25:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:25:23] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/25 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 130 ms. Remains : 6/25 places, 5/18 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-03
Product exploration explored 100000 steps with 4848 reset in 246 ms.
Stack based approach found an accepted trace after 136 steps with 9 reset with depth 21 and stack size 21 in 1 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-03 finished in 493 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||(p1&&X(!p0)))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 0 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2025-06-03 06:25:24] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:25:24] [INFO ] Implicit Places using invariants in 34 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p1) (NOT p0)), false, (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-04
Product exploration explored 100000 steps with 7 reset in 170 ms.
Stack based approach found an accepted trace after 7629 steps with 0 reset with depth 7630 and stack size 7630 in 20 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-04 finished in 400 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U (G(!p1) U X(p2)))))'
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
[2025-06-03 06:25:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:25:24] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-03 06:25:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:25:24] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2025-06-03 06:25:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 25 constraints, problems are : Problem set: 0 solved, 17 unsolved in 426 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 42 constraints, problems are : Problem set: 0 solved, 17 unsolved in 404 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 837ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 837ms
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 931 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 358 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-05
Product exploration explored 100000 steps with 4542 reset in 116 ms.
Product exploration explored 100000 steps with 4564 reset in 333 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 p1) p0 (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 155 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) p1)]
RANDOM walk for 388 steps (0 resets) in 5 ms. (64 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1) p2))), (F p2), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p2))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1 p2))), (F p1)]
Knowledge based reduction with 11 factoid took 449 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 328 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 305 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) p1)]
[2025-06-03 06:25:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 06:25:27] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 06:25:27] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-03 06:25:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 06:25:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 06:25:27] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-03 06:25:27] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 06:25:27] [INFO ] Added : 9 causal constraints over 2 iterations in 18 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 6 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2025-06-03 06:25:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:25:28] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-03 06:25:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:25:28] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2025-06-03 06:25:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 25 constraints, problems are : Problem set: 0 solved, 17 unsolved in 444 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 42 constraints, problems are : Problem set: 0 solved, 17 unsolved in 396 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 850ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 851ms
Finished structural reductions in LTL mode , in 1 iterations and 937 ms. Remains : 21/21 places, 18/18 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) p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 163 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 353 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) p1)]
RANDOM walk for 388 steps (0 resets) in 6 ms. (55 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 p0 p1))), (F (NOT (OR p0 p1))), (F (NOT (OR p2 p0))), (F (NOT p0)), (F (NOT (OR p2 p0 (NOT p1)))), (F p2), (F (NOT (OR p0 (NOT p1)))), (F p1)]
Knowledge based reduction with 6 factoid took 429 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 306 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 312 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) p1)]
[2025-06-03 06:25:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 06:25:30] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-03 06:25:30] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-03 06:25:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 06:25:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 06:25:30] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-03 06:25:30] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 06:25:30] [INFO ] Added : 9 causal constraints over 2 iterations in 17 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 303 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 4543 reset in 98 ms.
Product exploration explored 100000 steps with 4538 reset in 108 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 333 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) p1)]
Support contains 6 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 21 transition count 18
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 21 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 21 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 20 transition count 17
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 20 transition count 17
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 7 rules in 16 ms. Remains 20 /21 variables (removed 1) and now considering 17/18 (removed 1) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 06:25:31] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
// Phase 1: matrix 17 rows 20 cols
[2025-06-03 06:25:31] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
At refinement iteration 4 (OVERLAPS) 17/37 variables, 20/24 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/24 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/37 variables, 0/24 constraints. Problems are: Problem set: 4 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/37 variables, and 24 constraints, problems are : Problem set: 4 solved, 12 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 12 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 5/20 variables, 3/4 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 17/37 variables, 20/24 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 12/36 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/36 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/37 variables, 0/36 constraints. Problems are: Problem set: 4 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/37 variables, and 36 constraints, problems are : Problem set: 4 solved, 12 unsolved in 296 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 12/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 673ms problems are : Problem set: 4 solved, 12 unsolved
Search for dead transitions found 4 dead transitions in 673ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 20/21 places, 13/18 transitions.
Graph (complete) has 23 edges and 20 vertex of which 16 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 16 /20 variables (removed 4) and now considering 13/13 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/21 places, 13/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 700 ms. Remains : 16/21 places, 13/18 transitions.
Built C files in :
/tmp/ltsmin1423458450829240458
[2025-06-03 06:25:32] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1423458450829240458
Running compilation step : cd /tmp/ltsmin1423458450829240458;'/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 157 ms.
Running link step : cd /tmp/ltsmin1423458450829240458;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin1423458450829240458;'/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/stateBased14853340805447250354.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2025-06-03 06:25:47] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:25:47] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-03 06:25:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:25:47] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2025-06-03 06:25:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 25 constraints, problems are : Problem set: 0 solved, 17 unsolved in 374 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 42 constraints, problems are : Problem set: 0 solved, 17 unsolved in 391 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 772ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 773ms
Finished structural reductions in LTL mode , in 1 iterations and 866 ms. Remains : 21/21 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin9935242490254769906
[2025-06-03 06:25:48] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9935242490254769906
Running compilation step : cd /tmp/ltsmin9935242490254769906;'/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 168 ms.
Running link step : cd /tmp/ltsmin9935242490254769906;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin9935242490254769906;'/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/stateBased8072791803016181200.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 06:26:03] [INFO ] Flatten gal took : 3 ms
[2025-06-03 06:26:03] [INFO ] Flatten gal took : 2 ms
[2025-06-03 06:26:03] [INFO ] Time to serialize gal into /tmp/LTL3016794060962102819.gal : 1 ms
[2025-06-03 06:26:03] [INFO ] Time to serialize properties into /tmp/LTL10211365821374819390.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/LTL3016794060962102819.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11382144275975529692.hoa' '-atoms' '/tmp/LTL10211365821374819390.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10211365821374819390.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11382144275975529692.hoa
Detected timeout of ITS tools.
[2025-06-03 06:26:18] [INFO ] Flatten gal took : 4 ms
[2025-06-03 06:26:18] [INFO ] Flatten gal took : 2 ms
[2025-06-03 06:26:18] [INFO ] Time to serialize gal into /tmp/LTL18355325802909039646.gal : 1 ms
[2025-06-03 06:26:18] [INFO ] Time to serialize properties into /tmp/LTL14095582043860767652.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/LTL18355325802909039646.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14095582043860767652.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((F("(Ci>=1)"))U((G(!("(((SR>=1)&&(Mi>=1))&&((Uf>=1)&&(MwU>=1)))")))U(X("(SpG>=1)"))))))
Formula 0 simplified : X(G!"(Ci>=1)" R (F"(((SR>=1)&&(Mi>=1))&&((Uf>=1)&&(MwU>=1)))" R X!"(SpG>=1)"))
Detected timeout of ITS tools.
[2025-06-03 06:26:33] [INFO ] Flatten gal took : 3 ms
[2025-06-03 06:26:33] [INFO ] Applying decomposition
[2025-06-03 06:26:33] [INFO ] Flatten gal took : 2 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/graph15027960531953566066.txt' '-o' '/tmp/graph15027960531953566066.bin' '-w' '/tmp/graph15027960531953566066.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15027960531953566066.bin' '-l' '-1' '-v' '-w' '/tmp/graph15027960531953566066.weights' '-q' '0' '-e' '0.001'
[2025-06-03 06:26:33] [INFO ] Decomposing Gal with order
[2025-06-03 06:26:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 06:26:33] [INFO ] Removed a total of 1 redundant transitions.
[2025-06-03 06:26:33] [INFO ] Flatten gal took : 4 ms
[2025-06-03 06:26:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-03 06:26:33] [INFO ] Time to serialize gal into /tmp/LTL7471871088691110903.gal : 1 ms
[2025-06-03 06:26:33] [INFO ] Time to serialize properties into /tmp/LTL8664854257730600398.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/LTL7471871088691110903.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8664854257730600398.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X((F("(i0.u7.Ci>=1)"))U((G(!("(((u4.SR>=1)&&(i2.u2.Mi>=1))&&((i2.u3.Uf>=1)&&(i2.u3.MwU>=1)))")))U(X("(i4.u5.SpG>=1)"))))))
Formula 0 simplified : X(G!"(i0.u7.Ci>=1)" R (F"(((u4.SR>=1)&&(i2.u2.Mi>=1))&&((i2.u3.Uf>=1)&&(i2.u3.MwU>=1)))" R X!"(i4.u5.SpG>=1)"))
Detected timeout of ITS tools.
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-05 finished in 84142 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U !p1)||G(p2)||X(G(!p0))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 2 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
[2025-06-03 06:26:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:26:48] [INFO ] Implicit Places using invariants in 46 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 364 ms :[true, p1, (AND p1 p0 (NOT p2)), p0, (NOT p2), (AND p0 (NOT p2)), (AND p1 p0), (AND p1 p0 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-06
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-06 finished in 444 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U (!p0&&G(p1))) U X((F(G(p2)) U p3)))))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
[2025-06-03 06:26:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:26:49] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-03 06:26:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:26:49] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2025-06-03 06:26: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/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 25 constraints, problems are : Problem set: 0 solved, 17 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 42 constraints, problems are : Problem set: 0 solved, 17 unsolved in 421 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 736ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 737ms
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 820 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 354 ms :[(NOT p3), (NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-07
Stuttering criterion allowed to conclude after 1600 steps with 0 reset in 7 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-07 finished in 1240 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 U (p1||G(!p0))))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 18 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 17 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 13 place count 17 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 17 place count 15 transition count 11
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 3 with 4 rules applied. Total rules applied 21 place count 13 transition count 9
Applied a total of 21 rules in 6 ms. Remains 13 /25 variables (removed 12) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2025-06-03 06:26:50] [INFO ] Computed 5 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:26:50] [INFO ] Implicit Places using invariants in 40 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/25 places, 9/18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 12 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 11 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 11 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 10 transition count 7
Applied a total of 4 rules in 3 ms. Remains 10 /12 variables (removed 2) and now considering 7/9 (removed 2) transitions.
// Phase 1: matrix 7 rows 10 cols
[2025-06-03 06:26:50] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:26:50] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-03 06:26:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:26:50] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/25 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 122 ms. Remains : 10/25 places, 7/18 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-08
Product exploration explored 100000 steps with 170 reset in 155 ms.
Stack based approach found an accepted trace after 31 steps with 0 reset with depth 32 and stack size 32 in 1 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-08 finished in 384 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((F(p0)&&X(X(F(p1))))) U (X(F(p3))&&p2))))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Applied a total of 2 rules in 1 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2025-06-03 06:26:50] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:26:50] [INFO ] Implicit Places using invariants in 46 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 298 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (NOT p3), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-09
Product exploration explored 100000 steps with 16741 reset in 115 ms.
Product exploration explored 100000 steps with 16637 reset in 167 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 p2) (NOT p0) (NOT p3) p1), (X (NOT p3)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (NOT p0)), (X (X (NOT p3))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 126 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 6 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (NOT p3), (NOT p0), (NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 1741 steps (2 resets) in 5 ms. (290 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) p1), (X (NOT p3)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (NOT p0)), (X (X (NOT p3))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 (NOT p2)))), (F p3), (F p2), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 353 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 6 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (NOT p3), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (NOT p3), (NOT p0), (NOT p1), (NOT p1)]
// Phase 1: matrix 18 rows 22 cols
[2025-06-03 06:26:52] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 06:26:52] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-03 06:26:52] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 06:26:52] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-03 06:26:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 06:26:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-03 06:26:52] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 06:26:52] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-03 06:26:52] [INFO ] Computed and/alt/rep : 17/19/17 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 06:26:52] [INFO ] Added : 13 causal constraints over 3 iterations in 16 ms. Result :sat
Could not prove EG (NOT p2)
[2025-06-03 06:26:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 06:26:52] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-03 06:26:52] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-03 06:26:52] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-03 06:26:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 06:26:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-03 06:26:52] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 06:26:52] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-03 06:26:52] [INFO ] Computed and/alt/rep : 17/19/17 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 06:26:52] [INFO ] Added : 13 causal constraints over 3 iterations in 22 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2025-06-03 06:26:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:26:52] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-03 06:26:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:26:52] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2025-06-03 06:26:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/22 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 18/40 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 27 constraints, problems are : Problem set: 0 solved, 17 unsolved in 354 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/22 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 18/40 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/40 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 44 constraints, problems are : Problem set: 0 solved, 17 unsolved in 365 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 723ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 724ms
Finished structural reductions in LTL mode , in 1 iterations and 795 ms. Remains : 22/22 places, 18/18 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 p3) p1), (X (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (X (NOT p3))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 126 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 6 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (NOT p3), (NOT p0), (NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 2001 steps (2 resets) in 11 ms. (166 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) p1), (X (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (X (NOT p3))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 (NOT p2)))), (F p3), (F p2), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 413 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 6 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (NOT p3), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 281 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (NOT p3), (NOT p0), (NOT p1), (NOT p1)]
[2025-06-03 06:26:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 06:26:55] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-03 06:26:55] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-03 06:26:55] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-03 06:26:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 06:26:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-03 06:26:55] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-03 06:26:55] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-03 06:26:55] [INFO ] Computed and/alt/rep : 17/19/17 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 06:26:55] [INFO ] Added : 13 causal constraints over 3 iterations in 23 ms. Result :sat
Could not prove EG (NOT p2)
[2025-06-03 06:26:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 06:26:55] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-03 06:26:55] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-03 06:26:55] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-03 06:26:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 06:26:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-03 06:26:55] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 06:26:55] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-03 06:26:55] [INFO ] Computed and/alt/rep : 17/19/17 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 06:26:55] [INFO ] Added : 13 causal constraints over 3 iterations in 25 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 292 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (NOT p3), (NOT p0), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 16663 reset in 110 ms.
Product exploration explored 100000 steps with 16666 reset in 143 ms.
Applying partial POR strategy [false, false, true, true, false, true]
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (NOT p3), (NOT p0), (NOT p1), (NOT p1)]
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 7 place count 22 transition count 18
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 22 transition count 18
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 11 place count 19 transition count 15
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 19 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 19 transition count 15
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 18 transition count 14
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 18 transition count 14
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 17 rules in 7 ms. Remains 18 /22 variables (removed 4) and now considering 14/18 (removed 4) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 06:26:56] [INFO ] Redundant transitions in 0 ms returned []
Running 13 sub problems to find dead transitions.
// Phase 1: matrix 14 rows 18 cols
[2025-06-03 06:26:56] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 1/18 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD11 is UNSAT
At refinement iteration 6 (OVERLAPS) 14/32 variables, 18/23 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 0/23 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/32 variables, 0/23 constraints. Problems are: Problem set: 5 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 32/32 variables, and 23 constraints, problems are : Problem set: 5 solved, 8 unsolved in 258 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 8 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 5/17 variables, 3/3 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1/18 variables, 2/5 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 14/32 variables, 18/23 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 8/31 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 0/31 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/32 variables, 0/31 constraints. Problems are: Problem set: 5 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 32/32 variables, and 31 constraints, problems are : Problem set: 5 solved, 8 unsolved in 196 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 8/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 458ms problems are : Problem set: 5 solved, 8 unsolved
Search for dead transitions found 5 dead transitions in 459ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 18/22 places, 9/18 transitions.
Graph (complete) has 21 edges and 18 vertex of which 13 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 13 /18 variables (removed 5) and now considering 9/9 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/22 places, 9/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 474 ms. Remains : 13/22 places, 9/18 transitions.
Built C files in :
/tmp/ltsmin16047276671850442575
[2025-06-03 06:26:56] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16047276671850442575
Running compilation step : cd /tmp/ltsmin16047276671850442575;'/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 167 ms.
Running link step : cd /tmp/ltsmin16047276671850442575;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin16047276671850442575;'/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/stateBased389051949935898283.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2025-06-03 06:27:12] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:27:12] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-03 06:27:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:27:12] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2025-06-03 06:27: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/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/22 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 18/40 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 27 constraints, problems are : Problem set: 0 solved, 17 unsolved in 363 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/22 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 18/40 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/40 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 44 constraints, problems are : Problem set: 0 solved, 17 unsolved in 359 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 727ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 728ms
Finished structural reductions in LTL mode , in 1 iterations and 812 ms. Remains : 22/22 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin14538462369053980651
[2025-06-03 06:27:12] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14538462369053980651
Running compilation step : cd /tmp/ltsmin14538462369053980651;'/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 153 ms.
Running link step : cd /tmp/ltsmin14538462369053980651;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin14538462369053980651;'/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/stateBased15925014127936745041.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 06:27:28] [INFO ] Flatten gal took : 2 ms
[2025-06-03 06:27:28] [INFO ] Flatten gal took : 2 ms
[2025-06-03 06:27:28] [INFO ] Time to serialize gal into /tmp/LTL2639486382837685780.gal : 2 ms
[2025-06-03 06:27:28] [INFO ] Time to serialize properties into /tmp/LTL14717421905277077136.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/LTL2639486382837685780.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12149314691332861718.hoa' '-atoms' '/tmp/LTL14717421905277077136.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14717421905277077136.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12149314691332861718.hoa
Detected timeout of ITS tools.
[2025-06-03 06:27:43] [INFO ] Flatten gal took : 3 ms
[2025-06-03 06:27:43] [INFO ] Flatten gal took : 3 ms
[2025-06-03 06:27:43] [INFO ] Time to serialize gal into /tmp/LTL1537679452722355198.gal : 1 ms
[2025-06-03 06:27:43] [INFO ] Time to serialize properties into /tmp/LTL3397572082428190535.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/LTL1537679452722355198.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3397572082428190535.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((X((F("((CG>=1)&&(CwG>=1))"))&&(X(X(F("(Ci>=1)"))))))U(("((SA>=1)&&(SwA>=1))")&&(X(F("((SA>=1)&&(SwA>=1))")))))))
Formula 0 simplified : F(X(G!"((CG>=1)&&(CwG>=1))" | XXG!"(Ci>=1)") R (!"((SA>=1)&&(SwA>=1))" | XG!"((SA>=1)&&(SwA>=1))"))
Detected timeout of ITS tools.
[2025-06-03 06:27:58] [INFO ] Flatten gal took : 3 ms
[2025-06-03 06:27:58] [INFO ] Applying decomposition
[2025-06-03 06:27:58] [INFO ] Flatten gal took : 2 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/graph13267196935624895469.txt' '-o' '/tmp/graph13267196935624895469.bin' '-w' '/tmp/graph13267196935624895469.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13267196935624895469.bin' '-l' '-1' '-v' '-w' '/tmp/graph13267196935624895469.weights' '-q' '0' '-e' '0.001'
[2025-06-03 06:27:58] [INFO ] Decomposing Gal with order
[2025-06-03 06:27:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 06:27:58] [INFO ] Removed a total of 1 redundant transitions.
[2025-06-03 06:27:58] [INFO ] Flatten gal took : 4 ms
[2025-06-03 06:27:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-03 06:27:58] [INFO ] Time to serialize gal into /tmp/LTL2072522110298287747.gal : 1 ms
[2025-06-03 06:27:58] [INFO ] Time to serialize properties into /tmp/LTL16294640807383170614.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/LTL2072522110298287747.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16294640807383170614.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((X((F("((u0.CG>=1)&&(u0.CwG>=1))"))&&(X(X(F("(u7.Ci>=1)"))))))U(("((i1.u2.SA>=1)&&(i4.u6.SwA>=1))")&&(X(F("((i1.u2.SA>=1)&&(i4.u6...172
Formula 0 simplified : F(X(G!"((u0.CG>=1)&&(u0.CwG>=1))" | XXG!"(u7.Ci>=1)") R (!"((i1.u2.SA>=1)&&(i4.u6.SwA>=1))" | XG!"((i1.u2.SA>=1)&&(i4.u6.SwA>=1))"))
Detected timeout of ITS tools.
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-09 finished in 82543 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(!p0))&&(!p1 U (p2||G(!p1)))))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 2 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2025-06-03 06:28:13] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:28:13] [INFO ] Implicit Places using invariants in 33 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 37 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR p0 (AND p1 (NOT p2))), true, p0, (AND (NOT p2) p1)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-11
Product exploration explored 100000 steps with 554 reset in 116 ms.
Product exploration explored 100000 steps with 530 reset in 125 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 p2) (NOT p1) p0), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 195 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 9 states, 24 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 403 ms :[(OR p0 (AND p1 (NOT p2))), true, p0, (AND p1 (NOT p2)), false, false, false, false, false]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40010 steps (24 resets) in 114 ms. (347 steps per ms) remains 2/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 321 ms. (124 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 2/2 properties
// Phase 1: matrix 18 rows 20 cols
[2025-06-03 06:28:14] [INFO ] Computed 3 invariants in 6 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf1 is UNSAT
Problem apf5 is UNSAT
After SMT solving in domain Real declared 5/38 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 0/3 constraints, State Equation: 0/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (G (OR (NOT p1) (NOT p2) p0)), (G (OR (NOT p1) (NOT p2) (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2) p0))), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 (NOT p2) (NOT p0)))), (F p1), (F (NOT (OR p1 p2 p0))), (F (NOT p0))]
Knowledge based reduction with 13 factoid took 757 ms. Reduced automaton from 9 states, 24 edges and 3 AP (stutter insensitive) to 7 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 266 ms :[(OR p0 p1), true, p0, p1, false, false, false]
Stuttering acceptance computed with spot in 293 ms :[(OR p0 p1), true, p0, p1, false, false, false]
[2025-06-03 06:28:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 06:28:15] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-03 06:28:15] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 06:28:15] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 06:28:15] [INFO ] Added : 9 causal constraints over 2 iterations in 16 ms. Result :sat
Could not prove EG p0
Support contains 5 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 6 rules applied. Total rules applied 9 place count 17 transition count 12
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 12 place count 14 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 14 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 12 transition count 10
Applied a total of 16 rules in 4 ms. Remains 12 /20 variables (removed 8) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 12 cols
[2025-06-03 06:28:15] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:28:15] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-03 06:28:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:28:15] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 06:28:15] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2025-06-03 06:28: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/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/12 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 10/22 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/22 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 15 constraints, problems are : Problem set: 0 solved, 9 unsolved in 161 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/12 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 10/22 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/22 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 24 constraints, problems are : Problem set: 0 solved, 9 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 338ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 338ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/20 places, 10/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 403 ms. Remains : 12/20 places, 10/18 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 p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 171 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter insensitive) to 7 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 288 ms :[(OR p0 p1), true, p0, p1, false, false, false]
RANDOM walk for 3152 steps (7 resets) in 5 ms. (525 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2) (NOT p0)))), (F (NOT (OR p1 p2 p0))), (F p1), (F (NOT p0)), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR p1 (NOT p2) p0)))]
Knowledge based reduction with 15 factoid took 524 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter insensitive) to 7 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 315 ms :[(OR p0 p1), true, p0, p1, false, false, false]
Stuttering acceptance computed with spot in 292 ms :[(OR p0 p1), true, p0, p1, false, false, false]
[2025-06-03 06:28:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 06:28:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-03 06:28:17] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-03 06:28:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 06:28:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-03 06:28:18] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-03 06:28:18] [INFO ] Computed and/alt/rep : 9/9/9 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 06:28:18] [INFO ] Added : 5 causal constraints over 1 iterations in 12 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 291 ms :[(OR p0 p1), true, p0, p1, false, false, false]
Product exploration explored 100000 steps with 402 reset in 96 ms.
Stack based approach found an accepted trace after 633 steps with 1 reset with depth 288 and stack size 288 in 1 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-11 finished in 5163 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 23 transition count 15
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 20 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 20 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 18 transition count 13
Applied a total of 12 rules in 2 ms. Remains 18 /25 variables (removed 7) and now considering 13/18 (removed 5) transitions.
// Phase 1: matrix 13 rows 18 cols
[2025-06-03 06:28:18] [INFO ] Computed 6 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:28:18] [INFO ] Implicit Places using invariants in 42 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/25 places, 13/18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 17 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 16 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 16 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 15 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 14 transition count 10
Applied a total of 6 rules in 2 ms. Remains 14 /17 variables (removed 3) and now considering 10/13 (removed 3) transitions.
// Phase 1: matrix 10 rows 14 cols
[2025-06-03 06:28:18] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:28:18] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-03 06:28:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:28:18] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/25 places, 10/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 117 ms. Remains : 14/25 places, 10/18 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-13
Product exploration explored 100000 steps with 1137 reset in 139 ms.
Product exploration explored 100000 steps with 1109 reset in 202 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 p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 178 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 2201 steps (3 resets) in 8 ms. (244 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 8 factoid took 350 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2025-06-03 06:28:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:28:19] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-03 06:28:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:28:19] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 06:28:19] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2025-06-03 06:28:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1/14 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/24 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/24 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 19 constraints, problems are : Problem set: 0 solved, 9 unsolved in 177 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1/14 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/24 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 28 constraints, problems are : Problem set: 0 solved, 9 unsolved in 173 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 353ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 354ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 430 ms. Remains : 14/14 places, 10/10 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 p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 154 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 2731 steps (3 resets) in 9 ms. (273 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 8 factoid took 321 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1104 reset in 197 ms.
Product exploration explored 100000 steps with 1156 reset in 209 ms.
Built C files in :
/tmp/ltsmin13477397656051919486
[2025-06-03 06:28:21] [INFO ] Computing symmetric may disable matrix : 10 transitions.
[2025-06-03 06:28:21] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 06:28:21] [INFO ] Computing symmetric may enable matrix : 10 transitions.
[2025-06-03 06:28:21] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 06:28:21] [INFO ] Computing Do-Not-Accords matrix : 10 transitions.
[2025-06-03 06:28:21] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 06:28:21] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13477397656051919486
Running compilation step : cd /tmp/ltsmin13477397656051919486;'/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 156 ms.
Running link step : cd /tmp/ltsmin13477397656051919486;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin13477397656051919486;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5270756395848792138.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2025-06-03 06:28:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:28:36] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-06-03 06:28:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:28:36] [INFO ] Implicit Places using invariants and state equation in 31 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-03 06:28:36] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2025-06-03 06:28:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1/14 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/24 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/24 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 19 constraints, problems are : Problem set: 0 solved, 9 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1/14 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/24 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 28 constraints, problems are : Problem set: 0 solved, 9 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 380ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 381ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 453 ms. Remains : 14/14 places, 10/10 transitions.
Built C files in :
/tmp/ltsmin8050978953147704381
[2025-06-03 06:28:37] [INFO ] Computing symmetric may disable matrix : 10 transitions.
[2025-06-03 06:28:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 06:28:37] [INFO ] Computing symmetric may enable matrix : 10 transitions.
[2025-06-03 06:28:37] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 06:28:37] [INFO ] Computing Do-Not-Accords matrix : 10 transitions.
[2025-06-03 06:28:37] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 06:28:37] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8050978953147704381
Running compilation step : cd /tmp/ltsmin8050978953147704381;'/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 110 ms.
Running link step : cd /tmp/ltsmin8050978953147704381;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin8050978953147704381;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10204490776027379076.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 06:28:52] [INFO ] Flatten gal took : 1 ms
[2025-06-03 06:28:52] [INFO ] Flatten gal took : 2 ms
[2025-06-03 06:28:52] [INFO ] Time to serialize gal into /tmp/LTL5963095661605985062.gal : 0 ms
[2025-06-03 06:28:52] [INFO ] Time to serialize properties into /tmp/LTL8071671643717722729.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5963095661605985062.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17247150139532395294.hoa' '-atoms' '/tmp/LTL8071671643717722729.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/LTL8071671643717722729.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17247150139532395294.hoa
Detected timeout of ITS tools.
[2025-06-03 06:29:07] [INFO ] Flatten gal took : 1 ms
[2025-06-03 06:29:07] [INFO ] Flatten gal took : 1 ms
[2025-06-03 06:29:07] [INFO ] Time to serialize gal into /tmp/LTL13144544145615294974.gal : 1 ms
[2025-06-03 06:29:07] [INFO ] Time to serialize properties into /tmp/LTL17414587060484897044.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/LTL13144544145615294974.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17414587060484897044.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("((SA<1)||(SwA<1))")||((G("(SpG>=1)"))||("((CA>=1)&&(CwA>=1))"))))))
Formula 0 simplified : G(F!"(SpG>=1)" & FG(!"((CA>=1)&&(CwA>=1))" & !"((SA<1)||(SwA<1))"))
Detected timeout of ITS tools.
[2025-06-03 06:29:22] [INFO ] Flatten gal took : 1 ms
[2025-06-03 06:29:22] [INFO ] Applying decomposition
[2025-06-03 06:29:22] [INFO ] Flatten gal took : 2 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/graph4786667541994813341.txt' '-o' '/tmp/graph4786667541994813341.bin' '-w' '/tmp/graph4786667541994813341.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4786667541994813341.bin' '-l' '-1' '-v' '-w' '/tmp/graph4786667541994813341.weights' '-q' '0' '-e' '0.001'
[2025-06-03 06:29:22] [INFO ] Decomposing Gal with order
[2025-06-03 06:29:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 06:29:22] [INFO ] Flatten gal took : 2 ms
[2025-06-03 06:29:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-03 06:29:22] [INFO ] Time to serialize gal into /tmp/LTL14322236946014928114.gal : 1 ms
[2025-06-03 06:29:22] [INFO ] Time to serialize properties into /tmp/LTL9684077916523398493.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/LTL14322236946014928114.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9684077916523398493.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(("((u0.SA<1)||(i0.u5.SwA<1))")||((G("(u4.SpG>=1)"))||("((i0.u1.CA>=1)&&(i1.u2.CwA>=1))"))))))
Formula 0 simplified : G(F!"(u4.SpG>=1)" & FG(!"((i0.u1.CA>=1)&&(i1.u2.CwA>=1))" & !"((u0.SA<1)||(i0.u5.SwA<1))"))
Detected timeout of ITS tools.
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-13 finished in 78910 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G((p1||X(p1))))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2025-06-03 06:29:37] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:29:37] [INFO ] Implicit Places using invariants in 32 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-14
Product exploration explored 100000 steps with 1200 reset in 96 ms.
Product exploration explored 100000 steps with 1212 reset in 146 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 (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 111 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 2032 steps (2 resets) in 6 ms. (290 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 9 factoid took 158 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 18 rows 21 cols
[2025-06-03 06:29:38] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 06:29:38] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 06:29:38] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-03 06:29:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 06:29:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 06:29:38] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-03 06:29:38] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 06:29:38] [INFO ] Added : 14 causal constraints over 3 iterations in 16 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2025-06-03 06:29:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:29:38] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-03 06:29:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:29:38] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2025-06-03 06:29:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 25 constraints, problems are : Problem set: 0 solved, 17 unsolved in 397 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 42 constraints, problems are : Problem set: 0 solved, 17 unsolved in 399 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 801ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 801ms
Finished structural reductions in LTL mode , in 1 iterations and 881 ms. Remains : 21/21 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 96 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1343 steps (0 resets) in 4 ms. (268 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 120 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2025-06-03 06:29:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 06:29:40] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 06:29:40] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-03 06:29:40] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 06:29:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 06:29:40] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-03 06:29:40] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 06:29:40] [INFO ] Added : 14 causal constraints over 3 iterations in 21 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1213 reset in 402 ms.
Product exploration explored 100000 steps with 1228 reset in 231 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 21 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 7 place count 21 transition count 18
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 21 transition count 18
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 14 place count 17 transition count 14
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 18 place count 17 transition count 14
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 17 transition count 14
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 15 transition count 12
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 15 transition count 12
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 24 rules in 6 ms. Remains 15 /21 variables (removed 6) and now considering 12/18 (removed 6) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 06:29:41] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
// Phase 1: matrix 12 rows 15 cols
[2025-06-03 06:29:41] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 1/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
At refinement iteration 4 (OVERLAPS) 12/27 variables, 15/19 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/19 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/27 variables, 0/19 constraints. Problems are: Problem set: 6 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/27 variables, and 19 constraints, problems are : Problem set: 6 solved, 5 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 7/15 variables, 4/4 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 12/27 variables, 15/19 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 5/24 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/24 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/27 variables, 0/24 constraints. Problems are: Problem set: 6 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/27 variables, and 24 constraints, problems are : Problem set: 6 solved, 5 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 5/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 254ms problems are : Problem set: 6 solved, 5 unsolved
Search for dead transitions found 6 dead transitions in 254ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 15/21 places, 6/18 transitions.
Graph (complete) has 17 edges and 15 vertex of which 9 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 9 /15 variables (removed 6) and now considering 6/6 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/21 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 267 ms. Remains : 9/21 places, 6/18 transitions.
Built C files in :
/tmp/ltsmin11811912610251450871
[2025-06-03 06:29:41] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11811912610251450871
Running compilation step : cd /tmp/ltsmin11811912610251450871;'/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 99 ms.
Running link step : cd /tmp/ltsmin11811912610251450871;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin11811912610251450871;'/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/stateBased1335391642174092517.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2025-06-03 06:29:56] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:29:56] [INFO ] Implicit Places using invariants in 32 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34 ms. Remains : 20/21 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin10011284517365684772
[2025-06-03 06:29:56] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10011284517365684772
Running compilation step : cd /tmp/ltsmin10011284517365684772;'/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/ltsmin10011284517365684772;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin10011284517365684772;'/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/stateBased12078104120413796409.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 06:30:12] [INFO ] Flatten gal took : 2 ms
[2025-06-03 06:30:12] [INFO ] Flatten gal took : 2 ms
[2025-06-03 06:30:12] [INFO ] Time to serialize gal into /tmp/LTL4316608915895819936.gal : 0 ms
[2025-06-03 06:30:12] [INFO ] Time to serialize properties into /tmp/LTL13306461752121895866.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4316608915895819936.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18199911647477411845.hoa' '-atoms' '/tmp/LTL13306461752121895866.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13306461752121895866.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18199911647477411845.hoa
Detected timeout of ITS tools.
[2025-06-03 06:30:27] [INFO ] Flatten gal took : 3 ms
[2025-06-03 06:30:27] [INFO ] Flatten gal took : 2 ms
[2025-06-03 06:30:27] [INFO ] Time to serialize gal into /tmp/LTL8481238255661805199.gal : 0 ms
[2025-06-03 06:30:27] [INFO ] Time to serialize properties into /tmp/LTL16362099412921353972.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/LTL8481238255661805199.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16362099412921353972.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((F("(SpA>=1)"))||(G(("((CA>=1)&&(CwA>=1))")||(X("((CA>=1)&&(CwA>=1))")))))))
Formula 0 simplified : X(G!"(SpA>=1)" & F(!"((CA>=1)&&(CwA>=1))" & X!"((CA>=1)&&(CwA>=1))"))
Detected timeout of ITS tools.
[2025-06-03 06:30:42] [INFO ] Flatten gal took : 2 ms
[2025-06-03 06:30:42] [INFO ] Applying decomposition
[2025-06-03 06:30:42] [INFO ] Flatten gal took : 1 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/graph7277312856534980268.txt' '-o' '/tmp/graph7277312856534980268.bin' '-w' '/tmp/graph7277312856534980268.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7277312856534980268.bin' '-l' '-1' '-v' '-w' '/tmp/graph7277312856534980268.weights' '-q' '0' '-e' '0.001'
[2025-06-03 06:30:42] [INFO ] Decomposing Gal with order
[2025-06-03 06:30:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 06:30:42] [INFO ] Removed a total of 1 redundant transitions.
[2025-06-03 06:30:42] [INFO ] Flatten gal took : 3 ms
[2025-06-03 06:30:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-03 06:30:42] [INFO ] Time to serialize gal into /tmp/LTL11692984430939406997.gal : 1 ms
[2025-06-03 06:30:42] [INFO ] Time to serialize properties into /tmp/LTL15057066341557406801.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/LTL11692984430939406997.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15057066341557406801.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 : !((X((F("(u0.SpA>=1)"))||(G(("((u4.CA>=1)&&(u3.CwA>=1))")||(X("((u4.CA>=1)&&(u3.CwA>=1))")))))))
Formula 0 simplified : X(G!"(u0.SpA>=1)" & F(!"((u4.CA>=1)&&(u3.CwA>=1))" & X!"((u4.CA>=1)&&(u3.CwA>=1))"))
Detected timeout of ITS tools.
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-14 finished in 79883 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(X((p1||F(p2))))&&p0)))))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2025-06-03 06:30:57] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:30:57] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-03 06:30:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:30:57] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2025-06-03 06:30:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 25 constraints, problems are : Problem set: 0 solved, 17 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 42 constraints, problems are : Problem set: 0 solved, 17 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 654ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 655ms
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 731 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-15 finished in 1051 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X((p0&&F(p1))))&&(p0 U p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U (G(!p1) U X(p2)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((F(p0)&&X(X(F(p1))))) U (X(F(p3))&&p2))))'
Found a Shortening insensitive property : ClientsAndServers-PT-N0005P1-LTLFireability-09
Stuttering acceptance computed with spot in 357 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (NOT p3), (NOT p0), (NOT p1), (NOT p1)]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 23 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 20 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 18 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 18 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 17 transition count 12
Applied a total of 14 rules in 3 ms. Remains 17 /25 variables (removed 8) and now considering 12/18 (removed 6) transitions.
// Phase 1: matrix 12 rows 17 cols
[2025-06-03 06:30:59] [INFO ] Computed 6 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:30:59] [INFO ] Implicit Places using invariants in 39 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 16/25 places, 12/18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 16 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 15 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 15 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 14 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 13 transition count 9
Applied a total of 6 rules in 5 ms. Remains 13 /16 variables (removed 3) and now considering 9/12 (removed 3) transitions.
// Phase 1: matrix 9 rows 13 cols
[2025-06-03 06:30:59] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:30:59] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-03 06:30:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:30:59] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 13/25 places, 9/18 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 167 ms. Remains : 13/25 places, 9/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-09
Product exploration explored 100000 steps with 16622 reset in 125 ms.
Product exploration explored 100000 steps with 16561 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 p2) (NOT p0) (NOT p3) p1), (X (NOT p3)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (NOT p0)), (X (X (NOT p3))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 170 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 6 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 332 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (NOT p3), (NOT p0), (NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 421 steps (0 resets) in 6 ms. (60 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) p1), (X (NOT p3)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (NOT p0)), (X (X (NOT p3))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 (NOT p2)))), (F p3), (F p2), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 395 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 6 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (NOT p3), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 288 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (NOT p3), (NOT p0), (NOT p1), (NOT p1)]
[2025-06-03 06:31:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 06:31:01] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-03 06:31:01] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 06:31:01] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-03 06:31:01] [INFO ] Computed and/alt/rep : 8/10/8 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 06:31:01] [INFO ] Added : 5 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG (NOT p2)
[2025-06-03 06:31:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 06:31:01] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-03 06:31:01] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 06:31:01] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-03 06:31:01] [INFO ] Computed and/alt/rep : 8/10/8 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 06:31:01] [INFO ] Added : 5 causal constraints over 1 iterations in 12 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 5 out of 13 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 13 /13 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2025-06-03 06:31:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:31:01] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-03 06:31:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:31:01] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 8 sub problems to find dead transitions.
[2025-06-03 06:31:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1/13 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 9/22 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/22 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 18 constraints, problems are : Problem set: 0 solved, 8 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1/13 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 9/22 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/22 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/22 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 26 constraints, problems are : Problem set: 0 solved, 8 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 324ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 324ms
Finished structural reductions in LTL mode , in 1 iterations and 398 ms. Remains : 13/13 places, 9/9 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 p3) p1), (X (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (X (NOT p3))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 158 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 6 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (NOT p3), (NOT p0), (NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 608 steps (1 resets) in 5 ms. (101 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) p1), (X (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (X (NOT p3))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 (NOT p2)))), (F p3), (F p2), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 263 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 6 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (NOT p3), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (NOT p3), (NOT p0), (NOT p1), (NOT p1)]
[2025-06-03 06:31:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 06:31:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-03 06:31:03] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 06:31:03] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-03 06:31:03] [INFO ] Computed and/alt/rep : 8/10/8 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 06:31:03] [INFO ] Added : 5 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG (NOT p2)
[2025-06-03 06:31:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 06:31:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-03 06:31:03] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-03 06:31:03] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-03 06:31:03] [INFO ] Computed and/alt/rep : 8/10/8 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 06:31:03] [INFO ] Added : 5 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 307 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (NOT p3), (NOT p0), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 16558 reset in 75 ms.
Product exploration explored 100000 steps with 16645 reset in 85 ms.
Applying partial POR strategy [false, false, true, true, false, true]
Stuttering acceptance computed with spot in 308 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (NOT p3), (NOT p0), (NOT p1), (NOT p1)]
Support contains 5 out of 13 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 06:31:04] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2025-06-03 06:31: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/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1/13 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 9/22 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/22 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 18 constraints, problems are : Problem set: 0 solved, 8 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1/13 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 9/22 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/22 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/22 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 26 constraints, problems are : Problem set: 0 solved, 8 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 345ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 346ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 354 ms. Remains : 13/13 places, 9/9 transitions.
Built C files in :
/tmp/ltsmin9997638404071871844
[2025-06-03 06:31:04] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9997638404071871844
Running compilation step : cd /tmp/ltsmin9997638404071871844;'/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 96 ms.
Running link step : cd /tmp/ltsmin9997638404071871844;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin9997638404071871844;'/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/stateBased15459451573598200543.hoa' '--buchi-type=spotba'
LTSmin run took 9194 ms.
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-09 finished in 15140 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G((p1||X(p1))))))'
[2025-06-03 06:31:14] [INFO ] Flatten gal took : 2 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10349479687252429744
[2025-06-03 06:31:14] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2025-06-03 06:31:14] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 06:31:14] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2025-06-03 06:31:14] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 06:31:14] [INFO ] Applying decomposition
[2025-06-03 06:31:14] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2025-06-03 06:31:14] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 06:31:14] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10349479687252429744
Running compilation step : cd /tmp/ltsmin10349479687252429744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '144' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-03 06:31:14] [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/graph11481917820798453370.txt' '-o' '/tmp/graph11481917820798453370.bin' '-w' '/tmp/graph11481917820798453370.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11481917820798453370.bin' '-l' '-1' '-v' '-w' '/tmp/graph11481917820798453370.weights' '-q' '0' '-e' '0.001'
[2025-06-03 06:31:14] [INFO ] Decomposing Gal with order
[2025-06-03 06:31:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 06:31:14] [INFO ] Removed a total of 1 redundant transitions.
[2025-06-03 06:31:14] [INFO ] Flatten gal took : 5 ms
[2025-06-03 06:31:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-03 06:31:14] [INFO ] Time to serialize gal into /tmp/LTLFireability13308328451999129229.gal : 1 ms
[2025-06-03 06:31:14] [INFO ] Time to serialize properties into /tmp/LTLFireability1996942545686354951.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/LTLFireability13308328451999129229.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1996942545686354951.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 5 LTL properties
Checking formula 0 : !((F((X(X(("(i0.u6.SpA>=1)")&&(F("(u7.Ci>=1)")))))&&(("(i0.u6.SpA>=1)")U("((i0.u6.CA>=1)&&(u7.CwA>=1))")))))
Formula 0 simplified : G(XX(!"(i0.u6.SpA>=1)" | G!"(u7.Ci>=1)") | (!"(i0.u6.SpA>=1)" R !"((i0.u6.CA>=1)&&(u7.CwA>=1))"))
Compilation finished in 121 ms.
Running link step : cd /tmp/ltsmin10349479687252429744;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin10349479687252429744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X(X(((LTLAPp0==true)&&<>((LTLAPp1==true)))))&&((LTLAPp0==true) U (LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin10349479687252429744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X(X(((LTLAPp0==true)&&<>((LTLAPp1==true)))))&&((LTLAPp0==true) U (LTLAPp2==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10349479687252429744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp1==true)) U ([](!(LTLAPp3==true)) U X((LTLAPp4==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin10349479687252429744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp1==true)) U ([](!(LTLAPp3==true)) U X((LTLAPp4==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10349479687252429744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((<>((LTLAPp5==true))&&X(X(<>((LTLAPp1==true)))))) U (X(<>((LTLAPp7==true)))&&(LTLAPp6==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin10349479687252429744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((<>((LTLAPp5==true))&&X(X(<>((LTLAPp1==true)))))) U (X(<>((LTLAPp7==true)))&&(LTLAPp6==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10349479687252429744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp4==true))||(LTLAPp8==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin10349479687252429744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp4==true))||(LTLAPp8==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10349479687252429744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp0==true))||[](((LTLAPp2==true)||X((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin10349479687252429744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp0==true))||[](((LTLAPp2==true)||X((LTLAPp2==true))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 5760 s
Running LTSmin : cd /tmp/ltsmin10349479687252429744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X(X(((LTLAPp0==true)&&<>((LTLAPp1==true)))))&&((LTLAPp0==true) U (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( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: 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( 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( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: LTL layer: formula: <>((X(X(((LTLAPp0==true)&&<>((LTLAPp1==true)))))&&((LTLAPp0==true) U (LTLAPp2==true))))
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: "<>((X(X(((LTLAPp0==true)&&<>((LTLAPp1==true)))))&&((LTLAPp0==true) U (LTLAPp2==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: buchi has 10 states
pins2lts-mc-linux64( 0/ 8), 0.017: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.061: DFS-FIFO for weak LTL, using special progress label 28
pins2lts-mc-linux64( 0/ 8), 0.061: There are 29 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.061: State length is 26, there are 48 groups
pins2lts-mc-linux64( 0/ 8), 0.061: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.061: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.061: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.061: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.171: ~111 levels ~960 states ~5288 transitions
pins2lts-mc-linux64( 6/ 8), 0.244: ~213 levels ~1920 states ~9504 transitions
pins2lts-mc-linux64( 6/ 8), 0.282: ~237 levels ~3840 states ~12920 transitions
pins2lts-mc-linux64( 6/ 8), 0.363: ~417 levels ~7680 states ~19304 transitions
pins2lts-mc-linux64( 6/ 8), 0.445: ~435 levels ~15360 states ~35656 transitions
pins2lts-mc-linux64( 1/ 8), 0.599: ~432 levels ~30720 states ~85344 transitions
pins2lts-mc-linux64( 6/ 8), 0.842: ~435 levels ~61440 states ~160048 transitions
pins2lts-mc-linux64( 6/ 8), 1.283: ~435 levels ~122880 states ~320336 transitions
pins2lts-mc-linux64( 6/ 8), 2.142: ~435 levels ~245760 states ~585672 transitions
pins2lts-mc-linux64( 6/ 8), 3.267: ~435 levels ~491520 states ~1210504 transitions
pins2lts-mc-linux64( 6/ 8), 4.556: ~435 levels ~983040 states ~2356504 transitions
pins2lts-mc-linux64( 6/ 8), 5.981: ~435 levels ~1966080 states ~4695888 transitions
pins2lts-mc-linux64( 6/ 8), 8.987: ~435 levels ~3932160 states ~10301656 transitions
pins2lts-mc-linux64( 6/ 8), 14.576: ~435 levels ~7864320 states ~21315312 transitions
pins2lts-mc-linux64( 6/ 8), 26.022: ~435 levels ~15728640 states ~43391800 transitions
pins2lts-mc-linux64( 6/ 8), 49.163: ~435 levels ~31457280 states ~87581984 transitions
pins2lts-mc-linux64( 6/ 8), 97.894: ~435 levels ~62914560 states ~175564976 transitions
pins2lts-mc-linux64( 6/ 8), 163.803: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 163.857:
pins2lts-mc-linux64( 0/ 8), 163.857: mean standard work distribution: 4.9% (states) 3.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 163.857:
pins2lts-mc-linux64( 0/ 8), 163.857: Explored 87381208 states 297414039 transitions, fanout: 3.404
pins2lts-mc-linux64( 0/ 8), 163.857: Total exploration time 163.780 sec (163.730 sec minimum, 163.758 sec on average)
pins2lts-mc-linux64( 0/ 8), 163.857: States per second: 533528, Transitions per second: 1815936
pins2lts-mc-linux64( 0/ 8), 163.857:
pins2lts-mc-linux64( 0/ 8), 163.857: Progress states detected: 0
pins2lts-mc-linux64( 0/ 8), 163.857: Redundant explorations: 0.2368
pins2lts-mc-linux64( 0/ 8), 163.857:
pins2lts-mc-linux64( 0/ 8), 163.857: Queue width: 8B, total height: 3514, memory: 0.03MB
pins2lts-mc-linux64( 0/ 8), 163.857: Tree memory: 921.1MB, 11.1 B/state, compr.: 10.5%
pins2lts-mc-linux64( 0/ 8), 163.857: Tree fill ratio (roots/leafs): 64.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 163.857: Stored 19 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 163.857: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 163.857: Est. total memory use: 921.1MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10349479687252429744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X(X(((LTLAPp0==true)&&<>((LTLAPp1==true)))))&&((LTLAPp0==true) U (LTLAPp2==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10349479687252429744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X(X(((LTLAPp0==true)&&<>((LTLAPp1==true)))))&&((LTLAPp0==true) U (LTLAPp2==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:121)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-03 06:53:40] [INFO ] Flatten gal took : 2 ms
[2025-06-03 06:53:40] [INFO ] Time to serialize gal into /tmp/LTLFireability4743425274197665583.gal : 0 ms
[2025-06-03 06:53:40] [INFO ] Time to serialize properties into /tmp/LTLFireability13135026218286762801.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/LTLFireability4743425274197665583.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13135026218286762801.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...298
Read 5 LTL properties
Checking formula 0 : !((F((X(X(("(SpA>=1)")&&(F("(Ci>=1)")))))&&(("(SpA>=1)")U("((CA>=1)&&(CwA>=1))")))))
Formula 0 simplified : G(XX(!"(SpA>=1)" | G!"(Ci>=1)") | (!"(SpA>=1)" R !"((CA>=1)&&(CwA>=1))"))
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2025-06-03 07:16:06] [INFO ] Flatten gal took : 2 ms
[2025-06-03 07:16:06] [INFO ] Input system was already deterministic with 18 transitions.
[2025-06-03 07:16:06] [INFO ] Transformed 25 places.
[2025-06-03 07:16:06] [INFO ] Transformed 18 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-03 07:16:06] [INFO ] Time to serialize gal into /tmp/LTLFireability14852296262246001763.gal : 1 ms
[2025-06-03 07:16:06] [INFO ] Time to serialize properties into /tmp/LTLFireability40866180907111818.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/LTLFireability14852296262246001763.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability40866180907111818.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...341
Read 5 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((X(X(("(SpA>=1)")&&(F("(Ci>=1)")))))&&(("(SpA>=1)")U("((CA>=1)&&(CwA>=1))")))))
Formula 0 simplified : G(XX(!"(SpA>=1)" | G!"(Ci>=1)") | (!"(SpA>=1)" R !"((CA>=1)&&(CwA>=1))"))
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Computing Next relation with stutter on 1 deadlock states

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ClientsAndServers-PT-N0005P1"
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 ClientsAndServers-PT-N0005P1, 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 r030-smll-174853814000476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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