About the Execution of ITS-Tools for ClientsAndServers-PT-N0010P1
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 3600000.00 | 0.00 | 0.00 | ?FFFFTFFFFFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r030-smll-174853814000492.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-N0010P1, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853814000492
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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 24K 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 100K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K 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-N0010P1-LTLFireability-00
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-01
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-02
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-03
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-04
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-05
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-06
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-07
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-08
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-09
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-10
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-11
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-12
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-13
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-14
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748945212836
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-N0010P1
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 10:06:55] [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 10:06:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 10:06:55] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2025-06-03 10:06:55] [INFO ] Transformed 25 places.
[2025-06-03 10:06:55] [INFO ] Transformed 18 transitions.
[2025-06-03 10:06:55] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 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 10:06:55] [INFO ] Computed 8 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:06:56] [INFO ] Implicit Places using invariants in 307 ms returned []
[2025-06-03 10:06:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:06:56] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2025-06-03 10:06:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/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 1655 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 5585 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 7296ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 7315ms
Finished structural reductions in LTL mode , in 1 iterations and 7827 ms. Remains : 25/25 places, 18/18 transitions.
Support contains 24 out of 25 places after structural reductions.
[2025-06-03 10:07:03] [INFO ] Flatten gal took : 22 ms
[2025-06-03 10:07:03] [INFO ] Flatten gal took : 8 ms
[2025-06-03 10:07:03] [INFO ] Input system was already deterministic with 18 transitions.
Reduction of identical properties reduced properties to check from 18 to 17
RANDOM walk for 2394 steps (0 resets) in 51 ms. (46 steps per ms) remains 0/17 properties
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(((X(p0) U p1)&&X(X(p2))))||X(F(p3)))))'
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 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 7 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 10:07:04] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:07:04] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-03 10:07:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:07:04] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2025-06-03 10:07: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/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/22 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/40 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (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 452 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 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, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/22 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/40 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (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 463 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 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 924ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 925ms
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1038 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 525 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3)))]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLFireability-00
Product exploration explored 100000 steps with 5155 reset in 500 ms.
Product exploration explored 100000 steps with 5208 reset in 242 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 p3) (NOT p1) (NOT p0) (NOT p2)), (X (NOT p3)), (X (AND (NOT p3) (NOT p1))), (X (NOT p1)), (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 138 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 330 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3)))]
RANDOM walk for 3288 steps (2 resets) in 20 ms. (156 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (X (NOT p3)), (X (AND (NOT p3) (NOT p1))), (X (NOT p1)), (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p3)))), (F p0), (F (NOT (AND (NOT p3) (NOT p2)))), (F p3), (F (NOT (AND (NOT p0) (NOT p3)))), (F p2), (F (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (F p1)]
Knowledge based reduction with 9 factoid took 422 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 287 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 302 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3)))]
[2025-06-03 10:07:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 10:07:08] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-03 10:07:08] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-03 10:07:08] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-03 10:07:08] [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 10:07:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 10:07:08] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-03 10:07:08] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-03 10:07:08] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 10:07:08] [INFO ] Added : 14 causal constraints over 3 iterations in 40 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p3))
[2025-06-03 10:07:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 10:07:08] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-03 10:07:08] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 7 ms returned sat
[2025-06-03 10:07:08] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-03 10:07:08] [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 10:07:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 10:07:08] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-03 10:07:08] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:07:08] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 12 ms to minimize.
[2025-06-03 10:07:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2025-06-03 10:07:08] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 10:07:08] [INFO ] Added : 14 causal constraints over 3 iterations in 20 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Support contains 6 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.
[2025-06-03 10:07:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:07:08] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-03 10:07:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:07:08] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2025-06-03 10:07:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/22 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/40 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (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 364 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 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, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/22 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/40 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (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 468 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 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 839ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 839ms
Finished structural reductions in LTL mode , in 1 iterations and 942 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 p3) (NOT p1) (NOT p0) (NOT p2)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 113 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 295 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3)))]
RANDOM walk for 2137 steps (0 resets) in 10 ms. (194 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p3)))), (F (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (F p0), (F (NOT (AND (NOT p3) (NOT p2)))), (F p3), (F (NOT (AND (NOT p3) (NOT p0)))), (F p2), (F (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (F p1)]
Knowledge based reduction with 6 factoid took 422 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 294 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 287 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3)))]
[2025-06-03 10:07:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 10:07:11] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 10:07:11] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-03 10:07:11] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-03 10:07:11] [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 10:07:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 10:07:11] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-03 10:07:11] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-06-03 10:07:11] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 10:07:11] [INFO ] Added : 14 causal constraints over 3 iterations in 26 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p3))
[2025-06-03 10:07:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 10:07:11] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 10:07:11] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-03 10:07:11] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-03 10:07:11] [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 10:07:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 10:07:11] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-03 10:07:11] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:07:11] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 3 ms to minimize.
[2025-06-03 10:07:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2025-06-03 10:07:11] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 10:07:11] [INFO ] Added : 14 causal constraints over 3 iterations in 22 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Stuttering acceptance computed with spot in 289 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3)))]
Product exploration explored 100000 steps with 5222 reset in 175 ms.
Product exploration explored 100000 steps with 5171 reset in 145 ms.
Built C files in :
/tmp/ltsmin14679359912444630730
[2025-06-03 10:07:12] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14679359912444630730
Running compilation step : cd /tmp/ltsmin14679359912444630730;'/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 469 ms.
Running link step : cd /tmp/ltsmin14679359912444630730;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 79 ms.
Running LTSmin : cd /tmp/ltsmin14679359912444630730;'/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/stateBased15991088042375347700.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 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 10:07:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:07:27] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-03 10:07:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:07:27] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2025-06-03 10:07:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/22 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/40 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (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 433 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 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, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/22 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/40 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (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 375 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 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 814ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 814ms
Finished structural reductions in LTL mode , in 1 iterations and 925 ms. Remains : 22/22 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin5722538725230971453
[2025-06-03 10:07:28] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5722538725230971453
Running compilation step : cd /tmp/ltsmin5722538725230971453;'/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 148 ms.
Running link step : cd /tmp/ltsmin5722538725230971453;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin5722538725230971453;'/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/stateBased5254981059969683466.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 10:07:43] [INFO ] Flatten gal took : 8 ms
[2025-06-03 10:07:43] [INFO ] Flatten gal took : 3 ms
[2025-06-03 10:07:43] [INFO ] Time to serialize gal into /tmp/LTL6891575391407515094.gal : 2 ms
[2025-06-03 10:07:43] [INFO ] Time to serialize properties into /tmp/LTL11046001352244284564.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/LTL6891575391407515094.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17290895161551097354.hoa' '-atoms' '/tmp/LTL11046001352244284564.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/LTL11046001352244284564.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17290895161551097354.hoa
Detected timeout of ITS tools.
[2025-06-03 10:07:58] [INFO ] Flatten gal took : 4 ms
[2025-06-03 10:07:58] [INFO ] Flatten gal took : 3 ms
[2025-06-03 10:07:58] [INFO ] Time to serialize gal into /tmp/LTL9091696282947587376.gal : 1 ms
[2025-06-03 10:07:58] [INFO ] Time to serialize properties into /tmp/LTL10526183333027892108.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/LTL9091696282947587376.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10526183333027892108.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 : !((F((X(((X("(SpG>=1)"))U("((SR>=1)&&(Mi>=1))"))&&(X(X("((SG>=1)&&(SwG>=1))")))))||(X(F("(SpA>=1)"))))))
Formula 0 simplified : XG(!"(SpA>=1)" & (XX!"((SG>=1)&&(SwG>=1))" | (!"((SR>=1)&&(Mi>=1))" & X(!"((SR>=1)&&(Mi>=1))" W !"(SpG>=1)"))))
Detected timeout of ITS tools.
[2025-06-03 10:08:13] [INFO ] Flatten gal took : 5 ms
[2025-06-03 10:08:13] [INFO ] Applying decomposition
[2025-06-03 10:08:13] [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/graph11501006786982372772.txt' '-o' '/tmp/graph11501006786982372772.bin' '-w' '/tmp/graph11501006786982372772.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11501006786982372772.bin' '-l' '-1' '-v' '-w' '/tmp/graph11501006786982372772.weights' '-q' '0' '-e' '0.001'
[2025-06-03 10:08:13] [INFO ] Decomposing Gal with order
[2025-06-03 10:08:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 10:08:13] [INFO ] Removed a total of 1 redundant transitions.
[2025-06-03 10:08:13] [INFO ] Flatten gal took : 76 ms
[2025-06-03 10:08:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-03 10:08:13] [INFO ] Time to serialize gal into /tmp/LTL14794951278686357355.gal : 3 ms
[2025-06-03 10:08:13] [INFO ] Time to serialize properties into /tmp/LTL3172561668725208378.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/LTL14794951278686357355.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3172561668725208378.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 : !((F((X(((X("(i1.u6.SpG>=1)"))U("((i0.u1.SR>=1)&&(i0.u3.Mi>=1))"))&&(X(X("((i0.u4.SG>=1)&&(i1.u6.SwG>=1))")))))||(X(F("(i3.u7.SpA>=1)"...161
Formula 0 simplified : XG(!"(i3.u7.SpA>=1)" & (XX!"((i0.u4.SG>=1)&&(i1.u6.SwG>=1))" | (!"((i0.u1.SR>=1)&&(i0.u3.Mi>=1))" & X(!"((i0.u1.SR>=1)&&(i0.u3.Mi>=1...182
Detected timeout of ITS tools.
Treatment of property ClientsAndServers-PT-N0010P1-LTLFireability-00 finished in 84741 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)||X(G(p1))))'
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 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 10:08:29] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:08:29] [INFO ] Implicit Places using invariants in 64 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 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 68 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 158 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLFireability-02
Entered a terminal (fully accepting) state of product in 30 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P1-LTLFireability-02 finished in 244 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||(p1&&X(X(p1))&&G(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 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 10:08:29] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:08:29] [INFO ] Implicit Places using invariants in 36 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 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 39 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 404 ms :[true, (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLFireability-03
Entered a terminal (fully accepting) state of product in 90 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P1-LTLFireability-03 finished in 465 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 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 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 22 transition count 13
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 17 transition count 13
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 13 place count 17 transition count 10
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 19 place count 14 transition count 10
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 2 with 4 rules applied. Total rules applied 23 place count 12 transition count 8
Applied a total of 23 rules in 20 ms. Remains 12 /25 variables (removed 13) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2025-06-03 10:08:29] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:08:29] [INFO ] Implicit Places using invariants in 30 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/25 places, 8/18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 11 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 9 transition count 6
Applied a total of 4 rules in 2 ms. Remains 9 /11 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 9 cols
[2025-06-03 10:08:29] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:08:29] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-03 10:08:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:08:29] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/25 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 121 ms. Remains : 9/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLFireability-04
Product exploration explored 100000 steps with 7484 reset in 113 ms.
Product exploration explored 100000 steps with 7462 reset in 124 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 472 steps (0 resets) in 6 ms. (67 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2025-06-03 10:08:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 10:08:30] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 10:08:30] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-03 10:08: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 10:08:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 10:08:30] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-03 10:08:30] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 10:08:30] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2025-06-03 10:08:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:08:30] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-03 10:08:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:08:30] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 10:08:30] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-03 10:08:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/15 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 13 constraints, problems are : Problem set: 0 solved, 5 unsolved in 85 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 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, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/15 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 18 constraints, problems are : Problem set: 0 solved, 5 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 170ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 170ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 229 ms. Remains : 9/9 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
RANDOM walk for 869 steps (1 resets) in 13 ms. (62 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2025-06-03 10:08:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 10:08:31] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 10:08:31] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-03 10:08:31] [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 10:08:31] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 10:08:31] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-03 10:08:31] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 10:08:31] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7529 reset in 88 ms.
Product exploration explored 100000 steps with 7442 reset in 106 ms.
Built C files in :
/tmp/ltsmin5684502099664485674
[2025-06-03 10:08:31] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2025-06-03 10:08:31] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 10:08:31] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2025-06-03 10:08:31] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 10:08:31] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2025-06-03 10:08:31] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 10:08:31] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5684502099664485674
Running compilation step : cd /tmp/ltsmin5684502099664485674;'/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 89 ms.
Running link step : cd /tmp/ltsmin5684502099664485674;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin5684502099664485674;'/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/stateBased2067100621680506410.hoa' '--buchi-type=spotba'
LTSmin run took 560 ms.
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0010P1-LTLFireability-04 finished in 2358 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 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 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 10:08:32] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:08:32] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-03 10:08:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:08:32] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2025-06-03 10:08:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/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 467 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 409 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 882ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 883ms
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 973 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 105 ms :[p0, p0, p0]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLFireability-05
Product exploration explored 100000 steps with 33333 reset in 47 ms.
Product exploration explored 100000 steps with 33333 reset in 69 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 17 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-N0010P1-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0010P1-LTLFireability-05 finished in 1235 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) U G((p0 U (p2 U X(X(p3)))))))'
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 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 10:08:33] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:08:33] [INFO ] Implicit Places using invariants in 29 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 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 32 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 397 ms :[p3, p3, p3, p3, (AND p1 p3), p3, p3, p3]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLFireability-06
Product exploration explored 100000 steps with 12824 reset in 97 ms.
Product exploration explored 100000 steps with 12929 reset in 213 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) (NOT p3)), (X (NOT p2)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p2 p3)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 398 ms. Reduced automaton from 8 states, 23 edges and 4 AP (stutter sensitive) to 8 states, 23 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 379 ms :[p3, p3, p3, p3, (AND p1 p3), p3, p3, p3]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 38954 steps (24 resets) in 108 ms. (357 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2) (NOT p3)), (X (NOT p2)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p2 p3)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p3)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR (NOT p2) (NOT p3)))), (F p2), (F (NOT (OR p0 (NOT p2) (NOT p3)))), (F p3), (F (NOT (OR p0 p1 (NOT p2)))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 (NOT p2))))]
Knowledge based reduction with 17 factoid took 772 ms. Reduced automaton from 8 states, 23 edges and 4 AP (stutter sensitive) to 8 states, 23 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 332 ms :[p3, p3, p3, p3, (AND p1 p3), p3, p3, p3]
Stuttering acceptance computed with spot in 379 ms :[p3, p3, p3, p3, (AND p1 p3), p3, p3, p3]
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 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 10:08:36] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:08:36] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-03 10:08:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:08:36] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2025-06-03 10:08: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/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 321 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 415 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 741ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 742ms
Finished structural reductions in LTL mode , in 1 iterations and 822 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 p1) p0 (NOT p2) (NOT p3)), (X (NOT p2)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (OR (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p2 p3)))), (X (X p0)), (X (X (NOT (OR (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 372 ms. Reduced automaton from 8 states, 23 edges and 4 AP (stutter sensitive) to 8 states, 23 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 450 ms :[p3, p3, p3, p3, (AND p1 p3), p3, p3, p3]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 35317 steps (19 resets) in 45 ms. (767 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2) (NOT p3)), (X (NOT p2)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (OR (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p2 p3)))), (X (X p0)), (X (X (NOT (OR (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p3)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR (NOT p2) (NOT p3)))), (F p2), (F (NOT (OR p0 (NOT p2) (NOT p3)))), (F p3), (F (NOT (OR p0 p1 (NOT p2)))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 (NOT p2))))]
Knowledge based reduction with 19 factoid took 903 ms. Reduced automaton from 8 states, 23 edges and 4 AP (stutter sensitive) to 8 states, 23 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 354 ms :[p3, p3, p3, p3, (AND p1 p3), p3, p3, p3]
Stuttering acceptance computed with spot in 349 ms :[p3, p3, p3, p3, (AND p1 p3), p3, p3, p3]
Stuttering acceptance computed with spot in 368 ms :[p3, p3, p3, p3, (AND p1 p3), p3, p3, p3]
Product exploration explored 100000 steps with 9308 reset in 97 ms.
Product exploration explored 100000 steps with 9246 reset in 117 ms.
Built C files in :
/tmp/ltsmin5709841917689041016
[2025-06-03 10:08:40] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5709841917689041016
Running compilation step : cd /tmp/ltsmin5709841917689041016;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 163 ms.
Running link step : cd /tmp/ltsmin5709841917689041016;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin5709841917689041016;'/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/stateBased5508832431725385754.hoa' '--buchi-type=spotba'
LTSmin run took 238 ms.
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0010P1-LTLFireability-06 finished in 7942 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||G(p1)))&&(G(p0) U X(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 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 2 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 10:08:41] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:08:41] [INFO ] Implicit Places using invariants in 44 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 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 2 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 50 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p2), true, (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLFireability-07
Entered a terminal (fully accepting) state of product in 3 steps with 1 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P1-LTLFireability-07 finished in 338 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 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 10:08:41] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:08:41] [INFO ] Implicit Places using invariants in 37 ms returned [5, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 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.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 6 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 5 transition count 4
Applied a total of 4 rules in 3 ms. Remains 5 /7 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 5 cols
[2025-06-03 10:08:41] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:08:41] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-03 10:08:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:08:41] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/25 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 105 ms. Remains : 5/25 places, 4/18 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLFireability-09
Stuttering criterion allowed to conclude after 1896 steps with 0 reset in 2 ms.
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P1-LTLFireability-09 finished in 177 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)||G(F(((F(p2) U X(X(!p3)))&&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 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 10:08:41] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:08:41] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-03 10:08:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:08:41] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2025-06-03 10:08:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/22 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/40 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (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 461 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 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, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/22 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/40 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (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 447 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 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 917ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 918ms
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1011 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 828 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (OR (NOT p1) p3), (OR (NOT p1) p3), (AND (NOT p2) p3), p3, (AND (NOT p0) (NOT p1) (NOT p2) p3), (AND (NOT p0) p3), (AND (NOT p2) p3), (AND (NOT p2) p3), p3, (AND (NOT p0) (NOT p1) (NOT p2) p3), (AND (NOT p0) (NOT p1) (NOT p2) p3), (AND (NOT p0) p3), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p3)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLFireability-11
Product exploration explored 100000 steps with 996 reset in 122 ms.
Product exploration explored 100000 steps with 1017 reset in 138 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) (NOT p2) p3), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X p3)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (AND (NOT p2) p3))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) p3))), (X (X (AND (NOT p1) (NOT p2) p3))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2) p3))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 33 factoid took 252 ms. Reduced automaton from 15 states, 43 edges and 4 AP (stutter sensitive) to 9 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 506 ms :[(OR (NOT p1) p3), (OR (NOT p1) p3), (OR (NOT p1) p3), (AND (NOT p2) p3), p3, (AND (NOT p2) p3), (AND (NOT p2) p3), p3, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p3))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40037 steps (24 resets) in 61 ms. (645 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 2/2 properties
[2025-06-03 10:08:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf2 is UNSAT
Problem apf5 is UNSAT
After SMT solving in domain Real declared 3/40 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 21 ms.
Refiners :[Positive P Invariants (semi-flows): 0/4 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/22 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) p3), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X p3)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (AND (NOT p2) p3))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) p3))), (X (X (AND (NOT p1) (NOT p2) p3))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2) p3))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR p2 (NOT p1) (NOT p3))), (G (OR p2 (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F p1), (F (NOT (AND (NOT p2) (NOT p1) p3))), (F p2), (F (NOT p3)), (F (NOT (AND (NOT p2) p3)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 35 factoid took 580 ms. Reduced automaton from 9 states, 21 edges and 3 AP (stutter sensitive) to 15 states, 46 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 741 ms :[(OR (NOT p1) p3), (OR (NOT p1) p3), (OR (NOT p1) p3), p3, p3, (NOT p2), false, (AND p1 p3), false, false, false, false, (AND p1 (NOT p2) p3), false, (AND p1 p2 p3)]
Stuttering acceptance computed with spot in 692 ms :[(OR (NOT p1) p3), (OR (NOT p1) p3), (OR (NOT p1) p3), p3, p3, (NOT p2), false, (AND p1 p3), false, false, false, false, (AND p1 (NOT p2) p3), false, (AND p1 p2 p3)]
[2025-06-03 10:08:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 10:08:46] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 10:08:46] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-03 10:08:46] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 10:08:46] [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 10:08:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 10:08:47] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-03 10:08:47] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-03 10:08:47] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 10:08:47] [INFO ] Added : 13 causal constraints over 3 iterations in 22 ms. Result :sat
Could not prove EG (NOT p1)
[2025-06-03 10:08:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 10:08:47] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned unsat
Proved EG p3
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) p3), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X p3)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (AND (NOT p2) p3))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) p3))), (X (X (AND (NOT p1) (NOT p2) p3))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2) p3))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR p2 (NOT p1) (NOT p3))), (G (OR p2 (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F p1), (F (NOT (AND (NOT p2) (NOT p1) p3))), (F p2), (F (NOT p3)), (F (NOT (AND (NOT p2) p3))), (G p3)]
Property proved to be false thanks to negative knowledge :(G p3)
Knowledge based reduction with 35 factoid took 561 ms. Reduced automaton from 15 states, 46 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0010P1-LTLFireability-11 finished in 5872 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 1 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 10:08:47] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:08:47] [INFO ] Implicit Places using invariants in 40 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 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 42 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 110 ms :[p0, p0, p0]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLFireability-12
Product exploration explored 100000 steps with 2200 reset in 87 ms.
Product exploration explored 100000 steps with 2231 reset in 100 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 : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[p0, p0, p0]
RANDOM walk for 3012 steps (2 resets) in 4 ms. (602 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 104 ms :[p0, p0, p0]
// Phase 1: matrix 18 rows 20 cols
[2025-06-03 10:08:48] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 10:08:48] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
Proved EG p0
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (G p0)]
Property proved to be false thanks to negative knowledge :(G p0)
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0010P1-LTLFireability-12 finished in 1008 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
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 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 21 transition count 13
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 14 place count 16 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 16 transition count 11
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 18 place count 14 transition count 11
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 26 place count 10 transition count 7
Applied a total of 26 rules in 3 ms. Remains 10 /25 variables (removed 15) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2025-06-03 10:08:48] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:08:48] [INFO ] Implicit Places using invariants in 28 ms returned [7, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 29 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/25 places, 7/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 8 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 6
Applied a total of 2 rules in 2 ms. Remains 7 /8 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 7 cols
[2025-06-03 10:08:48] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:08:48] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-06-03 10:08:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:08:48] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/25 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 79 ms. Remains : 7/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLFireability-13
Product exploration explored 100000 steps with 18213 reset in 97 ms.
Product exploration explored 100000 steps with 18310 reset in 362 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 124 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 172 steps (0 resets) in 4 ms. (34 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (F p1)]
Knowledge based reduction with 4 factoid took 175 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2025-06-03 10:08:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 10:08:49] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 10:08:49] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-03 10:08:49] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 10:08:49] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
[2025-06-03 10:08:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 10:08:49] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 10:08:49] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-03 10:08:49] [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 10:08:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 10:08:50] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-03 10:08:50] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 10:08:50] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2025-06-03 10:08:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:08:50] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-03 10:08:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:08:50] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 10:08:50] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-03 10:08:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/13 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 9 constraints, problems are : Problem set: 0 solved, 5 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/13 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 14 constraints, problems are : Problem set: 0 solved, 5 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 158ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 159ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 212 ms. Remains : 7/7 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 172 steps (0 resets) in 4 ms. (34 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (F p1)]
Knowledge based reduction with 4 factoid took 209 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2025-06-03 10:08:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 10:08:50] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 10:08:50] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-03 10:08:50] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 10:08:50] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
[2025-06-03 10:08:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 10:08:50] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 10:08:50] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-03 10:08:50] [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 10:08:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 10:08:51] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-03 10:08:51] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 10:08:51] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 18240 reset in 56 ms.
Product exploration explored 100000 steps with 18209 reset in 61 ms.
Built C files in :
/tmp/ltsmin16840429366076326034
[2025-06-03 10:08:51] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2025-06-03 10:08:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 10:08:51] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2025-06-03 10:08:51] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 10:08:51] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2025-06-03 10:08:51] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 10:08:51] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16840429366076326034
Running compilation step : cd /tmp/ltsmin16840429366076326034;'/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 86 ms.
Running link step : cd /tmp/ltsmin16840429366076326034;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin16840429366076326034;'/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/stateBased5206429900063561359.hoa' '--buchi-type=spotba'
LTSmin run took 378 ms.
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0010P1-LTLFireability-13 finished in 3110 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((p0||G((!p1||X((G(p2) U (!p1&&G(p2))))))) U X(p3))))))'
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 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 10:08:51] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:08:51] [INFO ] Implicit Places using invariants in 40 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 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 43 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 458 ms :[(NOT p3), (NOT p3), (NOT p3), (AND p1 (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (OR (NOT p2) p1), p1, true, (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLFireability-14
Entered a terminal (fully accepting) state of product in 9 steps with 1 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P1-LTLFireability-14 finished in 526 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) U p1)&&X(X(p2))))||X(F(p3)))))'
[2025-06-03 10:08:52] [INFO ] Flatten gal took : 3 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12736739518042766705
[2025-06-03 10:08:52] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2025-06-03 10:08:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 10:08:52] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2025-06-03 10:08:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 10:08:52] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2025-06-03 10:08:52] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 10:08:52] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12736739518042766705
Running compilation step : cd /tmp/ltsmin12736739518042766705;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-03 10:08:52] [INFO ] Applying decomposition
[2025-06-03 10:08:52] [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/graph13585404431203939257.txt' '-o' '/tmp/graph13585404431203939257.bin' '-w' '/tmp/graph13585404431203939257.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13585404431203939257.bin' '-l' '-1' '-v' '-w' '/tmp/graph13585404431203939257.weights' '-q' '0' '-e' '0.001'
[2025-06-03 10:08:52] [INFO ] Decomposing Gal with order
[2025-06-03 10:08:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 10:08:52] [INFO ] Removed a total of 1 redundant transitions.
[2025-06-03 10:08:52] [INFO ] Flatten gal took : 6 ms
[2025-06-03 10:08:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-03 10:08:52] [INFO ] Time to serialize gal into /tmp/LTLFireability11482885092403012707.gal : 1 ms
[2025-06-03 10:08:52] [INFO ] Time to serialize properties into /tmp/LTLFireability5724965252101384323.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/LTLFireability11482885092403012707.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5724965252101384323.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((X(((X("(i0.u5.SpG>=1)"))U("((i1.u3.SR>=1)&&(i1.u1.Mi>=1))"))&&(X(X("((i1.u2.SG>=1)&&(i0.u4.SwG>=1))")))))||(X(F("(i2.u6.SpA>=1)"...161
Formula 0 simplified : XG(!"(i2.u6.SpA>=1)" & (XX!"((i1.u2.SG>=1)&&(i0.u4.SwG>=1))" | (!"((i1.u3.SR>=1)&&(i1.u1.Mi>=1))" & X(!"((i1.u3.SR>=1)&&(i1.u1.Mi>=1...182
Compilation finished in 113 ms.
Running link step : cd /tmp/ltsmin12736739518042766705;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin12736739518042766705;'/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)) U (LTLAPp1==true))&&X(X((LTLAPp2==true)))))||X(<>((LTLAPp3==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-06-03 10:29:31] [INFO ] Flatten gal took : 7 ms
[2025-06-03 10:29:31] [INFO ] Time to serialize gal into /tmp/LTLFireability11927559197629596738.gal : 0 ms
[2025-06-03 10:29:31] [INFO ] Time to serialize properties into /tmp/LTLFireability18128604175662511433.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/LTLFireability11927559197629596738.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18128604175662511433.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...299
Read 1 LTL properties
Checking formula 0 : !((F((X(((X("(SpG>=1)"))U("((SR>=1)&&(Mi>=1))"))&&(X(X("((SG>=1)&&(SwG>=1))")))))||(X(F("(SpA>=1)"))))))
Formula 0 simplified : XG(!"(SpA>=1)" & (XX!"((SG>=1)&&(SwG>=1))" | (!"((SR>=1)&&(Mi>=1))" & X(!"((SR>=1)&&(Mi>=1))" W !"(SpG>=1)"))))
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: LTL layer: formula: <>((X(((X((LTLAPp0==true)) U (LTLAPp1==true))&&X(X((LTLAPp2==true)))))||X(<>((LTLAPp3==true)))))
pins2lts-mc-linux64( 1/ 8), 0.001: "<>((X(((X((LTLAPp0==true)) U (LTLAPp1==true))&&X(X((LTLAPp2==true)))))||X(<>((LTLAPp3==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.017: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.058: DFS-FIFO for weak LTL, using special progress label 23
pins2lts-mc-linux64( 0/ 8), 0.058: There are 24 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.058: State length is 26, there are 41 groups
pins2lts-mc-linux64( 0/ 8), 0.058: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.058: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.058: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.058: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.197: ~104 levels ~960 states ~5624 transitions
pins2lts-mc-linux64( 5/ 8), 0.306: ~204 levels ~1920 states ~12000 transitions
pins2lts-mc-linux64( 5/ 8), 0.494: ~338 levels ~3840 states ~21064 transitions
pins2lts-mc-linux64( 5/ 8), 0.708: ~613 levels ~7680 states ~34624 transitions
pins2lts-mc-linux64( 5/ 8), 0.840: ~784 levels ~15360 states ~47096 transitions
pins2lts-mc-linux64( 5/ 8), 1.013: ~784 levels ~30720 states ~77384 transitions
pins2lts-mc-linux64( 5/ 8), 1.383: ~784 levels ~61440 states ~142704 transitions
pins2lts-mc-linux64( 5/ 8), 2.034: ~784 levels ~122880 states ~276072 transitions
pins2lts-mc-linux64( 5/ 8), 3.230: ~784 levels ~245760 states ~547552 transitions
pins2lts-mc-linux64( 5/ 8), 5.178: ~784 levels ~491520 states ~1098936 transitions
pins2lts-mc-linux64( 5/ 8), 8.157: ~784 levels ~983040 states ~2217312 transitions
pins2lts-mc-linux64( 5/ 8), 12.958: ~784 levels ~1966080 states ~4896496 transitions
pins2lts-mc-linux64( 5/ 8), 19.433: ~784 levels ~3932160 states ~10520416 transitions
pins2lts-mc-linux64( 5/ 8), 27.317: ~784 levels ~7864320 states ~22343232 transitions
pins2lts-mc-linux64( 5/ 8), 39.940: ~784 levels ~15728640 states ~47612640 transitions
pins2lts-mc-linux64( 5/ 8), 67.435: ~784 levels ~31457280 states ~102783120 transitions
pins2lts-mc-linux64( 5/ 8), 119.745: ~784 levels ~62914560 states ~211138040 transitions
pins2lts-mc-linux64( 5/ 8), 234.154: ~784 levels ~125829120 states ~455122688 transitions
pins2lts-mc-linux64( 5/ 8), 471.585: ~784 levels ~251658240 states ~967346032 transitions
pins2lts-mc-linux64( 5/ 8), 961.884: ~784 levels ~503316480 states ~2009624896 transitions
pins2lts-mc-linux64( 5/ 8), 1763.834: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1763.871:
pins2lts-mc-linux64( 0/ 8), 1763.871: mean standard work distribution: 264.6% (states) 264.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 1763.871:
pins2lts-mc-linux64( 0/ 8), 1763.871: Explored 103763952 states 414485327 transitions, fanout: 3.995
pins2lts-mc-linux64( 0/ 8), 1763.871: Total exploration time 1763.810 sec (1763.760 sec minimum, 1763.775 sec on average)
pins2lts-mc-linux64( 0/ 8), 1763.871: States per second: 58829, Transitions per second: 234994
pins2lts-mc-linux64( 0/ 8), 1763.871:
pins2lts-mc-linux64( 0/ 8), 1763.871: Progress states detected: 1
pins2lts-mc-linux64( 0/ 8), 1763.871: Redundant explorations: -0.0032
pins2lts-mc-linux64( 0/ 8), 1763.871:
pins2lts-mc-linux64( 0/ 8), 1763.871: Queue width: 8B, total height: 795, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 1763.871: Tree memory: 1047.7MB, 10.6 B/state, compr.: 10.0%
pins2lts-mc-linux64( 0/ 8), 1763.871: Tree fill ratio (roots/leafs): 77.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1763.871: Stored 18 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1763.871: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1763.871: Est. total memory use: 1047.7MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12736739518042766705;'/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)) U (LTLAPp1==true))&&X(X((LTLAPp2==true)))))||X(<>((LTLAPp3==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12736739518042766705;'/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)) U (LTLAPp1==true))&&X(X((LTLAPp2==true)))))||X(<>((LTLAPp3==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-03 10:50:10] [INFO ] Flatten gal took : 3 ms
[2025-06-03 10:50:10] [INFO ] Input system was already deterministic with 18 transitions.
[2025-06-03 10:50:10] [INFO ] Transformed 25 places.
[2025-06-03 10:50:10] [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 10:50:10] [INFO ] Time to serialize gal into /tmp/LTLFireability12619467300620383604.gal : 1 ms
[2025-06-03 10:50:10] [INFO ] Time to serialize properties into /tmp/LTLFireability14088196862145334186.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/LTLFireability12619467300620383604.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14088196862145334186.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...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((X(((X("(SpG>=1)"))U("((SR>=1)&&(Mi>=1))"))&&(X(X("((SG>=1)&&(SwG>=1))")))))||(X(F("(SpA>=1)"))))))
Formula 0 simplified : XG(!"(SpA>=1)" & (XX!"((SG>=1)&&(SwG>=1))" | (!"((SR>=1)&&(Mi>=1))" & X(!"((SR>=1)&&(Mi>=1))" W !"(SpG>=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-N0010P1"
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-N0010P1, 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-174853814000492"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0010P1.tgz
mv ClientsAndServers-PT-N0010P1 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;