Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K 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.2K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K 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 60K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 174K 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 ParamProductionCell-PT-5-LTLFireability-00
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-01
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-02
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-03
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-04
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-05
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-06
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-07
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-08
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-09
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-10
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-11
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-12
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-13
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-14
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748881045053

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-5
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 16:17:26] [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-02 16:17:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 16:17:26] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2025-06-02 16:17:26] [INFO ] Transformed 231 places.
[2025-06-02 16:17:26] [INFO ] Transformed 202 transitions.
[2025-06-02 16:17:26] [INFO ] Found NUPN structural information;
[2025-06-02 16:17:26] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 187 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ParamProductionCell-PT-5-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 63 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 228 transition count 199
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 228 transition count 199
Applied a total of 6 rules in 34 ms. Remains 228 /231 variables (removed 3) and now considering 199/202 (removed 3) transitions.
// Phase 1: matrix 199 rows 228 cols
[2025-06-02 16:17:26] [INFO ] Computed 59 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:17:27] [INFO ] Implicit Places using invariants in 371 ms returned [15, 16, 24, 31, 35, 36, 46, 47, 59, 64, 65, 73, 78, 79, 113, 116, 118, 119, 162, 165, 167, 193, 194, 198, 203, 204, 219]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 403 ms to find 27 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 201/231 places, 199/202 transitions.
Applied a total of 0 rules in 8 ms. Remains 201 /201 variables (removed 0) and now considering 199/199 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 466 ms. Remains : 201/231 places, 199/202 transitions.
Support contains 63 out of 201 places after structural reductions.
[2025-06-02 16:17:27] [INFO ] Flatten gal took : 46 ms
[2025-06-02 16:17:27] [INFO ] Flatten gal took : 17 ms
[2025-06-02 16:17:27] [INFO ] Input system was already deterministic with 199 transitions.
Reduction of identical properties reduced properties to check from 43 to 42
RANDOM walk for 30276 steps (7 resets) in 596 ms. (50 steps per ms) remains 0/42 properties
FORMULA ParamProductionCell-PT-5-LTLFireability-12 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' '!(X((X(G(p0))||F(p1))))'
Support contains 4 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 199/199 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 198 transition count 196
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 198 transition count 196
Applied a total of 6 rules in 17 ms. Remains 198 /201 variables (removed 3) and now considering 196/199 (removed 3) transitions.
// Phase 1: matrix 196 rows 198 cols
[2025-06-02 16:17:28] [INFO ] Computed 32 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:17:28] [INFO ] Implicit Places using invariants in 163 ms returned [16, 17, 35, 36, 84, 85, 87, 99, 141, 144, 179]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 165 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/201 places, 196/199 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 52 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2025-06-02 16:17:28] [INFO ] Computed 21 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:17:28] [INFO ] Implicit Places using invariants in 131 ms returned []
[2025-06-02 16:17:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:17:28] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 16:17:29] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/201 places, 194/199 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 744 ms. Remains : 185/201 places, 194/199 transitions.
Stuttering acceptance computed with spot in 254 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-00
Product exploration explored 100000 steps with 757 reset in 313 ms.
Product exploration explored 100000 steps with 755 reset in 181 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) (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 109 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 643 steps (0 resets) in 5 ms. (107 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 6 factoid took 122 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
[2025-06-02 16:17:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 16:17:30] [INFO ] [Real]Absence check using 18 positive place invariants in 14 ms returned sat
[2025-06-02 16:17:30] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 5 ms returned sat
[2025-06-02 16:17:30] [INFO ] [Real]Absence check using state equation in 332 ms returned sat
[2025-06-02 16:17: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-02 16:17:31] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2025-06-02 16:17:31] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 6 ms returned sat
[2025-06-02 16:17:31] [INFO ] [Nat]Absence check using state equation in 381 ms returned sat
[2025-06-02 16:17:31] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 16:17:31] [INFO ] [Nat]Added 68 Read/Feed constraints in 41 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:31] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:31] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:31] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:32] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:32] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:32] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:32] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:32] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:32] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:32] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:32] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:32] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:32] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:32] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 7 ms to minimize.
[2025-06-02 16:17:32] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1299 ms
[2025-06-02 16:17:32] [INFO ] Computed and/alt/rep : 189/317/189 causal constraints (skipped 0 transitions) in 10 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:33] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 3 ms to minimize.
[2025-06-02 16:17:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2025-06-02 16:17:33] [INFO ] Added : 183 causal constraints over 37 iterations in 1029 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 185 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Applied a total of 0 rules in 5 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2025-06-02 16:17:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:17:33] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-02 16:17:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:17:34] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 16:17:34] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
Running 189 sub problems to find dead transitions.
[2025-06-02 16:17:34] [INFO ] Invariant cache hit.
[2025-06-02 16:17:34] [INFO ] State equation strengthened by 68 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:35] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:35] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:35] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:35] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:35] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:35] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:35] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:35] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:35] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:35] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:36] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:36] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:36] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:36] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:36] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:36] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:36] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:36] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:36] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 19/33 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:37] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:37] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:37] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:37] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 5/184 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:40] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:40] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:40] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:40] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:40] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:40] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:40] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:40] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:40] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:41] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:41] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:41] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:41] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:41] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:41] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:41] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:41] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:42] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:42] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:42] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 9 (OVERLAPS) 1/185 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:44] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 12 (OVERLAPS) 194/379 variables, 185/250 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/379 variables, 68/318 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:49] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 8 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/379 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/379 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 16 (OVERLAPS) 0/379 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 319 constraints, problems are : Problem set: 0 solved, 189 unsolved in 24152 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 185/185 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 5/184 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 11/65 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (OVERLAPS) 1/185 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:01] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 11 (OVERLAPS) 194/379 variables, 185/252 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 68/320 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/379 variables, 189/509 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/379 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 15 (OVERLAPS) 0/379 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 509 constraints, problems are : Problem set: 0 solved, 189 unsolved in 21470 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 185/185 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45688ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 45695ms
Finished structural reductions in LTL mode , in 1 iterations and 46191 ms. Remains : 185/185 places, 194/194 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 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 65 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 465 steps (0 resets) in 8 ms. (51 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 1 factoid took 88 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
[2025-06-02 16:18:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 16:18:20] [INFO ] [Real]Absence check using 18 positive place invariants in 14 ms returned sat
[2025-06-02 16:18:20] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 5 ms returned sat
[2025-06-02 16:18:21] [INFO ] [Real]Absence check using state equation in 329 ms returned sat
[2025-06-02 16:18:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 16:18:21] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2025-06-02 16:18:21] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 3 ms returned sat
[2025-06-02 16:18:21] [INFO ] [Nat]Absence check using state equation in 385 ms returned sat
[2025-06-02 16:18:21] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 16:18:21] [INFO ] [Nat]Added 68 Read/Feed constraints in 43 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:21] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:21] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:21] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:21] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:22] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:22] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:22] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:22] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:22] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:22] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:22] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:22] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:22] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:22] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 7 ms to minimize.
[2025-06-02 16:18:22] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1225 ms
[2025-06-02 16:18:22] [INFO ] Computed and/alt/rep : 189/317/189 causal constraints (skipped 0 transitions) in 8 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:23] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 3 ms to minimize.
[2025-06-02 16:18:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2025-06-02 16:18:23] [INFO ] Added : 183 causal constraints over 37 iterations in 1011 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 755 reset in 110 ms.
Product exploration explored 100000 steps with 770 reset in 164 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 185 transition count 194
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 38 place count 185 transition count 196
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 51 place count 185 transition count 196
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 61 place count 175 transition count 185
Deduced a syphon composed of 41 places in 1 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 71 place count 175 transition count 185
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 78 places in 1 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 108 place count 175 transition count 185
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 133 place count 150 transition count 160
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 158 place count 150 transition count 160
Deduced a syphon composed of 53 places in 0 ms
Applied a total of 158 rules in 66 ms. Remains 150 /185 variables (removed 35) and now considering 160/194 (removed 34) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:18:24] [INFO ] Redundant transitions in 4 ms returned []
Running 157 sub problems to find dead transitions.
// Phase 1: matrix 160 rows 150 cols
[2025-06-02 16:18:24] [INFO ] Computed 21 invariants in 3 ms
[2025-06-02 16:18:24] [INFO ] State equation strengthened by 68 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:25] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 2 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:25] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:25] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:25] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 2 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:25] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:25] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:25] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:25] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 5 ms to minimize.
Problem TDEAD42 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:25] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:25] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:25] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:25] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:25] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:25] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:25] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 2 ms to minimize.
Problem TDEAD95 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:26] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 2 ms to minimize.
Problem TDEAD98 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:26] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
Problem TDEAD105 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:26] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 2 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD96 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 19/35 constraints. Problems are: Problem set: 39 solved, 118 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:26] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/36 constraints. Problems are: Problem set: 39 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/36 constraints. Problems are: Problem set: 39 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 3/149 variables, 3/39 constraints. Problems are: Problem set: 39 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 1/40 constraints. Problems are: Problem set: 39 solved, 118 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:27] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:27] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:27] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:28] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:28] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:28] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:28] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:28] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 4 ms to minimize.
Problem TDEAD51 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:28] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
Problem TDEAD93 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:28] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:28] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 5 ms to minimize.
Problem TDEAD109 is UNSAT
Problem TDEAD114 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:28] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:28] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:28] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 6 ms to minimize.
Problem TDEAD77 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 14/54 constraints. Problems are: Problem set: 49 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:28] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:29] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:29] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:29] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 4/58 constraints. Problems are: Problem set: 49 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 0/58 constraints. Problems are: Problem set: 49 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 1/150 variables, 1/59 constraints. Problems are: Problem set: 49 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:30] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:30] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:30] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 4 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:30] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 6 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD92 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:30] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/150 variables, 5/64 constraints. Problems are: Problem set: 54 solved, 103 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/150 variables, 0/64 constraints. Problems are: Problem set: 54 solved, 103 unsolved
At refinement iteration 13 (OVERLAPS) 160/310 variables, 150/214 constraints. Problems are: Problem set: 54 solved, 103 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/310 variables, 68/282 constraints. Problems are: Problem set: 54 solved, 103 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/310 variables, 0/282 constraints. Problems are: Problem set: 54 solved, 103 unsolved
At refinement iteration 16 (OVERLAPS) 0/310 variables, 0/282 constraints. Problems are: Problem set: 54 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 282 constraints, problems are : Problem set: 54 solved, 103 unsolved in 11132 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 150/150 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 54 solved, 103 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 10/10 constraints. Problems are: Problem set: 54 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 1/11 constraints. Problems are: Problem set: 54 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 35/46 constraints. Problems are: Problem set: 54 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/46 constraints. Problems are: Problem set: 54 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 51/144 variables, 8/54 constraints. Problems are: Problem set: 54 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 5/59 constraints. Problems are: Problem set: 54 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/59 constraints. Problems are: Problem set: 54 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 6/150 variables, 2/61 constraints. Problems are: Problem set: 54 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 3/64 constraints. Problems are: Problem set: 54 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:36] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 1/65 constraints. Problems are: Problem set: 54 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/150 variables, 0/65 constraints. Problems are: Problem set: 54 solved, 103 unsolved
At refinement iteration 11 (OVERLAPS) 160/310 variables, 150/215 constraints. Problems are: Problem set: 54 solved, 103 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 68/283 constraints. Problems are: Problem set: 54 solved, 103 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/310 variables, 103/386 constraints. Problems are: Problem set: 54 solved, 103 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/310 variables, 0/386 constraints. Problems are: Problem set: 54 solved, 103 unsolved
At refinement iteration 15 (OVERLAPS) 0/310 variables, 0/386 constraints. Problems are: Problem set: 54 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/310 variables, and 386 constraints, problems are : Problem set: 54 solved, 103 unsolved in 11369 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 150/150 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 103/157 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22521ms problems are : Problem set: 54 solved, 103 unsolved
Search for dead transitions found 54 dead transitions in 22525ms
Found 54 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 54 transitions
Dead transitions reduction (with SMT) removed 54 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 150/185 places, 106/194 transitions.
Graph (complete) has 319 edges and 150 vertex of which 97 are kept as prefixes of interest. Removing 53 places using SCC suffix rule.3 ms
Discarding 53 places :
Also discarding 0 output transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 97 transition count 106
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 97 transition count 106
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 4 rules in 9 ms. Remains 97 /150 variables (removed 53) and now considering 106/106 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 97/185 places, 106/194 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 22619 ms. Remains : 97/185 places, 106/194 transitions.
Built C files in :
/tmp/ltsmin18122193230363693075
[2025-06-02 16:18:47] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18122193230363693075
Running compilation step : cd /tmp/ltsmin18122193230363693075;'/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 411 ms.
Running link step : cd /tmp/ltsmin18122193230363693075;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin18122193230363693075;'/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/stateBased833509602178596587.hoa' '--buchi-type=spotba'
LTSmin run took 8525 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-5-LTLFireability-00 finished in 87953 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(((F(p1) U (!p2&&X(p3)))&&p0)))))'
Support contains 9 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 199/199 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 198 transition count 196
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 198 transition count 196
Applied a total of 6 rules in 8 ms. Remains 198 /201 variables (removed 3) and now considering 196/199 (removed 3) transitions.
// Phase 1: matrix 196 rows 198 cols
[2025-06-02 16:18:56] [INFO ] Computed 32 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:18:56] [INFO ] Implicit Places using invariants in 127 ms returned [17, 35, 36, 85, 87, 99, 141, 144, 171, 179]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 128 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/201 places, 196/199 transitions.
Applied a total of 0 rules in 2 ms. Remains 188 /188 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 138 ms. Remains : 188/201 places, 196/199 transitions.
Stuttering acceptance computed with spot in 410 ms :[(OR (NOT p0) (NOT p3) p2), (OR (NOT p0) (NOT p3) p2), (OR (NOT p0) (NOT p3) p2), (OR (NOT p0) (NOT p3) p2), true, (NOT p1), (OR (NOT p3) p2), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-01
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-01 finished in 579 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((X((X(p1)||p0))&&(!p2 U ((!p2&&F(!p3))||G(!p2)))))))'
Support contains 7 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 199/199 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 198 transition count 196
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 198 transition count 196
Applied a total of 6 rules in 9 ms. Remains 198 /201 variables (removed 3) and now considering 196/199 (removed 3) transitions.
[2025-06-02 16:18:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:18:56] [INFO ] Implicit Places using invariants in 122 ms returned [16, 17, 35, 84, 85, 87, 99, 144, 171, 179]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 123 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/201 places, 196/199 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 3 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2025-06-02 16:18:56] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:18:57] [INFO ] Implicit Places using invariants in 98 ms returned []
[2025-06-02 16:18:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:18:57] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 16:18:57] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/201 places, 194/199 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 670 ms. Remains : 186/201 places, 194/199 transitions.
Stuttering acceptance computed with spot in 547 ms :[(OR p2 (AND (NOT p0) (NOT p1))), (OR p2 (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND p2 p3), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p1) p2 p3), (OR (AND (NOT p0) (NOT p1) p3) (AND p2 p3)), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3), (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p1) p2 p3))]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-02
Product exploration explored 100000 steps with 33252 reset in 146 ms.
Product exploration explored 100000 steps with 33286 reset in 180 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p3) p0 p1), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND p3 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND p3 (NOT p2) (NOT p0))))), (X (X (NOT (AND p3 p2 (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p3 (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 119 ms. Reduced automaton from 11 states, 31 edges and 4 AP (stutter sensitive) to 11 states, 31 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 500 ms :[(OR p2 (AND (NOT p0) (NOT p1))), (OR p2 (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND p2 p3), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p1) p2 p3), (OR (AND (NOT p0) (NOT p1) p3) (AND p2 p3)), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3), (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p1) p2 p3))]
RANDOM walk for 40000 steps (8 resets) in 256 ms. (155 steps per ms) remains 10/18 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 151 ms. (263 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 114 ms. (347 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 129 ms. (307 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 166 ms. (239 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 133 ms. (298 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 111 ms. (357 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (8 resets) in 86 ms. (459 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 121 ms. (327 steps per ms) remains 9/9 properties
[2025-06-02 16:18:59] [INFO ] Invariant cache hit.
[2025-06-02 16:18:59] [INFO ] State equation strengthened by 68 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem apf2 is UNSAT
Problem apf4 is UNSAT
Problem apf5 is UNSAT
Problem apf6 is UNSAT
Problem apf7 is UNSAT
Problem apf8 is UNSAT
Problem apf11 is UNSAT
Problem apf13 is UNSAT
Problem apf15 is UNSAT
After SMT solving in domain Real declared 134/380 variables, and 9 constraints, problems are : Problem set: 9 solved, 0 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 9/20 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/186 constraints, ReadFeed: 0/68 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59ms problems are : Problem set: 9 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 9 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p3) p0 p1), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND p3 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND p3 (NOT p2) (NOT p0))))), (X (X (NOT (AND p3 p2 (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p3 (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (G (OR p2 (NOT p3) p1)), (G (OR p0 (NOT p2))), (G (OR p0 (NOT p2) (NOT p3))), (G (OR p0 p2 (NOT p3) p1)), (G (OR p0 (NOT p2) (NOT p3) p1)), (G (OR (NOT p2) p1)), (G (OR (NOT p2) (NOT p3) p1)), (G (OR p0 (NOT p2) p1)), (G (OR (NOT p2) (NOT p3)))]
False Knowledge obtained : [(F (NOT (OR p0 p2 (NOT p3)))), (F (NOT p0)), (F (NOT (OR p2 (NOT p3)))), (F (NOT (OR p0 p2))), (F p2), (F (NOT (OR p2 p1))), (F (NOT p1)), (F p3), (F (NOT (OR p0 p2 p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 33 factoid took 478 ms. Reduced automaton from 11 states, 31 edges and 4 AP (stutter sensitive) to 10 states, 26 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 405 ms :[(OR p2 (AND (NOT p0) (NOT p1))), (OR p2 (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false, false, false]
Stuttering acceptance computed with spot in 393 ms :[(OR p2 (AND (NOT p0) (NOT p1))), (OR p2 (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false, false, false]
Support contains 5 out of 186 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 194/194 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 186 transition count 163
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 155 transition count 163
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 62 place count 155 transition count 148
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 92 place count 140 transition count 148
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 168 place count 102 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 170 place count 101 transition count 109
Applied a total of 170 rules in 19 ms. Remains 101 /186 variables (removed 85) and now considering 109/194 (removed 85) transitions.
// Phase 1: matrix 109 rows 101 cols
[2025-06-02 16:19:00] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:19:00] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-02 16:19:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:19:01] [INFO ] State equation strengthened by 67 read => feed constraints.
[2025-06-02 16:19:01] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:19:01] [INFO ] Redundant transitions in 3 ms returned []
Running 106 sub problems to find dead transitions.
[2025-06-02 16:19:01] [INFO ] Invariant cache hit.
[2025-06-02 16:19:01] [INFO ] State equation strengthened by 67 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:01] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:01] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:01] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:01] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:01] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:01] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:01] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:01] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:01] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:01] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:01] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:01] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:02] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:02] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:02] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:02] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:02] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:02] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:02] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:02] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:02] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:02] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 3/101 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:03] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:03] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:03] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:03] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:03] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:03] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:03] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:03] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:03] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:03] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:03] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:03] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:03] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:03] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:03] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:04] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:04] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:04] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 109/210 variables, 101/163 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 67/230 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 11 (OVERLAPS) 0/210 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 230 constraints, problems are : Problem set: 0 solved, 106 unsolved in 6219 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 101/101 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 36/53 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (OVERLAPS) 3/101 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:07] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 109/210 variables, 101/164 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 67/231 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 106/337 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:09] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 13 (OVERLAPS) 0/210 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 338 constraints, problems are : Problem set: 0 solved, 106 unsolved in 6565 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 101/101 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12796ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 12796ms
Starting structural reductions in SI_LTL mode, iteration 1 : 101/186 places, 109/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13153 ms. Remains : 101/186 places, 109/194 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X p1), (X (AND p1 (NOT p2) p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X p1)), (X (X (AND p1 (NOT p2) p0)))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 142 ms. Reduced automaton from 10 states, 26 edges and 3 AP (stutter insensitive) to 10 states, 26 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 441 ms :[(OR p2 (AND (NOT p0) (NOT p1))), (OR p2 (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false, false]
RANDOM walk for 40000 steps (8 resets) in 144 ms. (275 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
[2025-06-02 16:19:14] [INFO ] Invariant cache hit.
[2025-06-02 16:19:14] [INFO ] State equation strengthened by 67 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 52/210 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 5/20 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/101 constraints, ReadFeed: 0/67 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X p1), (X (AND p1 (NOT p2) p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X p1)), (X (X (AND p1 (NOT p2) p0))), (G (OR (NOT p2) p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 p0 p1))), (F (NOT (OR p0 p1))), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR p2 p0))), (F p2), (F (NOT (AND (NOT p2) p0 p1))), (F (NOT p0)), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 21 factoid took 439 ms. Reduced automaton from 10 states, 26 edges and 3 AP (stutter insensitive) to 9 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 385 ms :[(OR p2 (AND (NOT p0) (NOT p1))), (OR p2 (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false]
Stuttering acceptance computed with spot in 379 ms :[(OR p2 (AND (NOT p0) (NOT p1))), (OR p2 (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false]
Stuttering acceptance computed with spot in 331 ms :[(OR p2 (AND (NOT p0) (NOT p1))), (OR p2 (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false]
Product exploration explored 100000 steps with 879 reset in 137 ms.
Product exploration explored 100000 steps with 957 reset in 261 ms.
Built C files in :
/tmp/ltsmin3056685206526214240
[2025-06-02 16:19:16] [INFO ] Computing symmetric may disable matrix : 109 transitions.
[2025-06-02 16:19:16] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:19:16] [INFO ] Computing symmetric may enable matrix : 109 transitions.
[2025-06-02 16:19:16] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:19:16] [INFO ] Computing Do-Not-Accords matrix : 109 transitions.
[2025-06-02 16:19:16] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:19:16] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3056685206526214240
Running compilation step : cd /tmp/ltsmin3056685206526214240;'/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 227 ms.
Running link step : cd /tmp/ltsmin3056685206526214240;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin3056685206526214240;'/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/stateBased13316976031484430434.hoa' '--buchi-type=spotba'
LTSmin run took 1118 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-5-LTLFireability-02 finished in 21283 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 199/199 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 201 transition count 181
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 183 transition count 181
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 36 place count 183 transition count 162
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 74 place count 164 transition count 162
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 76 place count 162 transition count 160
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 162 transition count 160
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 132 place count 135 transition count 133
Applied a total of 132 rules in 19 ms. Remains 135 /201 variables (removed 66) and now considering 133/199 (removed 66) transitions.
// Phase 1: matrix 133 rows 135 cols
[2025-06-02 16:19:18] [INFO ] Computed 32 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:19:18] [INFO ] Implicit Places using invariants in 101 ms returned [10, 11, 23, 24, 51, 52, 66, 97, 99, 120, 123]
[2025-06-02 16:19:18] [INFO ] Actually due to overlaps returned [52, 51, 23, 66, 97, 120, 123, 10, 11, 24]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 102 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/201 places, 133/199 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 125 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 124 transition count 132
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 124 transition count 131
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 123 transition count 131
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 46 place count 102 transition count 110
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 50 place count 100 transition count 108
Applied a total of 50 rules in 9 ms. Remains 100 /125 variables (removed 25) and now considering 108/133 (removed 25) transitions.
// Phase 1: matrix 108 rows 100 cols
[2025-06-02 16:19:18] [INFO ] Computed 22 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:19:18] [INFO ] Implicit Places using invariants in 62 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/201 places, 108/199 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 98 transition count 107
Applied a total of 2 rules in 4 ms. Remains 98 /99 variables (removed 1) and now considering 107/108 (removed 1) transitions.
// Phase 1: matrix 107 rows 98 cols
[2025-06-02 16:19:18] [INFO ] Computed 21 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:19:18] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-02 16:19:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:19:18] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-06-02 16:19:18] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 98/201 places, 107/199 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 420 ms. Remains : 98/201 places, 107/199 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-03
Product exploration explored 100000 steps with 4 reset in 118 ms.
Stack based approach found an accepted trace after 212 steps with 1 reset with depth 167 and stack size 167 in 0 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-03 finished in 680 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(!p0)) U ((p0||(G(p2)&&p1)) U X(p3)))))'
Support contains 7 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 199/199 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 198 transition count 196
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 198 transition count 196
Applied a total of 6 rules in 7 ms. Remains 198 /201 variables (removed 3) and now considering 196/199 (removed 3) transitions.
// Phase 1: matrix 196 rows 198 cols
[2025-06-02 16:19:18] [INFO ] Computed 32 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:19:18] [INFO ] Implicit Places using invariants in 117 ms returned [16, 17, 36, 84, 85, 87, 141, 144, 171, 179]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 118 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/201 places, 196/199 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 2 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2025-06-02 16:19:18] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:19:18] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-02 16:19:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:19:19] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 16:19:19] [INFO ] Implicit Places using invariants and state equation in 662 ms returned []
Implicit Place search using SMT with State Equation took 744 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/201 places, 194/199 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 871 ms. Remains : 186/201 places, 194/199 transitions.
Stuttering acceptance computed with spot in 464 ms :[(NOT p3), (AND p0 (NOT p3)), (NOT p3), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p3)), true, p0, (NOT p2), (AND p0 (NOT p2)), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p3))]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-05
Entered a terminal (fully accepting) state of product in 141 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-05 finished in 1370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 199/199 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 201 transition count 181
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 183 transition count 181
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 36 place count 183 transition count 162
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 74 place count 164 transition count 162
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 77 place count 161 transition count 159
Iterating global reduction 2 with 3 rules applied. Total rules applied 80 place count 161 transition count 159
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 134 place count 134 transition count 132
Applied a total of 134 rules in 15 ms. Remains 134 /201 variables (removed 67) and now considering 132/199 (removed 67) transitions.
// Phase 1: matrix 132 rows 134 cols
[2025-06-02 16:19:20] [INFO ] Computed 32 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:19:20] [INFO ] Implicit Places using invariants in 104 ms returned [10, 11, 23, 24, 51, 52, 54, 66, 96, 98, 119, 122]
[2025-06-02 16:19:20] [INFO ] Actually due to overlaps returned [52, 54, 51, 23, 66, 96, 119, 122, 10, 11, 24]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 105 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/201 places, 132/199 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 123 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 122 transition count 131
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 122 transition count 127
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 10 place count 118 transition count 127
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 116 transition count 125
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 116 transition count 125
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 68 place count 89 transition count 98
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 72 place count 87 transition count 96
Applied a total of 72 rules in 8 ms. Remains 87 /123 variables (removed 36) and now considering 96/132 (removed 36) transitions.
// Phase 1: matrix 96 rows 87 cols
[2025-06-02 16:19:20] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:19:20] [INFO ] Implicit Places using invariants in 60 ms returned [64]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 61 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 86/201 places, 96/199 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 85 transition count 95
Applied a total of 2 rules in 3 ms. Remains 85 /86 variables (removed 1) and now considering 95/96 (removed 1) transitions.
// Phase 1: matrix 95 rows 85 cols
[2025-06-02 16:19:20] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:19:20] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-02 16:19:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:19:20] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-06-02 16:19:20] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 85/201 places, 95/199 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 415 ms. Remains : 85/201 places, 95/199 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 142 ms.
Stack based approach found an accepted trace after 90 steps with 0 reset with depth 91 and stack size 91 in 1 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-06 finished in 603 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 X(X(G(p1)))) U X(!p2)))'
Support contains 6 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 199/199 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 199 transition count 197
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 199 transition count 197
Applied a total of 4 rules in 8 ms. Remains 199 /201 variables (removed 2) and now considering 197/199 (removed 2) transitions.
// Phase 1: matrix 197 rows 199 cols
[2025-06-02 16:19:20] [INFO ] Computed 32 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:19:20] [INFO ] Implicit Places using invariants in 115 ms returned [16, 17, 35, 36, 84, 99, 142, 145, 172, 180]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 116 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 189/201 places, 197/199 transitions.
Applied a total of 0 rules in 2 ms. Remains 189 /189 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 126 ms. Remains : 189/201 places, 197/199 transitions.
Stuttering acceptance computed with spot in 260 ms :[p2, (AND p2 (NOT p1)), p2, (AND (NOT p1) p2), (NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 133 ms.
Product exploration explored 100000 steps with 50000 reset in 142 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 18 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-5-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-5-LTLFireability-07 finished in 707 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((G(p2)||(!p3 U (p4||G(!p3)))||p1))))'
Support contains 6 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 199/199 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 201 transition count 181
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 183 transition count 181
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 36 place count 183 transition count 162
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 74 place count 164 transition count 162
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 76 place count 162 transition count 160
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 162 transition count 160
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 132 place count 135 transition count 133
Applied a total of 132 rules in 15 ms. Remains 135 /201 variables (removed 66) and now considering 133/199 (removed 66) transitions.
// Phase 1: matrix 133 rows 135 cols
[2025-06-02 16:19:21] [INFO ] Computed 32 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:19:21] [INFO ] Implicit Places using invariants in 98 ms returned [10, 11, 23, 24, 51, 52, 66, 97, 99, 120, 123]
[2025-06-02 16:19:21] [INFO ] Actually due to overlaps returned [52, 51, 23, 66, 97, 120, 123, 10, 11, 24]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 99 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/201 places, 133/199 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 125 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 124 transition count 132
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 124 transition count 131
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 123 transition count 131
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 46 place count 102 transition count 110
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 50 place count 100 transition count 108
Applied a total of 50 rules in 7 ms. Remains 100 /125 variables (removed 25) and now considering 108/133 (removed 25) transitions.
// Phase 1: matrix 108 rows 100 cols
[2025-06-02 16:19:21] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:19:21] [INFO ] Implicit Places using invariants in 62 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/201 places, 108/199 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 98 transition count 107
Applied a total of 2 rules in 3 ms. Remains 98 /99 variables (removed 1) and now considering 107/108 (removed 1) transitions.
// Phase 1: matrix 107 rows 98 cols
[2025-06-02 16:19:21] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:19:21] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-02 16:19:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:19:21] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-06-02 16:19:21] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 98/201 places, 107/199 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 485 ms. Remains : 98/201 places, 107/199 transitions.
Stuttering acceptance computed with spot in 281 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) p3 (NOT p4))), true, (NOT p0), (NOT p2), (OR (AND p1 p3 (NOT p4)) (AND p2 p3 (NOT p4))), (AND (NOT p2) (NOT p4) p3 (NOT p1)), (AND (NOT p2) p1 (NOT p4) p3)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-08
Entered a terminal (fully accepting) state of product in 11191 steps with 2 reset in 17 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-08 finished in 807 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G((X(X(X(!p0))) U ((X(X(X(!p0)))&&(p1 U (p2||G(p1))))||X(X(X(G(!p0)))))))))||(F(!p3)&&X(X((X(X(X(!p0))) U ((X(X(X(!p0)))&&(p1 U (p2||G(p1))))||X(X(X(G(!p0))))))))))))'
Support contains 6 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 199/199 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 198 transition count 196
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 198 transition count 196
Applied a total of 6 rules in 10 ms. Remains 198 /201 variables (removed 3) and now considering 196/199 (removed 3) transitions.
// Phase 1: matrix 196 rows 198 cols
[2025-06-02 16:19:22] [INFO ] Computed 32 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:19:22] [INFO ] Implicit Places using invariants in 127 ms returned [16, 17, 35, 36, 84, 85, 87, 99, 141, 144, 171, 179]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 128 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/201 places, 196/199 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 184 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 184 transition count 194
Applied a total of 4 rules in 3 ms. Remains 184 /186 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 184 cols
[2025-06-02 16:19:22] [INFO ] Computed 20 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:19:22] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-02 16:19:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:19:22] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 16:19:22] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 184/201 places, 194/199 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 585 ms. Remains : 184/201 places, 194/199 transitions.
Stuttering acceptance computed with spot in 1037 ms :[p0, p0, p0, (AND p0 p3), (AND p0 p3), p0, (AND p3 p0), p0, (AND p0 (NOT p2) (NOT p1)), (AND p3 p0), (AND p3 p0 (NOT p2) (NOT p1)), p0, (AND (NOT p2) (NOT p1) p0), p0, (AND p0 (NOT p2) (NOT p1)), (AND p0 p3), (AND p3 (NOT p2) (NOT p1) p0), (AND p3 p0), (AND p3 p0 (NOT p2) (NOT p1)), true, (AND (NOT p2) (NOT p1) p0), p3, (AND p3 (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND p3 (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-09
Product exploration explored 100000 steps with 14285 reset in 110 ms.
Product exploration explored 100000 steps with 14285 reset in 118 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p3) p2 p1 (NOT p0)), (X (NOT p3)), (X (X (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 25 states, 55 edges and 4 AP (stutter sensitive) to 13 states, 26 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 488 ms :[p0, p0, p0, p0, p0, (AND p0 (NOT p1) (NOT p2)), p0, (AND (NOT p1) (NOT p2) p0), p0, (AND p0 (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2) (NOT p0))]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 9705 steps (1 resets) in 31 ms. (303 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p3) p2 p1 (NOT p0)), (X (NOT p3)), (X (X (NOT p3)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 p2))), (F (NOT p2)), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR p0 p1 p2))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 3 factoid took 425 ms. Reduced automaton from 13 states, 26 edges and 3 AP (stutter sensitive) to 13 states, 26 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 548 ms :[p0, p0, p0, p0, p0, (AND p0 (NOT p1) (NOT p2)), p0, (AND (NOT p1) (NOT p2) p0), p0, (AND p0 (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 534 ms :[p0, p0, p0, p0, p0, (AND p0 (NOT p1) (NOT p2)), p0, (AND (NOT p1) (NOT p2) p0), p0, (AND p0 (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 4 out of 184 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 194/194 transitions.
Applied a total of 0 rules in 3 ms. Remains 184 /184 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2025-06-02 16:19:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:19:26] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-02 16:19:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:19:26] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 16:19:26] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
Running 189 sub problems to find dead transitions.
[2025-06-02 16:19:26] [INFO ] Invariant cache hit.
[2025-06-02 16:19:26] [INFO ] State equation strengthened by 68 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:27] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:27] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:27] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:27] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:27] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:27] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:27] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:28] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:28] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:28] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:28] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:28] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:28] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:28] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:28] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:28] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:28] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:28] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:28] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 19/32 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:29] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:29] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:29] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 5/183 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:31] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:31] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:31] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:31] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:31] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:31] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:31] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:31] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:32] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:32] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:32] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:32] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:32] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:32] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:32] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:32] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:32] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:33] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:33] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:34] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:35] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:36] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 11 (OVERLAPS) 1/184 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/184 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 13 (OVERLAPS) 194/378 variables, 184/248 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/378 variables, 68/316 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/378 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 16 (OVERLAPS) 0/378 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 316 constraints, problems are : Problem set: 0 solved, 189 unsolved in 21932 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 184/184 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (OVERLAPS) 5/183 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (OVERLAPS) 1/184 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 9 (OVERLAPS) 194/378 variables, 184/248 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 68/316 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 189/505 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 13 (OVERLAPS) 0/378 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/378 variables, and 505 constraints, problems are : Problem set: 0 solved, 189 unsolved in 20510 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 184/184 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42463ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 42463ms
Finished structural reductions in LTL mode , in 1 iterations and 42899 ms. Remains : 184/184 places, 194/194 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 p1 p2 (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 118 ms. Reduced automaton from 13 states, 26 edges and 3 AP (stutter sensitive) to 13 states, 26 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 491 ms :[p0, p0, p0, p0, p0, (AND p0 (NOT p1) (NOT p2)), p0, (AND (NOT p1) (NOT p2) p0), p0, (AND p0 (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2) (NOT p0))]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 23603 steps (4 resets) in 101 ms. (231 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND p1 p2 (NOT p0))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 p2))), (F (NOT p2)), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR p0 p1 p2))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 1 factoid took 358 ms. Reduced automaton from 13 states, 26 edges and 3 AP (stutter sensitive) to 13 states, 26 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 543 ms :[p0, p0, p0, p0, p0, (AND p0 (NOT p1) (NOT p2)), p0, (AND (NOT p1) (NOT p2) p0), p0, (AND p0 (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 522 ms :[p0, p0, p0, p0, p0, (AND p0 (NOT p1) (NOT p2)), p0, (AND (NOT p1) (NOT p2) p0), p0, (AND p0 (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 513 ms :[p0, p0, p0, p0, p0, (AND p0 (NOT p1) (NOT p2)), p0, (AND (NOT p1) (NOT p2) p0), p0, (AND p0 (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 14285 reset in 101 ms.
Product exploration explored 100000 steps with 14285 reset in 110 ms.
Applying partial POR strategy [false, false, false, false, false, false, false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 469 ms :[p0, p0, p0, p0, p0, (AND p0 (NOT p1) (NOT p2)), p0, (AND (NOT p1) (NOT p2) p0), p0, (AND p0 (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 194/194 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 184 transition count 194
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 35 place count 184 transition count 196
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 49 place count 184 transition count 196
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 58 place count 175 transition count 186
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 67 place count 175 transition count 186
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 79 places in 0 ms
Iterating global reduction 1 with 39 rules applied. Total rules applied 106 place count 175 transition count 186
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 131 place count 150 transition count 161
Deduced a syphon composed of 54 places in 0 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 156 place count 150 transition count 161
Deduced a syphon composed of 54 places in 0 ms
Applied a total of 156 rules in 17 ms. Remains 150 /184 variables (removed 34) and now considering 161/194 (removed 33) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:20:12] [INFO ] Redundant transitions in 3 ms returned []
Running 158 sub problems to find dead transitions.
// Phase 1: matrix 161 rows 150 cols
[2025-06-02 16:20:12] [INFO ] Computed 20 invariants in 0 ms
[2025-06-02 16:20:12] [INFO ] State equation strengthened by 68 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 158 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:13] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:13] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:13] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:13] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:13] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 5 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:13] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:13] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 5 ms to minimize.
Problem TDEAD43 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:13] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:13] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:13] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:13] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:13] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:13] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 4 ms to minimize.
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:13] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 3 ms to minimize.
Problem TDEAD68 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:14] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:14] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD96 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:14] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 2 ms to minimize.
Problem TDEAD98 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:14] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:14] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 3 ms to minimize.
Problem TDEAD104 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD123 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:14] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD140 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 20/35 constraints. Problems are: Problem set: 41 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:14] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:14] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 2/37 constraints. Problems are: Problem set: 41 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/37 constraints. Problems are: Problem set: 41 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 3/149 variables, 3/40 constraints. Problems are: Problem set: 41 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 1/41 constraints. Problems are: Problem set: 41 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:15] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:15] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:15] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:16] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:16] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:16] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 3 ms to minimize.
Problem TDEAD52 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:16] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:16] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:16] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:16] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 2 ms to minimize.
Problem TDEAD85 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:16] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:16] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 6 ms to minimize.
Problem TDEAD107 is UNSAT
Problem TDEAD113 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:16] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:16] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:16] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:16] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 7 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD55 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 16/57 constraints. Problems are: Problem set: 55 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:17] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:17] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:17] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 3/60 constraints. Problems are: Problem set: 55 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:17] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:18] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 2/62 constraints. Problems are: Problem set: 55 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 0/62 constraints. Problems are: Problem set: 55 solved, 103 unsolved
At refinement iteration 10 (OVERLAPS) 1/150 variables, 1/63 constraints. Problems are: Problem set: 55 solved, 103 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/150 variables, 0/63 constraints. Problems are: Problem set: 55 solved, 103 unsolved
At refinement iteration 12 (OVERLAPS) 161/311 variables, 150/213 constraints. Problems are: Problem set: 55 solved, 103 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/311 variables, 68/281 constraints. Problems are: Problem set: 55 solved, 103 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/311 variables, 0/281 constraints. Problems are: Problem set: 55 solved, 103 unsolved
At refinement iteration 15 (OVERLAPS) 0/311 variables, 0/281 constraints. Problems are: Problem set: 55 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 281 constraints, problems are : Problem set: 55 solved, 103 unsolved in 11850 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 150/150 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 55 solved, 103 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 10/10 constraints. Problems are: Problem set: 55 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 36/46 constraints. Problems are: Problem set: 55 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/46 constraints. Problems are: Problem set: 55 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 57/149 variables, 8/54 constraints. Problems are: Problem set: 55 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 1/55 constraints. Problems are: Problem set: 55 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 7/62 constraints. Problems are: Problem set: 55 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/62 constraints. Problems are: Problem set: 55 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 1/150 variables, 1/63 constraints. Problems are: Problem set: 55 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/63 constraints. Problems are: Problem set: 55 solved, 103 unsolved
At refinement iteration 9 (OVERLAPS) 161/311 variables, 150/213 constraints. Problems are: Problem set: 55 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 68/281 constraints. Problems are: Problem set: 55 solved, 103 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/311 variables, 103/384 constraints. Problems are: Problem set: 55 solved, 103 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/311 variables, 0/384 constraints. Problems are: Problem set: 55 solved, 103 unsolved
At refinement iteration 13 (OVERLAPS) 0/311 variables, 0/384 constraints. Problems are: Problem set: 55 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 384 constraints, problems are : Problem set: 55 solved, 103 unsolved in 11004 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 150/150 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 103/158 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22868ms problems are : Problem set: 55 solved, 103 unsolved
Search for dead transitions found 55 dead transitions in 22868ms
Found 55 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 55 transitions
Dead transitions reduction (with SMT) removed 55 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 150/184 places, 106/194 transitions.
Graph (complete) has 307 edges and 150 vertex of which 96 are kept as prefixes of interest. Removing 54 places using SCC suffix rule.1 ms
Discarding 54 places :
Also discarding 0 output transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 96 transition count 106
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 96 transition count 106
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 4 rules in 10 ms. Remains 96 /150 variables (removed 54) and now considering 106/106 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 96/184 places, 106/194 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 22904 ms. Remains : 96/184 places, 106/194 transitions.
Built C files in :
/tmp/ltsmin3629072397594042358
[2025-06-02 16:20:35] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3629072397594042358
Running compilation step : cd /tmp/ltsmin3629072397594042358;'/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 290 ms.
Running link step : cd /tmp/ltsmin3629072397594042358;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3629072397594042358;'/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/stateBased10331856654155240993.hoa' '--buchi-type=spotba'
LTSmin run took 203 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-5-LTLFireability-09 finished in 73980 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((G(p1)||p0)))'
Support contains 2 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 199/199 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 201 transition count 181
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 183 transition count 181
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 36 place count 183 transition count 163
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 72 place count 165 transition count 163
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 75 place count 162 transition count 160
Iterating global reduction 2 with 3 rules applied. Total rules applied 78 place count 162 transition count 160
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 124 place count 139 transition count 137
Applied a total of 124 rules in 14 ms. Remains 139 /201 variables (removed 62) and now considering 137/199 (removed 62) transitions.
// Phase 1: matrix 137 rows 139 cols
[2025-06-02 16:20:36] [INFO ] Computed 32 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:36] [INFO ] Implicit Places using invariants in 116 ms returned [10, 11, 23, 24, 54, 55, 57, 69, 101, 103, 124, 127]
[2025-06-02 16:20:36] [INFO ] Actually due to overlaps returned [55, 57, 54, 23, 69, 101, 124, 127, 10, 11, 24]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 117 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/201 places, 137/199 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 128 transition count 135
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 126 transition count 135
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 126 transition count 132
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 123 transition count 132
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 121 transition count 130
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 121 transition count 130
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 70 place count 93 transition count 102
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 74 place count 91 transition count 100
Applied a total of 74 rules in 6 ms. Remains 91 /128 variables (removed 37) and now considering 100/137 (removed 37) transitions.
// Phase 1: matrix 100 rows 91 cols
[2025-06-02 16:20:36] [INFO ] Computed 21 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:36] [INFO ] Implicit Places using invariants in 52 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 90/201 places, 100/199 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 89 transition count 99
Applied a total of 2 rules in 2 ms. Remains 89 /90 variables (removed 1) and now considering 99/100 (removed 1) transitions.
// Phase 1: matrix 99 rows 89 cols
[2025-06-02 16:20:36] [INFO ] Computed 20 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:36] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-02 16:20:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:36] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-06-02 16:20:36] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 89/201 places, 99/199 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 390 ms. Remains : 89/201 places, 99/199 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-10
Entered a terminal (fully accepting) state of product in 41 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-10 finished in 486 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(G((p0&&(p1||G(p2))))))'
Support contains 3 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 199/199 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 198 transition count 196
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 198 transition count 196
Applied a total of 6 rules in 8 ms. Remains 198 /201 variables (removed 3) and now considering 196/199 (removed 3) transitions.
// Phase 1: matrix 196 rows 198 cols
[2025-06-02 16:20:36] [INFO ] Computed 32 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:36] [INFO ] Implicit Places using invariants in 125 ms returned [16, 17, 35, 36, 84, 85, 87, 99, 144, 171, 179]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 126 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/201 places, 196/199 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 4 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2025-06-02 16:20:36] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:36] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-02 16:20:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:37] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 16:20:37] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/201 places, 194/199 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 792 ms. Remains : 185/201 places, 194/199 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-11 finished in 935 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G(p1)||G(p2)))&&p0)))'
Support contains 6 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 199/199 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 198 transition count 196
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 198 transition count 196
Applied a total of 6 rules in 5 ms. Remains 198 /201 variables (removed 3) and now considering 196/199 (removed 3) transitions.
// Phase 1: matrix 196 rows 198 cols
[2025-06-02 16:20:37] [INFO ] Computed 32 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:37] [INFO ] Implicit Places using invariants in 115 ms returned [16, 17, 35, 36, 84, 87, 99, 141, 171, 179]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 116 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/201 places, 196/199 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 3 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2025-06-02 16:20:37] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:37] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-06-02 16:20:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:37] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 16:20:38] [INFO ] Implicit Places using invariants and state equation in 597 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/201 places, 194/199 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 823 ms. Remains : 186/201 places, 194/199 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-13 finished in 969 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 5 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 199/199 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 198 transition count 196
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 198 transition count 196
Applied a total of 6 rules in 5 ms. Remains 198 /201 variables (removed 3) and now considering 196/199 (removed 3) transitions.
// Phase 1: matrix 196 rows 198 cols
[2025-06-02 16:20:38] [INFO ] Computed 32 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:38] [INFO ] Implicit Places using invariants in 123 ms returned [16, 35, 36, 85, 87, 99, 141, 144, 171, 179]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 124 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/201 places, 196/199 transitions.
Applied a total of 0 rules in 2 ms. Remains 188 /188 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 131 ms. Remains : 188/201 places, 196/199 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-14
Entered a terminal (fully accepting) state of product in 17701 steps with 0 reset in 23 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-14 finished in 319 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 199/199 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 201 transition count 181
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 183 transition count 181
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 36 place count 183 transition count 162
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 74 place count 164 transition count 162
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 77 place count 161 transition count 159
Iterating global reduction 2 with 3 rules applied. Total rules applied 80 place count 161 transition count 159
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 134 place count 134 transition count 132
Applied a total of 134 rules in 15 ms. Remains 134 /201 variables (removed 67) and now considering 132/199 (removed 67) transitions.
// Phase 1: matrix 132 rows 134 cols
[2025-06-02 16:20:38] [INFO ] Computed 32 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:39] [INFO ] Implicit Places using invariants in 97 ms returned [10, 11, 23, 24, 51, 54, 66, 96, 98, 119, 122]
[2025-06-02 16:20:39] [INFO ] Actually due to overlaps returned [54, 51, 23, 66, 96, 119, 122, 10, 11, 24]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 98 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/201 places, 132/199 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 124 transition count 131
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 123 transition count 131
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 121 transition count 129
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 121 transition count 129
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 38 place count 105 transition count 113
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 103 transition count 111
Applied a total of 42 rules in 6 ms. Remains 103 /124 variables (removed 21) and now considering 111/132 (removed 21) transitions.
// Phase 1: matrix 111 rows 103 cols
[2025-06-02 16:20:39] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:39] [INFO ] Implicit Places using invariants in 85 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 86 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 102/201 places, 111/199 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 101 transition count 110
Applied a total of 2 rules in 2 ms. Remains 101 /102 variables (removed 1) and now considering 110/111 (removed 1) transitions.
// Phase 1: matrix 110 rows 101 cols
[2025-06-02 16:20:39] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:39] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-02 16:20:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:39] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-06-02 16:20:39] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 101/201 places, 110/199 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 494 ms. Remains : 101/201 places, 110/199 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 108 ms.
Stack based approach found an accepted trace after 102 steps with 0 reset with depth 103 and stack size 103 in 0 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-15 finished in 655 ms.
All properties solved by simple procedures.
Total runtime 193384 ms.

BK_STOP 1748881239639

--------------------
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="ParamProductionCell-PT-5"
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 ParamProductionCell-PT-5, 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 r142-tall-174876812500396"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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