Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 113K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.3M 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 Anderson-PT-10-LTLFireability-00
FORMULA_NAME Anderson-PT-10-LTLFireability-01
FORMULA_NAME Anderson-PT-10-LTLFireability-02
FORMULA_NAME Anderson-PT-10-LTLFireability-03
FORMULA_NAME Anderson-PT-10-LTLFireability-04
FORMULA_NAME Anderson-PT-10-LTLFireability-05
FORMULA_NAME Anderson-PT-10-LTLFireability-06
FORMULA_NAME Anderson-PT-10-LTLFireability-07
FORMULA_NAME Anderson-PT-10-LTLFireability-08
FORMULA_NAME Anderson-PT-10-LTLFireability-09
FORMULA_NAME Anderson-PT-10-LTLFireability-10
FORMULA_NAME Anderson-PT-10-LTLFireability-11
FORMULA_NAME Anderson-PT-10-LTLFireability-12
FORMULA_NAME Anderson-PT-10-LTLFireability-13
FORMULA_NAME Anderson-PT-10-LTLFireability-14
FORMULA_NAME Anderson-PT-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748548822881

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-29 20:00:24] [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-05-29 20:00:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 20:00:24] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2025-05-29 20:00:24] [INFO ] Transformed 621 places.
[2025-05-29 20:00:24] [INFO ] Transformed 2480 transitions.
[2025-05-29 20:00:24] [INFO ] Found NUPN structural information;
[2025-05-29 20:00:24] [INFO ] Parsed PT model containing 621 places and 2480 transitions and 9560 arcs in 245 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Anderson-PT-10-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 2480/2480 transitions.
Discarding 157 places :
Symmetric choice reduction at 0 with 157 rule applications. Total rules 157 place count 464 transition count 1063
Iterating global reduction 0 with 157 rules applied. Total rules applied 314 place count 464 transition count 1063
Applied a total of 314 rules in 96 ms. Remains 464 /621 variables (removed 157) and now considering 1063/2480 (removed 1417) transitions.
// Phase 1: matrix 1063 rows 464 cols
[2025-05-29 20:00:24] [INFO ] Computed 23 invariants in 47 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:00:25] [INFO ] Implicit Places using invariants in 559 ms returned []
[2025-05-29 20:00:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:00:25] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-05-29 20:00:28] [INFO ] Implicit Places using invariants and state equation in 2916 ms returned []
Implicit Place search using SMT with State Equation took 3504 ms to find 0 implicit places.
Running 1053 sub problems to find dead transitions.
[2025-05-29 20:00:28] [INFO ] Invariant cache hit.
[2025-05-29 20:00:28] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1053 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 1053 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:38] [INFO ] Deduced a trap composed of 93 places in 277 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:38] [INFO ] Deduced a trap composed of 70 places in 256 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:38] [INFO ] Deduced a trap composed of 125 places in 237 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:39] [INFO ] Deduced a trap composed of 60 places in 259 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:39] [INFO ] Deduced a trap composed of 71 places in 239 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:39] [INFO ] Deduced a trap composed of 82 places in 242 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:39] [INFO ] Deduced a trap composed of 104 places in 266 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:40] [INFO ] Deduced a trap composed of 59 places in 241 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:40] [INFO ] Deduced a trap composed of 59 places in 243 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:40] [INFO ] Deduced a trap composed of 70 places in 249 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:41] [INFO ] Deduced a trap composed of 58 places in 268 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:41] [INFO ] Deduced a trap composed of 59 places in 263 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:41] [INFO ] Deduced a trap composed of 59 places in 280 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:42] [INFO ] Deduced a trap composed of 58 places in 270 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:42] [INFO ] Deduced a trap composed of 59 places in 261 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:42] [INFO ] Deduced a trap composed of 58 places in 270 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:43] [INFO ] Deduced a trap composed of 60 places in 251 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:43] [INFO ] Deduced a trap composed of 115 places in 261 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:43] [INFO ] Deduced a trap composed of 59 places in 267 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:44] [INFO ] Deduced a trap composed of 59 places in 299 ms of which 53 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 1053 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:45] [INFO ] Deduced a trap composed of 71 places in 236 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:45] [INFO ] Deduced a trap composed of 49 places in 271 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:46] [INFO ] Deduced a trap composed of 59 places in 284 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:46] [INFO ] Deduced a trap composed of 137 places in 267 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:46] [INFO ] Deduced a trap composed of 126 places in 255 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:46] [INFO ] Deduced a trap composed of 59 places in 253 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:47] [INFO ] Deduced a trap composed of 59 places in 268 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:47] [INFO ] Deduced a trap composed of 59 places in 270 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:48] [INFO ] Deduced a trap composed of 82 places in 248 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:48] [INFO ] Deduced a trap composed of 82 places in 233 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:48] [INFO ] Deduced a trap composed of 60 places in 249 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:49] [INFO ] Deduced a trap composed of 59 places in 284 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:49] [INFO ] Deduced a trap composed of 58 places in 281 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:49] [INFO ] Deduced a trap composed of 104 places in 270 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:50] [INFO ] Deduced a trap composed of 92 places in 247 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:50] [INFO ] Deduced a trap composed of 82 places in 246 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:50] [INFO ] Deduced a trap composed of 59 places in 221 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:51] [INFO ] Deduced a trap composed of 50 places in 234 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:51] [INFO ] Deduced a trap composed of 85 places in 267 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:52] [INFO ] Deduced a trap composed of 70 places in 254 ms of which 51 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/464 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1053 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/1527 variables, and 63 constraints, problems are : Problem set: 0 solved, 1053 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/464 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 1053/1053 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1053 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1053 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 1053 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 40/63 constraints. Problems are: Problem set: 0 solved, 1053 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:05] [INFO ] Deduced a trap composed of 70 places in 244 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:05] [INFO ] Deduced a trap composed of 71 places in 250 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:07] [INFO ] Deduced a trap composed of 58 places in 250 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:08] [INFO ] Deduced a trap composed of 58 places in 247 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:08] [INFO ] Deduced a trap composed of 58 places in 276 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:09] [INFO ] Deduced a trap composed of 58 places in 273 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:09] [INFO ] Deduced a trap composed of 58 places in 254 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:09] [INFO ] Deduced a trap composed of 60 places in 238 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:09] [INFO ] Deduced a trap composed of 81 places in 211 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:10] [INFO ] Deduced a trap composed of 81 places in 233 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:10] [INFO ] Deduced a trap composed of 92 places in 242 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:11] [INFO ] Deduced a trap composed of 70 places in 239 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:12] [INFO ] Deduced a trap composed of 49 places in 236 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:13] [INFO ] Deduced a trap composed of 49 places in 238 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:13] [INFO ] Deduced a trap composed of 72 places in 241 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:14] [INFO ] Deduced a trap composed of 58 places in 239 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:19] [INFO ] Deduced a trap composed of 58 places in 250 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:20] [INFO ] Deduced a trap composed of 114 places in 249 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:24] [INFO ] Deduced a trap composed of 58 places in 246 ms of which 45 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/1527 variables, and 82 constraints, problems are : Problem set: 0 solved, 1053 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/464 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/1053 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60896ms problems are : Problem set: 0 solved, 1053 unsolved
Search for dead transitions found 0 dead transitions in 60914ms
Starting structural reductions in LTL mode, iteration 1 : 464/621 places, 1063/2480 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64537 ms. Remains : 464/621 places, 1063/2480 transitions.
Support contains 43 out of 464 places after structural reductions.
[2025-05-29 20:01:29] [INFO ] Flatten gal took : 95 ms
[2025-05-29 20:01:29] [INFO ] Flatten gal took : 67 ms
[2025-05-29 20:01:29] [INFO ] Input system was already deterministic with 1063 transitions.
RANDOM walk for 40000 steps (8 resets) in 2267 ms. (17 steps per ms) remains 20/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 17/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 15/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 12/12 properties
[2025-05-29 20:01:30] [INFO ] Invariant cache hit.
[2025-05-29 20:01:30] [INFO ] State equation strengthened by 90 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/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 249/266 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 50/316 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 133/449 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/449 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/449 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 15/464 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:31] [INFO ] Deduced a trap composed of 82 places in 258 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:31] [INFO ] Deduced a trap composed of 70 places in 242 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:31] [INFO ] Deduced a trap composed of 59 places in 218 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:31] [INFO ] Deduced a trap composed of 60 places in 218 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:32] [INFO ] Deduced a trap composed of 58 places in 272 ms of which 47 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:32] [INFO ] Deduced a trap composed of 58 places in 269 ms of which 47 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/464 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:32] [INFO ] Deduced a trap composed of 71 places in 251 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:33] [INFO ] Deduced a trap composed of 93 places in 271 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:33] [INFO ] Deduced a trap composed of 115 places in 258 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:33] [INFO ] Deduced a trap composed of 59 places in 258 ms of which 40 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/464 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:34] [INFO ] Deduced a trap composed of 104 places in 244 ms of which 55 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/464 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/464 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 1063/1527 variables, 464/498 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1527 variables, 90/588 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:35] [INFO ] Deduced a trap composed of 58 places in 246 ms of which 33 ms to minimize.
SMT process timed out in 5097ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 17 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 1063/1063 transitions.
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 89 Pre rules applied. Total rules applied 0 place count 464 transition count 974
Deduced a syphon composed of 89 places in 2 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 0 with 178 rules applied. Total rules applied 178 place count 375 transition count 974
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 190 place count 363 transition count 782
Iterating global reduction 0 with 12 rules applied. Total rules applied 202 place count 363 transition count 782
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 204 place count 362 transition count 781
Applied a total of 204 rules in 95 ms. Remains 362 /464 variables (removed 102) and now considering 781/1063 (removed 282) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 362/464 places, 781/1063 transitions.
RANDOM walk for 40000 steps (8 resets) in 460 ms. (86 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 112 ms. (354 steps per ms) remains 6/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 130 ms. (305 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 130 ms. (305 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 132 ms. (300 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 179 ms. (222 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 135 ms. (294 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 110 ms. (360 steps per ms) remains 6/6 properties
// Phase 1: matrix 781 rows 362 cols
[2025-05-29 20:01:35] [INFO ] Computed 23 invariants in 14 ms
[2025-05-29 20:01:35] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 326/336 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 15/351 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 11/362 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:36] [INFO ] Deduced a trap composed of 46 places in 220 ms of which 34 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:36] [INFO ] Deduced a trap composed of 48 places in 207 ms of which 38 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 781/1143 variables, 362/387 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1143 variables, 90/477 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1143 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/1143 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1143/1143 variables, and 477 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1588 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 362/362 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 326/336 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 15/351 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 11/362 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 781/1143 variables, 362/387 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1143 variables, 90/477 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1143 variables, 6/483 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1143 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/1143 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1143/1143 variables, and 483 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2730 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 362/362 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4344ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 4 properties in 1277 ms.
Support contains 4 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 781/781 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 354 transition count 629
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 354 transition count 629
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 353 transition count 628
Applied a total of 18 rules in 51 ms. Remains 353 /362 variables (removed 9) and now considering 628/781 (removed 153) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 353/362 places, 628/781 transitions.
RANDOM walk for 40000 steps (8 resets) in 138 ms. (287 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 148 ms. (268 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 798914 steps, run timeout after 3001 ms. (steps per millisecond=266 ) properties seen :1 out of 2
Probabilistic random walk after 798914 steps, saw 588279 distinct states, run finished after 3006 ms. (steps per millisecond=265 ) properties seen :1
// Phase 1: matrix 628 rows 353 cols
[2025-05-29 20:01:44] [INFO ] Computed 23 invariants in 18 ms
[2025-05-29 20:01:44] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 321/323 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/342 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/353 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 628/981 variables, 353/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/981 variables, 90/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/981 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/981 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 981/981 variables, and 466 constraints, problems are : Problem set: 0 solved, 1 unsolved in 358 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 353/353 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 321/323 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/342 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/353 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 628/981 variables, 353/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/981 variables, 90/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/981 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/981 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/981 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 981/981 variables, and 467 constraints, problems are : Problem set: 0 solved, 1 unsolved in 527 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 353/353 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 916ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 2 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 628/628 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 609
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 609
Applied a total of 2 rules in 24 ms. Remains 352 /353 variables (removed 1) and now considering 609/628 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 352/353 places, 609/628 transitions.
RANDOM walk for 40000 steps (8 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1079762 steps, run timeout after 3001 ms. (steps per millisecond=359 ) properties seen :0 out of 1
Probabilistic random walk after 1079762 steps, saw 791753 distinct states, run finished after 3001 ms. (steps per millisecond=359 ) properties seen :0
// Phase 1: matrix 609 rows 352 cols
[2025-05-29 20:01:48] [INFO ] Computed 23 invariants in 12 ms
[2025-05-29 20:01:48] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 320/322 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/331 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/352 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:49] [INFO ] Deduced a trap composed of 41 places in 181 ms of which 34 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 609/961 variables, 352/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/961 variables, 90/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/961 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/961 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 961/961 variables, and 466 constraints, problems are : Problem set: 0 solved, 1 unsolved in 607 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 352/352 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 320/322 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/331 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/352 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 609/961 variables, 352/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/961 variables, 90/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/961 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/961 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/961 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 961/961 variables, and 467 constraints, problems are : Problem set: 0 solved, 1 unsolved in 536 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 352/352 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1164ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 609/609 transitions.
Applied a total of 0 rules in 15 ms. Remains 352 /352 variables (removed 0) and now considering 609/609 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 352/352 places, 609/609 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 609/609 transitions.
Applied a total of 0 rules in 15 ms. Remains 352 /352 variables (removed 0) and now considering 609/609 (removed 0) transitions.
[2025-05-29 20:01:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:01:50] [INFO ] Implicit Places using invariants in 442 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 444 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 351/352 places, 609/609 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 351 transition count 510
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 252 transition count 510
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 199 place count 252 transition count 509
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 200 place count 251 transition count 509
Applied a total of 200 rules in 28 ms. Remains 251 /351 variables (removed 100) and now considering 509/609 (removed 100) transitions.
// Phase 1: matrix 509 rows 251 cols
[2025-05-29 20:01:50] [INFO ] Computed 22 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:01:50] [INFO ] Implicit Places using invariants in 213 ms returned []
[2025-05-29 20:01:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:01:50] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-05-29 20:01:51] [INFO ] Implicit Places using invariants and state equation in 1146 ms returned []
Implicit Place search using SMT with State Equation took 1361 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 251/352 places, 509/609 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1848 ms. Remains : 251/352 places, 509/609 transitions.
RANDOM walk for 40000 steps (8 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
BEST_FIRST walk for 39559 steps (8 resets) in 31 ms. (1236 steps per ms) remains 0/1 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X((!p1 U (G(!p1)||(!p1&&G(p2))))))||p0))))'
Support contains 4 out of 464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 1063/1063 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 443 transition count 718
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 443 transition count 718
Applied a total of 42 rules in 30 ms. Remains 443 /464 variables (removed 21) and now considering 718/1063 (removed 345) transitions.
// Phase 1: matrix 718 rows 443 cols
[2025-05-29 20:01:52] [INFO ] Computed 23 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:01:52] [INFO ] Implicit Places using invariants in 446 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 447 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/464 places, 718/1063 transitions.
Applied a total of 0 rules in 8 ms. Remains 442 /442 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 485 ms. Remains : 442/464 places, 718/1063 transitions.
Stuttering acceptance computed with spot in 403 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, true, (AND p1 (NOT p2)), (NOT p2)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 241 ms.
Product exploration explored 100000 steps with 0 reset in 239 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 p0 (NOT p2) (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, true, (AND p1 (NOT p2)), (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 330 ms. (120 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
// Phase 1: matrix 718 rows 442 cols
[2025-05-29 20:01:54] [INFO ] Computed 22 invariants in 7 ms
[2025-05-29 20:01:54] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 412/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/434 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Real declared 442/1160 variables, and 22 constraints, problems are : Problem set: 1 solved, 0 unsolved in 108 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/442 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 124ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (X p0)), (G (OR (NOT p1) (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2))), (F p1), (F (NOT (OR p1 (NOT p2)))), (F (NOT p0)), (F p2), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 4 factoid took 275 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[true, p1, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 172 ms :[true, p1, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 4 out of 442 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 442/442 places, 718/718 transitions.
Applied a total of 0 rules in 11 ms. Remains 442 /442 variables (removed 0) and now considering 718/718 (removed 0) transitions.
[2025-05-29 20:01:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:01:55] [INFO ] Implicit Places using invariants in 333 ms returned []
[2025-05-29 20:01:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:01:55] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-05-29 20:01:57] [INFO ] Implicit Places using invariants and state equation in 2135 ms returned []
Implicit Place search using SMT with State Equation took 2470 ms to find 0 implicit places.
Running 708 sub problems to find dead transitions.
[2025-05-29 20:01:57] [INFO ] Invariant cache hit.
[2025-05-29 20:01:57] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:05] [INFO ] Deduced a trap composed of 59 places in 209 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:06] [INFO ] Deduced a trap composed of 59 places in 208 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:08] [INFO ] Deduced a trap composed of 50 places in 204 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:09] [INFO ] Deduced a trap composed of 59 places in 206 ms of which 44 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:12] [INFO ] Deduced a trap composed of 59 places in 203 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:12] [INFO ] Deduced a trap composed of 70 places in 196 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:16] [INFO ] Deduced a trap composed of 59 places in 181 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:17] [INFO ] Deduced a trap composed of 70 places in 227 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:18] [INFO ] Deduced a trap composed of 59 places in 209 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:18] [INFO ] Deduced a trap composed of 59 places in 204 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:19] [INFO ] Deduced a trap composed of 59 places in 191 ms of which 41 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 7/33 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:26] [INFO ] Deduced a trap composed of 70 places in 193 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:27] [INFO ] Deduced a trap composed of 59 places in 206 ms of which 44 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 442/1160 variables, and 35 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/442 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 708 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 708 unsolved
SMT process timed out in 60190ms, After SMT, problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 60193ms
Finished structural reductions in LTL mode , in 1 iterations and 62679 ms. Remains : 442/442 places, 718/718 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[true, p1, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 119 ms. (333 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[true, p1, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 170 ms :[true, p1, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 159 ms :[true, p1, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 136 ms.
Product exploration explored 100000 steps with 0 reset in 201 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 156 ms :[true, p1, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 4 out of 442 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 442/442 places, 718/718 transitions.
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 442 transition count 718
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 90 Pre rules applied. Total rules applied 98 place count 442 transition count 718
Deduced a syphon composed of 188 places in 0 ms
Iterating global reduction 1 with 90 rules applied. Total rules applied 188 place count 442 transition count 718
Deduced a syphon composed of 188 places in 0 ms
Applied a total of 188 rules in 51 ms. Remains 442 /442 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 20:02:59] [INFO ] Redundant transitions in 34 ms returned []
Running 708 sub problems to find dead transitions.
// Phase 1: matrix 718 rows 442 cols
[2025-05-29 20:02:59] [INFO ] Computed 22 invariants in 5 ms
[2025-05-29 20:02:59] [INFO ] State equation strengthened by 170 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:04] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:04] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:05] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:05] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:05] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:05] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:05] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:05] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:05] [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-05-29 20:03:05] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:05] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:06] [INFO ] Deduced a trap composed of 41 places in 182 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:06] [INFO ] Deduced a trap composed of 39 places in 193 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:07] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 29 ms to minimize.
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:09] [INFO ] Deduced a trap composed of 40 places in 180 ms of which 29 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 15/37 constraints. Problems are: Problem set: 188 solved, 520 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:11] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:12] [INFO ] Deduced a trap composed of 40 places in 172 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:12] [INFO ] Deduced a trap composed of 39 places in 196 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:14] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:14] [INFO ] Deduced a trap composed of 39 places in 181 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:14] [INFO ] Deduced a trap composed of 39 places in 184 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:15] [INFO ] Deduced a trap composed of 40 places in 183 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:15] [INFO ] Deduced a trap composed of 41 places in 183 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:15] [INFO ] Deduced a trap composed of 39 places in 182 ms of which 27 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 9/46 constraints. Problems are: Problem set: 188 solved, 520 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 0/46 constraints. Problems are: Problem set: 188 solved, 520 unsolved
At refinement iteration 5 (OVERLAPS) 718/1160 variables, 442/488 constraints. Problems are: Problem set: 188 solved, 520 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1160 variables, 170/658 constraints. Problems are: Problem set: 188 solved, 520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1160/1160 variables, and 658 constraints, problems are : Problem set: 188 solved, 520 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 442/442 constraints, ReadFeed: 170/170 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 188 solved, 520 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 24/24 constraints. Problems are: Problem set: 188 solved, 520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/24 constraints. Problems are: Problem set: 188 solved, 520 unsolved
At refinement iteration 2 (OVERLAPS) 188/442 variables, 11/35 constraints. Problems are: Problem set: 188 solved, 520 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 11/46 constraints. Problems are: Problem set: 188 solved, 520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 442/1160 variables, and 46 constraints, problems are : Problem set: 188 solved, 520 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/442 constraints, ReadFeed: 0/170 constraints, PredecessorRefiner: 0/708 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60222ms problems are : Problem set: 188 solved, 520 unsolved
Search for dead transitions found 188 dead transitions in 60224ms
Found 188 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 188 transitions
Dead transitions reduction (with SMT) removed 188 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 442/442 places, 530/718 transitions.
Graph (complete) has 1399 edges and 442 vertex of which 254 are kept as prefixes of interest. Removing 188 places using SCC suffix rule.3 ms
Discarding 188 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 254 /442 variables (removed 188) and now considering 530/530 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 254/442 places, 530/718 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60331 ms. Remains : 254/442 places, 530/718 transitions.
Built C files in :
/tmp/ltsmin649612713101510477
[2025-05-29 20:03:59] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin649612713101510477
Running compilation step : cd /tmp/ltsmin649612713101510477;'/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 1178 ms.
Running link step : cd /tmp/ltsmin649612713101510477;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin649612713101510477;'/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/stateBased11948516899408589341.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 442 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 442/442 places, 718/718 transitions.
Applied a total of 0 rules in 16 ms. Remains 442 /442 variables (removed 0) and now considering 718/718 (removed 0) transitions.
// Phase 1: matrix 718 rows 442 cols
[2025-05-29 20:04:14] [INFO ] Computed 22 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:04:15] [INFO ] Implicit Places using invariants in 349 ms returned []
[2025-05-29 20:04:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:04:15] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-05-29 20:04:17] [INFO ] Implicit Places using invariants and state equation in 2131 ms returned []
Implicit Place search using SMT with State Equation took 2482 ms to find 0 implicit places.
Running 708 sub problems to find dead transitions.
[2025-05-29 20:04:17] [INFO ] Invariant cache hit.
[2025-05-29 20:04:17] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:24] [INFO ] Deduced a trap composed of 59 places in 206 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:25] [INFO ] Deduced a trap composed of 59 places in 216 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:28] [INFO ] Deduced a trap composed of 50 places in 192 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:29] [INFO ] Deduced a trap composed of 59 places in 205 ms of which 43 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:31] [INFO ] Deduced a trap composed of 59 places in 206 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:32] [INFO ] Deduced a trap composed of 70 places in 221 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:36] [INFO ] Deduced a trap composed of 59 places in 187 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:37] [INFO ] Deduced a trap composed of 70 places in 212 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:38] [INFO ] Deduced a trap composed of 59 places in 221 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:38] [INFO ] Deduced a trap composed of 59 places in 217 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:39] [INFO ] Deduced a trap composed of 59 places in 213 ms of which 41 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 7/33 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:46] [INFO ] Deduced a trap composed of 70 places in 210 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:47] [INFO ] Deduced a trap composed of 59 places in 215 ms of which 44 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 442/1160 variables, and 35 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/442 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 708 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 708 unsolved
SMT process timed out in 60196ms, After SMT, problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 60199ms
Finished structural reductions in LTL mode , in 1 iterations and 62700 ms. Remains : 442/442 places, 718/718 transitions.
Built C files in :
/tmp/ltsmin15178246460663390286
[2025-05-29 20:05:17] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15178246460663390286
Running compilation step : cd /tmp/ltsmin15178246460663390286;'/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 1129 ms.
Running link step : cd /tmp/ltsmin15178246460663390286;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin15178246460663390286;'/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/stateBased2721123910969906050.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-29 20:05:32] [INFO ] Flatten gal took : 34 ms
[2025-05-29 20:05:32] [INFO ] Flatten gal took : 32 ms
[2025-05-29 20:05:32] [INFO ] Time to serialize gal into /tmp/LTL443019309846315419.gal : 6 ms
[2025-05-29 20:05:32] [INFO ] Time to serialize properties into /tmp/LTL7475394226919772985.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL443019309846315419.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13264102605695174066.hoa' '-atoms' '/tmp/LTL7475394226919772985.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7475394226919772985.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13264102605695174066.hoa
Detected timeout of ITS tools.
[2025-05-29 20:05:47] [INFO ] Flatten gal took : 28 ms
[2025-05-29 20:05:47] [INFO ] Flatten gal took : 26 ms
[2025-05-29 20:05:47] [INFO ] Time to serialize gal into /tmp/LTL6113016524192526517.gal : 6 ms
[2025-05-29 20:05:47] [INFO ] Time to serialize properties into /tmp/LTL394096781815561374.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6113016524192526517.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL394096781815561374.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(G(("((next_5==0)||(ncs_2_7==0))")||(X(X((!("((next_7==1)&&(ncs_5_0==1))"))U((G(!("((next_7==1)&&(ncs_5_0==1))")))||((!("((next_7=...221
Formula 0 simplified : XF(!"((next_5==0)||(ncs_2_7==0))" & XX(F!"((next_5==1)&&(ncs_2_7==1))" U "((next_7==1)&&(ncs_5_0==1))"))
Detected timeout of ITS tools.
[2025-05-29 20:06:02] [INFO ] Flatten gal took : 26 ms
[2025-05-29 20:06:02] [INFO ] Applying decomposition
[2025-05-29 20:06:03] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5354830724143451882.txt' '-o' '/tmp/graph5354830724143451882.bin' '-w' '/tmp/graph5354830724143451882.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5354830724143451882.bin' '-l' '-1' '-v' '-w' '/tmp/graph5354830724143451882.weights' '-q' '0' '-e' '0.001'
[2025-05-29 20:06:03] [INFO ] Decomposing Gal with order
[2025-05-29 20:06:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 20:06:03] [INFO ] Removed a total of 1221 redundant transitions.
[2025-05-29 20:06:03] [INFO ] Flatten gal took : 101 ms
[2025-05-29 20:06:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 16 ms.
[2025-05-29 20:06:03] [INFO ] Time to serialize gal into /tmp/LTL16630164573685572787.gal : 10 ms
[2025-05-29 20:06:03] [INFO ] Time to serialize properties into /tmp/LTL1778519472709788289.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16630164573685572787.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1778519472709788289.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G(("((i0.i1.u2.next_5==0)||(i2.u23.ncs_2_7==0))")||(X(X((!("((i0.i1.u3.next_7==1)&&(i6.u31.ncs_5_0==1))"))U((G(!("((i0.i1.u3.next...301
Formula 0 simplified : XF(!"((i0.i1.u2.next_5==0)||(i2.u23.ncs_2_7==0))" & XX(F!"((i0.i1.u2.next_5==1)&&(i2.u23.ncs_2_7==1))" U "((i0.i1.u3.next_7==1)&&(i6...175
Detected timeout of ITS tools.
Treatment of property Anderson-PT-10-LTLFireability-01 finished in 266071 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U ((!p1&&X((X(X(F(!p2)))||G(!p1)))) U (G((!p1&&X((X(X(F(!p2)))||G(!p1)))))||(X((X(X(F(!p2)))||G(!p1)))&&p3)))))'
Support contains 8 out of 464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 1063/1063 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 444 transition count 737
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 444 transition count 737
Applied a total of 40 rules in 19 ms. Remains 444 /464 variables (removed 20) and now considering 737/1063 (removed 326) transitions.
// Phase 1: matrix 737 rows 444 cols
[2025-05-29 20:06:18] [INFO ] Computed 23 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:06:18] [INFO ] Implicit Places using invariants in 477 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 478 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 443/464 places, 737/1063 transitions.
Applied a total of 0 rules in 6 ms. Remains 443 /443 variables (removed 0) and now considering 737/737 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 504 ms. Remains : 443/464 places, 737/1063 transitions.
Stuttering acceptance computed with spot in 635 ms :[(OR (AND p1 (NOT p3)) (AND p1 p2)), true, (NOT p0), (AND p2 p1), (OR (AND p1 (NOT p3)) (AND p1 p2)), (AND p1 p2), p2, (AND p2 p1), p2, (AND p1 p2), (AND p2 (NOT p0)), (OR (AND p0 p1 p2) (AND p1 p2 p3)), (AND p2 p1), (AND p2 (NOT p0)), (AND p1 p2), (AND p1 p2)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-02
Product exploration explored 100000 steps with 25000 reset in 288 ms.
Product exploration explored 100000 steps with 25000 reset in 263 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 p3 (NOT p1) (NOT p0) (NOT p2)), (X p3), (X (NOT (AND (NOT p3) p1))), (X (OR p3 (NOT p1))), (X (NOT (AND (NOT p3) p1 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p0)))), (X (NOT (OR (AND p3 p0) (AND (NOT p1) p0)))), (X (NOT (AND (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p3) p1 p0))), (X (NOT (AND (NOT p3) (NOT p1) p0))), (X (OR (AND p3 (NOT p0)) (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (X p3)), (X (X (NOT (AND (NOT p3) p1)))), (X (X (OR p3 (NOT p1)))), (X (X (NOT (AND (NOT p3) p1 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (OR (AND p3 p0) (AND (NOT p1) p0))))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p3) p1 p0)))), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (X (X (OR (AND p3 (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 32 factoid took 121 ms. Reduced automaton from 16 states, 50 edges and 4 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[p2, (AND p2 p1), (AND p2 p1), (AND p2 p1), (AND p2 p1)]
RANDOM walk for 40000 steps (8 resets) in 288 ms. (138 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 26 ms. (1481 steps per ms) remains 1/2 properties
// Phase 1: matrix 737 rows 443 cols
[2025-05-29 20:06:20] [INFO ] Computed 22 invariants in 4 ms
[2025-05-29 20:06:20] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 413/417 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/435 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/435 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/435 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 443/1180 variables, and 22 constraints, problems are : Problem set: 1 solved, 0 unsolved in 125 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/443 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 138ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p3 (NOT p1) (NOT p0) (NOT p2)), (X p3), (X (NOT (AND (NOT p3) p1))), (X (OR p3 (NOT p1))), (X (NOT (AND (NOT p3) p1 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p0)))), (X (NOT (OR (AND p3 p0) (AND (NOT p1) p0)))), (X (NOT (AND (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p3) p1 p0))), (X (NOT (AND (NOT p3) (NOT p1) p0))), (X (OR (AND p3 (NOT p0)) (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (X p3)), (X (X (NOT (AND (NOT p3) p1)))), (X (X (OR p3 (NOT p1)))), (X (X (NOT (AND (NOT p3) p1 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (OR (AND p3 p0) (AND (NOT p1) p0))))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p3) p1 p0)))), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (X (X (OR (AND p3 (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (G (OR (NOT p1) (NOT p2)))]
False Knowledge obtained : [(F p1), (F p2), (F (NOT (OR p1 (NOT p2))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 33 factoid took 18 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-10-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-10-LTLFireability-02 finished in 2282 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((p0||F(G(p1))))))'
Support contains 3 out of 464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 1063/1063 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 443 transition count 718
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 443 transition count 718
Applied a total of 42 rules in 21 ms. Remains 443 /464 variables (removed 21) and now considering 718/1063 (removed 345) transitions.
// Phase 1: matrix 718 rows 443 cols
[2025-05-29 20:06:20] [INFO ] Computed 23 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:06:21] [INFO ] Implicit Places using invariants in 457 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 458 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/464 places, 718/1063 transitions.
Applied a total of 0 rules in 7 ms. Remains 442 /442 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 486 ms. Remains : 442/464 places, 718/1063 transitions.
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-10-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 134 ms.
Product exploration explored 100000 steps with 0 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 p0) p1), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
BEST_FIRST walk for 6968 steps (0 resets) in 14 ms. (464 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Support contains 2 out of 442 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 : 442/442 places, 718/718 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 442 transition count 620
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 196 place count 344 transition count 620
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 90 Pre rules applied. Total rules applied 196 place count 344 transition count 530
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 376 place count 254 transition count 530
Applied a total of 376 rules in 23 ms. Remains 254 /442 variables (removed 188) and now considering 530/718 (removed 188) transitions.
// Phase 1: matrix 530 rows 254 cols
[2025-05-29 20:06:22] [INFO ] Computed 22 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:06:22] [INFO ] Implicit Places using invariants in 232 ms returned []
[2025-05-29 20:06:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:06:22] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-05-29 20:06:23] [INFO ] Implicit Places using invariants and state equation in 1523 ms returned []
Implicit Place search using SMT with State Equation took 1756 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 20:06:23] [INFO ] Redundant transitions in 15 ms returned []
Running 520 sub problems to find dead transitions.
[2025-05-29 20:06:23] [INFO ] Invariant cache hit.
[2025-05-29 20:06:23] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 520 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:27] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:28] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:28] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:29] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:29] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:29] [INFO ] Deduced a trap composed of 42 places in 142 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:30] [INFO ] Deduced a trap composed of 43 places in 136 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:30] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:30] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:30] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 520 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:32] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:34] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:34] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 21 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 520 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:38] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:38] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 22 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 6 (OVERLAPS) 530/784 variables, 254/291 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/784 variables, 90/381 constraints. Problems are: Problem set: 0 solved, 520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 784/784 variables, and 381 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 254/254 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 520/520 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 520 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 15/37 constraints. Problems are: Problem set: 0 solved, 520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 254/784 variables, and 37 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/254 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/520 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60168ms problems are : Problem set: 0 solved, 520 unsolved
Search for dead transitions found 0 dead transitions in 60171ms
Starting structural reductions in SI_LTL mode, iteration 1 : 254/442 places, 530/718 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61974 ms. Remains : 254/442 places, 530/718 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 : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
BEST_FIRST walk for 11831 steps (2 resets) in 9 ms. (1183 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p1)]
Product exploration explored 100000 steps with 0 reset in 153 ms.
Product exploration explored 100000 steps with 0 reset in 207 ms.
Built C files in :
/tmp/ltsmin2274476408645529603
[2025-05-29 20:07:24] [INFO ] Computing symmetric may disable matrix : 530 transitions.
[2025-05-29 20:07:24] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 20:07:24] [INFO ] Computing symmetric may enable matrix : 530 transitions.
[2025-05-29 20:07:24] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 20:07:24] [INFO ] Computing Do-Not-Accords matrix : 530 transitions.
[2025-05-29 20:07:24] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 20:07:24] [INFO ] Built C files in 101ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2274476408645529603
Running compilation step : cd /tmp/ltsmin2274476408645529603;'/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 1263 ms.
Running link step : cd /tmp/ltsmin2274476408645529603;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin2274476408645529603;'/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/stateBased4572452503668932248.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 530/530 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 254 transition count 529
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 253 transition count 529
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 252 transition count 510
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 252 transition count 510
Applied a total of 4 rules in 27 ms. Remains 252 /254 variables (removed 2) and now considering 510/530 (removed 20) transitions.
// Phase 1: matrix 510 rows 252 cols
[2025-05-29 20:07:39] [INFO ] Computed 22 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:07:40] [INFO ] Implicit Places using invariants in 217 ms returned []
[2025-05-29 20:07:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:07:40] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-05-29 20:07:40] [INFO ] Implicit Places using invariants and state equation in 808 ms returned []
Implicit Place search using SMT with State Equation took 1027 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 20:07:40] [INFO ] Redundant transitions in 8 ms returned []
Running 500 sub problems to find dead transitions.
[2025-05-29 20:07:40] [INFO ] Invariant cache hit.
[2025-05-29 20:07:40] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:44] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:44] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:44] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:45] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:46] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:49] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:49] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:49] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:50] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:50] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:50] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:53] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 6 (OVERLAPS) 510/762 variables, 252/286 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/762 variables, 90/376 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 762/762 variables, and 376 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 252/252 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 252/762 variables, and 34 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/252 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/500 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60151ms problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 60152ms
Starting structural reductions in SI_LTL mode, iteration 1 : 252/254 places, 510/530 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61223 ms. Remains : 252/254 places, 510/530 transitions.
Built C files in :
/tmp/ltsmin12118049817699217329
[2025-05-29 20:08:41] [INFO ] Computing symmetric may disable matrix : 510 transitions.
[2025-05-29 20:08:41] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 20:08:41] [INFO ] Computing symmetric may enable matrix : 510 transitions.
[2025-05-29 20:08:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 20:08:41] [INFO ] Computing Do-Not-Accords matrix : 510 transitions.
[2025-05-29 20:08:41] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 20:08:41] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12118049817699217329
Running compilation step : cd /tmp/ltsmin12118049817699217329;'/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 1147 ms.
Running link step : cd /tmp/ltsmin12118049817699217329;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin12118049817699217329;'/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/stateBased17141107175796718563.hoa' '--buchi-type=spotba'
LTSmin run took 7466 ms.
FORMULA Anderson-PT-10-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Anderson-PT-10-LTLFireability-03 finished in 149222 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U X(X((p1||X((p0||F(!p2))))))))'
Support contains 6 out of 464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 1063/1063 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 444 transition count 737
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 444 transition count 737
Applied a total of 40 rules in 25 ms. Remains 444 /464 variables (removed 20) and now considering 737/1063 (removed 326) transitions.
// Phase 1: matrix 737 rows 444 cols
[2025-05-29 20:08:49] [INFO ] Computed 23 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:08:50] [INFO ] Implicit Places using invariants in 482 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 485 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 443/464 places, 737/1063 transitions.
Applied a total of 0 rules in 6 ms. Remains 443 /443 variables (removed 0) and now considering 737/737 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 517 ms. Remains : 443/464 places, 737/1063 transitions.
Stuttering acceptance computed with spot in 380 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2 (NOT p0)), (AND p2 (NOT p0)), p2, (AND (NOT p0) p2 (NOT p1)), (AND p2 (NOT p0) (NOT p1)), (AND p2 p0)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-05
Product exploration explored 100000 steps with 25000 reset in 238 ms.
Product exploration explored 100000 steps with 25000 reset in 238 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 90 ms. Reduced automaton from 9 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[(AND p2 (NOT p1) (NOT p0)), (AND p2 (NOT p1) (NOT p0)), p2, (AND p2 (NOT p1) (NOT p0)), (AND p2 (NOT p1) (NOT p0)), (AND p2 p0)]
RANDOM walk for 40000 steps (8 resets) in 117 ms. (338 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 48 ms. (816 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 46 ms. (851 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 92 ms. (430 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 41 ms. (952 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 5/6 properties
// Phase 1: matrix 737 rows 443 cols
[2025-05-29 20:08:51] [INFO ] Computed 22 invariants in 4 ms
[2025-05-29 20:08:51] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 411/417 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 17/434 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf1 is UNSAT
At refinement iteration 6 (OVERLAPS) 9/443 variables, 9/22 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 737/1180 variables, 443/465 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1180 variables, 90/555 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1180 variables, 0/555 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/1180 variables, 0/555 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1180/1180 variables, and 555 constraints, problems are : Problem set: 1 solved, 4 unsolved in 733 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 443/443 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 411/417 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 17/434 variables, 8/12 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 9/443 variables, 9/22 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 737/1180 variables, 443/465 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1180 variables, 90/555 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1180 variables, 4/559 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1180 variables, 0/559 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/1180 variables, 0/559 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1180/1180 variables, and 559 constraints, problems are : Problem set: 1 solved, 4 unsolved in 2115 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 443/443 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2864ms problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 949 ms.
Support contains 6 out of 443 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 443/443 places, 737/737 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 443 transition count 640
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 194 place count 346 transition count 640
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 90 Pre rules applied. Total rules applied 194 place count 346 transition count 550
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 374 place count 256 transition count 550
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 377 place count 256 transition count 547
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 380 place count 253 transition count 547
Applied a total of 380 rules in 25 ms. Remains 253 /443 variables (removed 190) and now considering 547/737 (removed 190) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 253/443 places, 547/737 transitions.
RANDOM walk for 40000 steps (8 resets) in 128 ms. (310 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 60 ms. (655 steps per ms) remains 1/4 properties
// Phase 1: matrix 547 rows 253 cols
[2025-05-29 20:08:55] [INFO ] Computed 22 invariants in 4 ms
[2025-05-29 20:08:55] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 222/224 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/233 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/252 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/253 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 547/800 variables, 253/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/800 variables, 90/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/800 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/800 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 800/800 variables, and 365 constraints, problems are : Problem set: 0 solved, 1 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 253/253 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 222/224 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/233 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/252 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:56] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 18 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/253 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/253 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 547/800 variables, 253/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/800 variables, 90/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/800 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/800 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/800 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 800/800 variables, and 367 constraints, problems are : Problem set: 0 solved, 1 unsolved in 653 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 253/253 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 888ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 253/253 places, 547/547 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 251 transition count 509
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 251 transition count 509
Applied a total of 4 rules in 12 ms. Remains 251 /253 variables (removed 2) and now considering 509/547 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 251/253 places, 509/547 transitions.
RANDOM walk for 30672 steps (6 resets) in 68 ms. (444 steps per ms) remains 0/1 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p2)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p1 p0 (NOT p2)))), (F p1), (F p2), (F (NOT (OR p0 (NOT p2))))]
Knowledge based reduction with 7 factoid took 285 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Support contains 4 out of 443 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 443/443 places, 737/737 transitions.
Applied a total of 0 rules in 13 ms. Remains 443 /443 variables (removed 0) and now considering 737/737 (removed 0) transitions.
// Phase 1: matrix 737 rows 443 cols
[2025-05-29 20:08:57] [INFO ] Computed 22 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:08:57] [INFO ] Implicit Places using invariants in 362 ms returned []
[2025-05-29 20:08:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:08:58] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-05-29 20:09:00] [INFO ] Implicit Places using invariants and state equation in 2421 ms returned []
Implicit Place search using SMT with State Equation took 2787 ms to find 0 implicit places.
Running 727 sub problems to find dead transitions.
[2025-05-29 20:09:00] [INFO ] Invariant cache hit.
[2025-05-29 20:09:00] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 727 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/443 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 727 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:08] [INFO ] Deduced a trap composed of 59 places in 207 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:08] [INFO ] Deduced a trap composed of 59 places in 188 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:11] [INFO ] Deduced a trap composed of 50 places in 209 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:12] [INFO ] Deduced a trap composed of 59 places in 213 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:13] [INFO ] Deduced a trap composed of 59 places in 210 ms of which 43 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 727 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:15] [INFO ] Deduced a trap composed of 70 places in 210 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:17] [INFO ] Deduced a trap composed of 59 places in 202 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:17] [INFO ] Deduced a trap composed of 59 places in 209 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:17] [INFO ] Deduced a trap composed of 70 places in 198 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:18] [INFO ] Deduced a trap composed of 59 places in 200 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:18] [INFO ] Deduced a trap composed of 59 places in 185 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:19] [INFO ] Deduced a trap composed of 59 places in 186 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:23] [INFO ] Deduced a trap composed of 70 places in 206 ms of which 49 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/443 variables, 8/35 constraints. Problems are: Problem set: 0 solved, 727 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 443/1180 variables, and 35 constraints, problems are : Problem set: 0 solved, 727 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/443 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 727/727 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 727 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 727 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/443 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 727 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 727 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:35] [INFO ] Deduced a trap composed of 81 places in 211 ms of which 46 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/443 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 727 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 443/1180 variables, and 36 constraints, problems are : Problem set: 0 solved, 727 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/443 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/727 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60195ms problems are : Problem set: 0 solved, 727 unsolved
Search for dead transitions found 0 dead transitions in 60197ms
Finished structural reductions in LTL mode , in 1 iterations and 63000 ms. Remains : 443/443 places, 737/737 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 67 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
RANDOM walk for 40000 steps (8 resets) in 121 ms. (327 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 43 ms. (909 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 48 ms. (816 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 2/3 properties
[2025-05-29 20:10:00] [INFO ] Invariant cache hit.
[2025-05-29 20:10:00] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 412/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 18/434 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 9/443 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 737/1180 variables, 443/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1180 variables, 90/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1180 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1180 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1180/1180 variables, and 555 constraints, problems are : Problem set: 0 solved, 2 unsolved in 400 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 443/443 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 412/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/434 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:01] [INFO ] Deduced a trap composed of 320 places in 226 ms of which 76 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 9/443 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 737/1180 variables, 443/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1180 variables, 90/556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1180 variables, 2/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1180 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1180 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1180/1180 variables, and 558 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1227 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 443/443 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1637ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 29 ms.
Support contains 4 out of 443 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 443/443 places, 737/737 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 443 transition count 639
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 196 place count 345 transition count 639
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 90 Pre rules applied. Total rules applied 196 place count 345 transition count 549
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 376 place count 255 transition count 549
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 377 place count 254 transition count 530
Iterating global reduction 2 with 1 rules applied. Total rules applied 378 place count 254 transition count 530
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 380 place count 254 transition count 528
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 382 place count 252 transition count 528
Applied a total of 382 rules in 25 ms. Remains 252 /443 variables (removed 191) and now considering 528/737 (removed 209) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 252/443 places, 528/737 transitions.
RANDOM walk for 40000 steps (8 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 131167 steps, run visited all 2 properties in 815 ms. (steps per millisecond=160 )
Probabilistic random walk after 131167 steps, saw 99323 distinct states, run finished after 818 ms. (steps per millisecond=160 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) (NOT p2))]
False Knowledge obtained : [(F p2), (F p1), (F (NOT (OR p1 (NOT p2))))]
Knowledge based reduction with 1 factoid took 129 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Product exploration explored 100000 steps with 25000 reset in 201 ms.
Product exploration explored 100000 steps with 25000 reset in 208 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Support contains 4 out of 443 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 443/443 places, 737/737 transitions.
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 443 transition count 737
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 90 Pre rules applied. Total rules applied 98 place count 443 transition count 737
Deduced a syphon composed of 188 places in 0 ms
Iterating global reduction 1 with 90 rules applied. Total rules applied 188 place count 443 transition count 737
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 189 place count 442 transition count 718
Deduced a syphon composed of 188 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 190 place count 442 transition count 718
Deduced a syphon composed of 188 places in 0 ms
Applied a total of 190 rules in 39 ms. Remains 442 /443 variables (removed 1) and now considering 718/737 (removed 19) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 20:10:04] [INFO ] Redundant transitions in 5 ms returned []
Running 708 sub problems to find dead transitions.
// Phase 1: matrix 718 rows 442 cols
[2025-05-29 20:10:04] [INFO ] Computed 22 invariants in 6 ms
[2025-05-29 20:10:04] [INFO ] State equation strengthened by 170 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:09] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:10] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:10] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:10] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:10] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:10] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:10] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:10] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:11] [INFO ] Deduced a trap composed of 24 places in 182 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:11] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:11] [INFO ] Deduced a trap composed of 39 places in 185 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:11] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:13] [INFO ] Deduced a trap composed of 40 places in 181 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:13] [INFO ] Deduced a trap composed of 39 places in 184 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:13] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:14] [INFO ] Deduced a trap composed of 39 places in 188 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:14] [INFO ] Deduced a trap composed of 39 places in 189 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:14] [INFO ] Deduced a trap composed of 39 places in 180 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:14] [INFO ] Deduced a trap composed of 39 places in 184 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:15] [INFO ] Deduced a trap composed of 39 places in 185 ms of which 30 ms to minimize.
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 20/42 constraints. Problems are: Problem set: 188 solved, 520 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:16] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:18] [INFO ] Deduced a trap composed of 40 places in 177 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:19] [INFO ] Deduced a trap composed of 40 places in 180 ms of which 30 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 3/45 constraints. Problems are: Problem set: 188 solved, 520 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:28] [INFO ] Deduced a trap composed of 42 places in 189 ms of which 31 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 1/46 constraints. Problems are: Problem set: 188 solved, 520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 442/1160 variables, and 46 constraints, problems are : Problem set: 188 solved, 520 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/442 constraints, ReadFeed: 0/170 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 188 solved, 520 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 24/24 constraints. Problems are: Problem set: 188 solved, 520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/24 constraints. Problems are: Problem set: 188 solved, 520 unsolved
At refinement iteration 2 (OVERLAPS) 188/442 variables, 11/35 constraints. Problems are: Problem set: 188 solved, 520 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 11/46 constraints. Problems are: Problem set: 188 solved, 520 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:43] [INFO ] Deduced a trap composed of 41 places in 193 ms of which 30 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 1/47 constraints. Problems are: Problem set: 188 solved, 520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 442/1160 variables, and 47 constraints, problems are : Problem set: 188 solved, 520 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/442 constraints, ReadFeed: 0/170 constraints, PredecessorRefiner: 0/708 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60235ms problems are : Problem set: 188 solved, 520 unsolved
Search for dead transitions found 188 dead transitions in 60237ms
Found 188 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 188 transitions
Dead transitions reduction (with SMT) removed 188 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 442/443 places, 530/737 transitions.
Graph (complete) has 1399 edges and 442 vertex of which 254 are kept as prefixes of interest. Removing 188 places using SCC suffix rule.1 ms
Discarding 188 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 254 /442 variables (removed 188) and now considering 530/530 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 254/443 places, 530/737 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60301 ms. Remains : 254/443 places, 530/737 transitions.
Built C files in :
/tmp/ltsmin9757112735481654074
[2025-05-29 20:11:04] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9757112735481654074
Running compilation step : cd /tmp/ltsmin9757112735481654074;'/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 1130 ms.
Running link step : cd /tmp/ltsmin9757112735481654074;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9757112735481654074;'/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/stateBased4266452603373505968.hoa' '--buchi-type=spotba'
LTSmin run took 3907 ms.
FORMULA Anderson-PT-10-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Anderson-PT-10-LTLFireability-05 finished in 140057 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (X((X(!p1)||(F(!p3)&&p2)))||G(!p0)))))'
Support contains 8 out of 464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 1063/1063 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 444 transition count 737
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 444 transition count 737
Applied a total of 40 rules in 18 ms. Remains 444 /464 variables (removed 20) and now considering 737/1063 (removed 326) transitions.
// Phase 1: matrix 737 rows 444 cols
[2025-05-29 20:11:09] [INFO ] Computed 23 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:11:10] [INFO ] Implicit Places using invariants in 373 ms returned []
[2025-05-29 20:11:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:11:10] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-05-29 20:11:12] [INFO ] Implicit Places using invariants and state equation in 2452 ms returned []
Implicit Place search using SMT with State Equation took 2835 ms to find 0 implicit places.
Running 727 sub problems to find dead transitions.
[2025-05-29 20:11:12] [INFO ] Invariant cache hit.
[2025-05-29 20:11:12] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 727 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/444 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 727 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:19] [INFO ] Deduced a trap composed of 51 places in 199 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:19] [INFO ] Deduced a trap composed of 59 places in 182 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:19] [INFO ] Deduced a trap composed of 51 places in 219 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:21] [INFO ] Deduced a trap composed of 52 places in 199 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:22] [INFO ] Deduced a trap composed of 52 places in 213 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:22] [INFO ] Deduced a trap composed of 52 places in 210 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:24] [INFO ] Deduced a trap composed of 43 places in 198 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:24] [INFO ] Deduced a trap composed of 52 places in 210 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:26] [INFO ] Deduced a trap composed of 52 places in 210 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:26] [INFO ] Deduced a trap composed of 59 places in 194 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:26] [INFO ] Deduced a trap composed of 53 places in 211 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:27] [INFO ] Deduced a trap composed of 59 places in 199 ms of which 41 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/444 variables, 12/35 constraints. Problems are: Problem set: 0 solved, 727 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:31] [INFO ] Deduced a trap composed of 52 places in 209 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:31] [INFO ] Deduced a trap composed of 52 places in 209 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:32] [INFO ] Deduced a trap composed of 53 places in 207 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:36] [INFO ] Deduced a trap composed of 50 places in 210 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:36] [INFO ] Deduced a trap composed of 59 places in 207 ms of which 43 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 727 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 444/1181 variables, and 40 constraints, problems are : Problem set: 0 solved, 727 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/444 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 727/727 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 727 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 727 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/444 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 727 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/444 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 727 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:47] [INFO ] Deduced a trap composed of 70 places in 196 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:48] [INFO ] Deduced a trap composed of 59 places in 193 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:48] [INFO ] Deduced a trap composed of 59 places in 203 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:48] [INFO ] Deduced a trap composed of 70 places in 204 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:48] [INFO ] Deduced a trap composed of 59 places in 201 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:49] [INFO ] Deduced a trap composed of 59 places in 202 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:49] [INFO ] Deduced a trap composed of 59 places in 199 ms of which 41 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/1181 variables, and 47 constraints, problems are : Problem set: 0 solved, 727 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/444 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/727 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60281ms problems are : Problem set: 0 solved, 727 unsolved
Search for dead transitions found 0 dead transitions in 60282ms
Starting structural reductions in LTL mode, iteration 1 : 444/464 places, 737/1063 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63137 ms. Remains : 444/464 places, 737/1063 transitions.
Stuttering acceptance computed with spot in 457 ms :[true, p3, (OR (AND p1 (NOT p2)) (AND p1 p3)), p1, (OR (AND p1 (NOT p2)) (AND p1 p3)), (OR (AND p0 p1 (NOT p2)) (AND p0 p1 p3)), (OR (AND p0 p1 (NOT p2)) (AND p0 p1 p3)), (OR (AND p0 p1 (NOT p2)) (AND p0 p1 p3)), (OR (AND p0 p1 (NOT p2)) (AND p0 p1 p3)), (AND p3 p1 p0), (AND p3 p1), (AND p3 p1)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-06
Product exploration explored 100000 steps with 25000 reset in 223 ms.
Product exploration explored 100000 steps with 25000 reset in 226 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2 p3))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 109 ms. Reduced automaton from 12 states, 22 edges and 4 AP (stutter sensitive) to 11 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 471 ms :[true, p1, p3, (OR (AND p1 (NOT p2)) (AND p1 p3)), (OR (AND p0 p1 (NOT p2)) (AND p0 p1 p3)), (AND p1 p3 p0), (AND p3 p1), (AND p3 p1), (OR (AND p0 p1 (NOT p2)) (AND p0 p1 p3)), (OR (AND p0 p1 (NOT p2)) (AND p0 p1 p3)), (OR (AND p0 p1 (NOT p2)) (AND p0 p1 p3))]
RANDOM walk for 40000 steps (8 resets) in 200 ms. (199 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 48 ms. (816 steps per ms) remains 10/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 36 ms. (1081 steps per ms) remains 7/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 58 ms. (678 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 55 ms. (714 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 36 ms. (1081 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 7/7 properties
[2025-05-29 20:12:14] [INFO ] Invariant cache hit.
[2025-05-29 20:12:14] [INFO ] State equation strengthened by 90 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 422/430 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 6/436 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem apf2 is UNSAT
Problem apf3 is UNSAT
Problem apf4 is UNSAT
Problem apf5 is UNSAT
Problem apf7 is UNSAT
Problem apf8 is UNSAT
Problem apf10 is UNSAT
After SMT solving in domain Real declared 444/1181 variables, and 23 constraints, problems are : Problem set: 7 solved, 0 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/444 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 7/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 388ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 7 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2 p3)))), (G (OR p0 (NOT p3) (NOT p1))), (G (OR p0 (NOT p2) (NOT p3) (NOT p1))), (G (OR (NOT p0) p2 (NOT p1))), (G (OR (NOT p2) (NOT p3) (NOT p1))), (G (OR (NOT p0) (NOT p2) (NOT p3) (NOT p1))), (G (OR (NOT p0) (NOT p3) (NOT p1))), (G (OR (NOT p3) (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p0 p2 (NOT p1)))), (F p1), (F p2), (F p3), (F p0)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 17 factoid took 18 ms. Reduced automaton from 11 states, 16 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-10-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-10-LTLFireability-06 finished in 65224 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0 U X(X(X(p1))))))))'
Support contains 3 out of 464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 1063/1063 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 443 transition count 700
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 443 transition count 700
Applied a total of 42 rules in 23 ms. Remains 443 /464 variables (removed 21) and now considering 700/1063 (removed 363) transitions.
// Phase 1: matrix 700 rows 443 cols
[2025-05-29 20:12:15] [INFO ] Computed 23 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:12:15] [INFO ] Implicit Places using invariants in 468 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 470 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/464 places, 700/1063 transitions.
Applied a total of 0 rules in 6 ms. Remains 442 /442 variables (removed 0) and now considering 700/700 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 499 ms. Remains : 442/464 places, 700/1063 transitions.
Stuttering acceptance computed with spot in 470 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-07
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-10-LTLFireability-07 finished in 998 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((G(F((G(!p0)||(!p0&&G(F(p1))))))||(X(!p2)&&F((G(!p0)||(!p0&&G(F(p1))))))))))))'
Support contains 4 out of 464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 1063/1063 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 443 transition count 700
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 443 transition count 700
Applied a total of 42 rules in 20 ms. Remains 443 /464 variables (removed 21) and now considering 700/1063 (removed 363) transitions.
// Phase 1: matrix 700 rows 443 cols
[2025-05-29 20:12:16] [INFO ] Computed 23 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:12:16] [INFO ] Implicit Places using invariants in 442 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 443 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/464 places, 700/1063 transitions.
Applied a total of 0 rules in 6 ms. Remains 442 /442 variables (removed 0) and now considering 700/700 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 469 ms. Remains : 442/464 places, 700/1063 transitions.
Stuttering acceptance computed with spot in 376 ms :[p0, (AND (NOT p1) p0), (AND (NOT p1) p0 p2), (AND (NOT p1) p0), (AND p0 p2), p0, p0, p0, p0]
Running random walk in product with property : Anderson-PT-10-LTLFireability-08
Product exploration explored 100000 steps with 9 reset in 138 ms.
Stack based approach found an accepted trace after 9288 steps with 2 reset with depth 9279 and stack size 6765 in 16 ms.
FORMULA Anderson-PT-10-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-08 finished in 1028 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 464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 464/464 places, 1063/1063 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 464 transition count 973
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 374 transition count 973
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 203 place count 351 transition count 590
Iterating global reduction 0 with 23 rules applied. Total rules applied 226 place count 351 transition count 590
Applied a total of 226 rules in 24 ms. Remains 351 /464 variables (removed 113) and now considering 590/1063 (removed 473) transitions.
// Phase 1: matrix 590 rows 351 cols
[2025-05-29 20:12:17] [INFO ] Computed 23 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:12:17] [INFO ] Implicit Places using invariants in 391 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 392 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 350/464 places, 590/1063 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 350 transition count 510
Reduce places removed 80 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 90 rules applied. Total rules applied 170 place count 270 transition count 500
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 180 place count 260 transition count 500
Applied a total of 180 rules in 8 ms. Remains 260 /350 variables (removed 90) and now considering 500/590 (removed 90) transitions.
// Phase 1: matrix 500 rows 260 cols
[2025-05-29 20:12:17] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:12:17] [INFO ] Implicit Places using invariants in 229 ms returned []
[2025-05-29 20:12:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:12:18] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-05-29 20:12:19] [INFO ] Implicit Places using invariants and state equation in 1221 ms returned []
Implicit Place search using SMT with State Equation took 1452 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 260/464 places, 500/1063 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1878 ms. Remains : 260/464 places, 500/1063 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 164 ms.
Stack based approach found an accepted trace after 62 steps with 0 reset with depth 63 and stack size 63 in 0 ms.
FORMULA Anderson-PT-10-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-09 finished in 2102 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1)&&F(G(p2)))))'
Support contains 6 out of 464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 464/464 places, 1063/1063 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 464 transition count 973
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 374 transition count 973
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 200 place count 354 transition count 647
Iterating global reduction 0 with 20 rules applied. Total rules applied 220 place count 354 transition count 647
Applied a total of 220 rules in 22 ms. Remains 354 /464 variables (removed 110) and now considering 647/1063 (removed 416) transitions.
// Phase 1: matrix 647 rows 354 cols
[2025-05-29 20:12:19] [INFO ] Computed 23 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:12:19] [INFO ] Implicit Places using invariants in 446 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 446 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 353/464 places, 647/1063 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 353 transition count 550
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 194 place count 256 transition count 550
Applied a total of 194 rules in 8 ms. Remains 256 /353 variables (removed 97) and now considering 550/647 (removed 97) transitions.
// Phase 1: matrix 550 rows 256 cols
[2025-05-29 20:12:19] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:12:20] [INFO ] Implicit Places using invariants in 241 ms returned []
[2025-05-29 20:12:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:12:20] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-05-29 20:12:21] [INFO ] Implicit Places using invariants and state equation in 1504 ms returned []
Implicit Place search using SMT with State Equation took 1746 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 256/464 places, 550/1063 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2222 ms. Remains : 256/464 places, 550/1063 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-10
Product exploration explored 100000 steps with 54 reset in 148 ms.
Product exploration explored 100000 steps with 51 reset in 164 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 p0 p1 p2), (X p0), (X p2), (X p1), (X (X p0)), (X (X p2)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 89 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 109 ms. (363 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 64 ms. (615 steps per ms) remains 1/2 properties
[2025-05-29 20:12:22] [INFO ] Invariant cache hit.
[2025-05-29 20:12:22] [INFO ] State equation strengthened by 90 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 225/227 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/236 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 20/256 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 550/806 variables, 256/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/806 variables, 90/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/806 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/806 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 806/806 variables, and 368 constraints, problems are : Problem set: 0 solved, 1 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 256/256 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 225/227 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/236 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 20/256 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 550/806 variables, 256/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/806 variables, 90/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/806 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/806 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/806 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 806/806 variables, and 369 constraints, problems are : Problem set: 0 solved, 1 unsolved in 564 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 256/256 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 775ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 550/550 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 256 transition count 548
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 254 transition count 548
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 252 transition count 510
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 252 transition count 510
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 252 transition count 509
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 251 transition count 509
Applied a total of 10 rules in 18 ms. Remains 251 /256 variables (removed 5) and now considering 509/550 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 251/256 places, 509/550 transitions.
RANDOM walk for 40000 steps (8 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
BEST_FIRST walk for 35810 steps (7 resets) in 33 ms. (1053 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X p2), (X p1), (X (X p0)), (X (X p2)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT p2))]
Knowledge based reduction with 7 factoid took 156 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Support contains 6 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 550/550 transitions.
Applied a total of 0 rules in 9 ms. Remains 256 /256 variables (removed 0) and now considering 550/550 (removed 0) transitions.
[2025-05-29 20:12:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:12:23] [INFO ] Implicit Places using invariants in 226 ms returned []
[2025-05-29 20:12:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:12:24] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-05-29 20:12:25] [INFO ] Implicit Places using invariants and state equation in 1546 ms returned []
Implicit Place search using SMT with State Equation took 1774 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 20:12:25] [INFO ] Redundant transitions in 6 ms returned []
Running 540 sub problems to find dead transitions.
[2025-05-29 20:12:25] [INFO ] Invariant cache hit.
[2025-05-29 20:12:25] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:12:28] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:12:30] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:12:30] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:12:30] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:12:30] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:12:30] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:12:31] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:12:32] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 21 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:12:33] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:12:33] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:12:33] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:12:33] [INFO ] Deduced a trap composed of 40 places in 177 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:12:34] [INFO ] Deduced a trap composed of 42 places in 143 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:12:34] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:12:34] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:12:40] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 21 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:12:43] [INFO ] Deduced a trap composed of 41 places in 190 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:12:43] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:12:47] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 20 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 256/806 variables, and 41 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/256 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 540 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 256/806 variables, and 41 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/256 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/540 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60205ms problems are : Problem set: 0 solved, 540 unsolved
Search for dead transitions found 0 dead transitions in 60206ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62005 ms. Remains : 256/256 places, 550/550 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X p2), (X p1), (X (X p0)), (X (X p2)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 93 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 124 ms. (320 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
[2025-05-29 20:13:26] [INFO ] Invariant cache hit.
[2025-05-29 20:13:26] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 225/227 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/236 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 20/256 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 550/806 variables, 256/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/806 variables, 90/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/806 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/806 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 806/806 variables, and 368 constraints, problems are : Problem set: 0 solved, 1 unsolved in 202 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 256/256 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 225/227 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/236 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 20/256 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:13:26] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 23 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 550/806 variables, 256/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/806 variables, 90/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/806 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/806 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/806 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 806/806 variables, and 370 constraints, problems are : Problem set: 0 solved, 1 unsolved in 596 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 256/256 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 803ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 550/550 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 256 transition count 548
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 254 transition count 548
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 252 transition count 510
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 252 transition count 510
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 252 transition count 509
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 251 transition count 509
Applied a total of 10 rules in 18 ms. Remains 251 /256 variables (removed 5) and now considering 509/550 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 251/256 places, 509/550 transitions.
RANDOM walk for 40000 steps (8 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
BEST_FIRST walk for 16899 steps (3 resets) in 14 ms. (1126 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X p2), (X p1), (X (X p0)), (X (X p2)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT p2))]
Knowledge based reduction with 7 factoid took 153 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 61 reset in 140 ms.
Product exploration explored 100000 steps with 49 reset in 162 ms.
Built C files in :
/tmp/ltsmin12358488027875606572
[2025-05-29 20:13:27] [INFO ] Computing symmetric may disable matrix : 550 transitions.
[2025-05-29 20:13:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 20:13:27] [INFO ] Computing symmetric may enable matrix : 550 transitions.
[2025-05-29 20:13:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 20:13:27] [INFO ] Computing Do-Not-Accords matrix : 550 transitions.
[2025-05-29 20:13:27] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 20:13:27] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12358488027875606572
Running compilation step : cd /tmp/ltsmin12358488027875606572;'/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 1261 ms.
Running link step : cd /tmp/ltsmin12358488027875606572;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin12358488027875606572;'/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/stateBased13236354844535599372.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 550/550 transitions.
Applied a total of 0 rules in 14 ms. Remains 256 /256 variables (removed 0) and now considering 550/550 (removed 0) transitions.
[2025-05-29 20:13:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:13:43] [INFO ] Implicit Places using invariants in 212 ms returned []
[2025-05-29 20:13:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:13:43] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-05-29 20:13:44] [INFO ] Implicit Places using invariants and state equation in 1476 ms returned []
Implicit Place search using SMT with State Equation took 1688 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 20:13:44] [INFO ] Redundant transitions in 6 ms returned []
Running 540 sub problems to find dead transitions.
[2025-05-29 20:13:44] [INFO ] Invariant cache hit.
[2025-05-29 20:13:44] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:13:47] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:13:49] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:13:49] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:13:49] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:13:49] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:13:49] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:13:50] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:13:51] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:13:52] [INFO ] Deduced a trap composed of 43 places in 129 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:13:52] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:13:52] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:13:52] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:13:53] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:13:53] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:13:53] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:13:59] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 20 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:14:02] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:14:02] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:14:06] [INFO ] Deduced a trap composed of 43 places in 132 ms of which 21 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 256/806 variables, and 41 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/256 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 540 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 256/806 variables, and 41 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/256 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/540 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60197ms problems are : Problem set: 0 solved, 540 unsolved
Search for dead transitions found 0 dead transitions in 60199ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61913 ms. Remains : 256/256 places, 550/550 transitions.
Built C files in :
/tmp/ltsmin863120809729689586
[2025-05-29 20:14:44] [INFO ] Computing symmetric may disable matrix : 550 transitions.
[2025-05-29 20:14:44] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 20:14:44] [INFO ] Computing symmetric may enable matrix : 550 transitions.
[2025-05-29 20:14:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 20:14:44] [INFO ] Computing Do-Not-Accords matrix : 550 transitions.
[2025-05-29 20:14:44] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 20:14:45] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin863120809729689586
Running compilation step : cd /tmp/ltsmin863120809729689586;'/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 1277 ms.
Running link step : cd /tmp/ltsmin863120809729689586;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin863120809729689586;'/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/stateBased6333444200953276162.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-29 20:15:00] [INFO ] Flatten gal took : 17 ms
[2025-05-29 20:15:00] [INFO ] Flatten gal took : 16 ms
[2025-05-29 20:15:00] [INFO ] Time to serialize gal into /tmp/LTL17165174291704893930.gal : 3 ms
[2025-05-29 20:15:00] [INFO ] Time to serialize properties into /tmp/LTL8447920544250755862.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17165174291704893930.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2111169440127888858.hoa' '-atoms' '/tmp/LTL8447920544250755862.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8447920544250755862.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2111169440127888858.hoa
Detected timeout of ITS tools.
[2025-05-29 20:15:15] [INFO ] Flatten gal took : 15 ms
[2025-05-29 20:15:15] [INFO ] Flatten gal took : 15 ms
[2025-05-29 20:15:15] [INFO ] Time to serialize gal into /tmp/LTL11568652294240182983.gal : 3 ms
[2025-05-29 20:15:15] [INFO ] Time to serialize properties into /tmp/LTL5841327831360312897.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11568652294240182983.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5841327831360312897.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(((F("((next_14==0)||(ncs_5_1==0))"))&&(F("((next_4!=1)||(ncs_4_4!=1))")))&&(F(G("((next_13!=1)||(ncs_1_5!=1))"))))))
Formula 0 simplified : F(G!"((next_14==0)||(ncs_5_1==0))" | G!"((next_4!=1)||(ncs_4_4!=1))" | GF!"((next_13!=1)||(ncs_1_5!=1))")
Detected timeout of ITS tools.
[2025-05-29 20:15:30] [INFO ] Flatten gal took : 13 ms
[2025-05-29 20:15:30] [INFO ] Applying decomposition
[2025-05-29 20:15:30] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2396012378994466655.txt' '-o' '/tmp/graph2396012378994466655.bin' '-w' '/tmp/graph2396012378994466655.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2396012378994466655.bin' '-l' '-1' '-v' '-w' '/tmp/graph2396012378994466655.weights' '-q' '0' '-e' '0.001'
[2025-05-29 20:15:30] [INFO ] Decomposing Gal with order
[2025-05-29 20:15:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 20:15:30] [INFO ] Removed a total of 1004 redundant transitions.
[2025-05-29 20:15:30] [INFO ] Flatten gal took : 33 ms
[2025-05-29 20:15:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 17 ms.
[2025-05-29 20:15:30] [INFO ] Time to serialize gal into /tmp/LTL14374462329475086166.gal : 4 ms
[2025-05-29 20:15:30] [INFO ] Time to serialize properties into /tmp/LTL4103436687666155714.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14374462329475086166.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4103436687666155714.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(((F("((i3.u9.next_14==0)||(u55.ncs_5_1==0))"))&&(F("((i3.u5.next_4!=1)||(u13.ncs_4_4!=1))")))&&(F(G("((i3.u9.next_13!=1)||(i9.u49...175
Formula 0 simplified : F(G!"((i3.u9.next_14==0)||(u55.ncs_5_1==0))" | G!"((i3.u5.next_4!=1)||(u13.ncs_4_4!=1))" | GF!"((i3.u9.next_13!=1)||(i9.u49.ncs_1_5!...161
Detected timeout of ITS tools.
Treatment of property Anderson-PT-10-LTLFireability-10 finished in 206146 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)&&p0))&&F(G(p2)))))'
Support contains 5 out of 464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 1063/1063 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 444 transition count 719
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 444 transition count 719
Applied a total of 40 rules in 14 ms. Remains 444 /464 variables (removed 20) and now considering 719/1063 (removed 344) transitions.
// Phase 1: matrix 719 rows 444 cols
[2025-05-29 20:15:45] [INFO ] Computed 23 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:15:45] [INFO ] Implicit Places using invariants in 422 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 423 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 443/464 places, 719/1063 transitions.
Applied a total of 0 rules in 6 ms. Remains 443 /443 variables (removed 0) and now considering 719/719 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 444 ms. Remains : 443/464 places, 719/1063 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 134 ms.
Stack based approach found an accepted trace after 66 steps with 0 reset with depth 67 and stack size 67 in 0 ms.
FORMULA Anderson-PT-10-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-12 finished in 818 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||F(G(p1)))))))'
Support contains 4 out of 464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 1063/1063 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 443 transition count 718
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 443 transition count 718
Applied a total of 42 rules in 17 ms. Remains 443 /464 variables (removed 21) and now considering 718/1063 (removed 345) transitions.
// Phase 1: matrix 718 rows 443 cols
[2025-05-29 20:15:46] [INFO ] Computed 23 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:15:46] [INFO ] Implicit Places using invariants in 487 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 488 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/464 places, 718/1063 transitions.
Applied a total of 0 rules in 6 ms. Remains 442 /442 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 511 ms. Remains : 442/464 places, 718/1063 transitions.
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-10-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 140 ms.
Stack based approach found an accepted trace after 75 steps with 0 reset with depth 76 and stack size 76 in 0 ms.
FORMULA Anderson-PT-10-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-13 finished in 843 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 4 out of 464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 464/464 places, 1063/1063 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 464 transition count 973
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 374 transition count 973
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 201 place count 353 transition count 628
Iterating global reduction 0 with 21 rules applied. Total rules applied 222 place count 353 transition count 628
Applied a total of 222 rules in 24 ms. Remains 353 /464 variables (removed 111) and now considering 628/1063 (removed 435) transitions.
// Phase 1: matrix 628 rows 353 cols
[2025-05-29 20:15:47] [INFO ] Computed 23 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:15:47] [INFO ] Implicit Places using invariants in 470 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 471 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 352/464 places, 628/1063 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 352 transition count 530
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 196 place count 254 transition count 530
Applied a total of 196 rules in 8 ms. Remains 254 /352 variables (removed 98) and now considering 530/628 (removed 98) transitions.
// Phase 1: matrix 530 rows 254 cols
[2025-05-29 20:15:47] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:15:47] [INFO ] Implicit Places using invariants in 219 ms returned []
[2025-05-29 20:15:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:15:48] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-05-29 20:15:49] [INFO ] Implicit Places using invariants and state equation in 1240 ms returned []
Implicit Place search using SMT with State Equation took 1460 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 254/464 places, 530/1063 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1964 ms. Remains : 254/464 places, 530/1063 transitions.
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-15
Product exploration explored 100000 steps with 2 reset in 141 ms.
Stack based approach found an accepted trace after 55 steps with 0 reset with depth 56 and stack size 56 in 0 ms.
FORMULA Anderson-PT-10-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-15 finished in 2218 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((X(X((!p1 U (G(!p1)||(!p1&&G(p2))))))||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1)&&F(G(p2)))))'
[2025-05-29 20:15:49] [INFO ] Flatten gal took : 27 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4146111861803185796
[2025-05-29 20:15:49] [INFO ] Applying decomposition
[2025-05-29 20:15:49] [INFO ] Computing symmetric may disable matrix : 1063 transitions.
[2025-05-29 20:15:49] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 20:15:49] [INFO ] Computing symmetric may enable matrix : 1063 transitions.
[2025-05-29 20:15:49] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 20:15:49] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12639960683341456661.txt' '-o' '/tmp/graph12639960683341456661.bin' '-w' '/tmp/graph12639960683341456661.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12639960683341456661.bin' '-l' '-1' '-v' '-w' '/tmp/graph12639960683341456661.weights' '-q' '0' '-e' '0.001'
[2025-05-29 20:15:49] [INFO ] Decomposing Gal with order
[2025-05-29 20:15:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 20:15:49] [INFO ] Removed a total of 1856 redundant transitions.
[2025-05-29 20:15:49] [INFO ] Flatten gal took : 92 ms
[2025-05-29 20:15:49] [INFO ] Computing Do-Not-Accords matrix : 1063 transitions.
[2025-05-29 20:15:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 140 labels/synchronizations in 19 ms.
[2025-05-29 20:15:49] [INFO ] Time to serialize gal into /tmp/LTLFireability11898536247800763712.gal : 6 ms
[2025-05-29 20:15:49] [INFO ] Time to serialize properties into /tmp/LTLFireability18015492840532670931.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11898536247800763712.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18015492840532670931.ltl' '-c' '-stutter-deadlock'
[2025-05-29 20:15:49] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 2 LTL properties
[2025-05-29 20:15:49] [INFO ] Built C files in 288ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4146111861803185796
Running compilation step : cd /tmp/ltsmin4146111861803185796;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' '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'
Checking formula 0 : !((X(G(("((i1.u2.next_5==0)||(i5.u24.ncs_2_7==0))")||(X(X((!("((i3.u3.next_7==1)&&(i1.u2.ncs_5_0==1))"))U((G(!("((i3.u3.next_7==1)&&(i...283
Formula 0 simplified : XF(!"((i1.u2.next_5==0)||(i5.u24.ncs_2_7==0))" & XX(F!"((i1.u2.next_5==1)&&(i5.u24.ncs_2_7==1))" U "((i3.u3.next_7==1)&&(i1.u2.ncs_5...165
Compilation finished in 3254 ms.
Running link step : cd /tmp/ltsmin4146111861803185796;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin4146111861803185796;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X(X((!(LTLAPp1==true) U ([](!(LTLAPp1==true))||(!(LTLAPp1==true)&&[]((LTLAPp2==true)))))))||(LTLAPp0==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.123: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.123: LTL layer: formula: X([]((X(X((!(LTLAPp1==true) U ([](!(LTLAPp1==true))||(!(LTLAPp1==true)&&[]((LTLAPp2==true)))))))||(LTLAPp0==true))))
pins2lts-mc-linux64( 2/ 8), 0.123: "X([]((X(X((!(LTLAPp1==true) U ([](!(LTLAPp1==true))||(!(LTLAPp1==true)&&[]((LTLAPp2==true)))))))||(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.124: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.124: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.172: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.174: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.181: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.182: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.185: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.188: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.192: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.505: DFS-FIFO for weak LTL, using special progress label 1070
pins2lts-mc-linux64( 0/ 8), 0.505: There are 1071 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.505: State length is 465, there are 1103 groups
pins2lts-mc-linux64( 0/ 8), 0.505: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.505: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.505: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.505: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.945: ~1 levels ~960 states ~9464 transitions
pins2lts-mc-linux64( 0/ 8), 1.190: ~1 levels ~1920 states ~18856 transitions
pins2lts-mc-linux64( 7/ 8), 1.420: ~1 levels ~3840 states ~37152 transitions
pins2lts-mc-linux64( 2/ 8), 1.697: ~1 levels ~7680 states ~73432 transitions
pins2lts-mc-linux64( 2/ 8), 2.057: ~1 levels ~15360 states ~146456 transitions
pins2lts-mc-linux64( 2/ 8), 2.940: ~1 levels ~30720 states ~287264 transitions
pins2lts-mc-linux64( 2/ 8), 4.446: ~1 levels ~61440 states ~573384 transitions
pins2lts-mc-linux64( 2/ 8), 6.987: ~1 levels ~122880 states ~1141344 transitions
pins2lts-mc-linux64( 2/ 8), 11.576: ~1 levels ~245760 states ~2256904 transitions
pins2lts-mc-linux64( 2/ 8), 20.265: ~1 levels ~491520 states ~4484832 transitions
pins2lts-mc-linux64( 2/ 8), 37.227: ~1 levels ~983040 states ~8796696 transitions
pins2lts-mc-linux64( 2/ 8), 71.380: ~1 levels ~1966080 states ~17424992 transitions
pins2lts-mc-linux64( 2/ 8), 139.086: ~1 levels ~3932160 states ~34038032 transitions
pins2lts-mc-linux64( 5/ 8), 196.006: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 196.176:
pins2lts-mc-linux64( 0/ 8), 196.177: mean standard work distribution: 2.1% (states) 1.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 196.177:
pins2lts-mc-linux64( 0/ 8), 196.177: Explored 5369806 states 48163760 transitions, fanout: 8.969
pins2lts-mc-linux64( 0/ 8), 196.177: Total exploration time 195.660 sec (195.470 sec minimum, 195.528 sec on average)
pins2lts-mc-linux64( 0/ 8), 196.177: States per second: 27445, Transitions per second: 246160
pins2lts-mc-linux64( 0/ 8), 196.177:
pins2lts-mc-linux64( 0/ 8), 196.177: Progress states detected: 20984477
pins2lts-mc-linux64( 0/ 8), 196.177: Redundant explorations: -74.4106
pins2lts-mc-linux64( 0/ 8), 196.177:
pins2lts-mc-linux64( 0/ 8), 196.177: Queue width: 8B, total height: 23174917, memory: 176.81MB
pins2lts-mc-linux64( 0/ 8), 196.177: Tree memory: 416.1MB, 20.8 B/state, compr.: 1.1%
pins2lts-mc-linux64( 0/ 8), 196.177: Tree fill ratio (roots/leafs): 15.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 196.177: Stored 1088 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 196.177: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 196.177: Est. total memory use: 592.9MB (~1200.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4146111861803185796;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X(X((!(LTLAPp1==true) U ([](!(LTLAPp1==true))||(!(LTLAPp1==true)&&[]((LTLAPp2==true)))))))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4146111861803185796;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X(X((!(LTLAPp1==true) U ([](!(LTLAPp1==true))||(!(LTLAPp1==true)&&[]((LTLAPp2==true)))))))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-05-29 20:40:58] [INFO ] Applying decomposition
[2025-05-29 20:40:58] [INFO ] Flatten gal took : 25 ms
[2025-05-29 20:40:58] [INFO ] Decomposing Gal with order
[2025-05-29 20:40:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 20:40:58] [INFO ] Removed a total of 1263 redundant transitions.
[2025-05-29 20:40:58] [INFO ] Flatten gal took : 99 ms
[2025-05-29 20:40:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 330 labels/synchronizations in 19 ms.
[2025-05-29 20:40:58] [INFO ] Time to serialize gal into /tmp/LTLFireability16902318539710451216.gal : 5 ms
[2025-05-29 20:40:58] [INFO ] Time to serialize properties into /tmp/LTLFireability8137192661684800979.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16902318539710451216.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8137192661684800979.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((X(G(("((u11.next_5==0)||(u9.ncs_2_7==0))")||(X(X((!("((u11.next_7==1)&&(u2.ncs_5_0==1))"))U((G(!("((u11.next_7==1)&&(u2.ncs_5_0==1)...256
Formula 0 simplified : XF(!"((u11.next_5==0)||(u9.ncs_2_7==0))" & XX(F!"((u11.next_5==1)&&(u9.ncs_2_7==1))" U "((u11.next_7==1)&&(u2.ncs_5_0==1))"))
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t5, t6, t7, t10, t14, t28, t30, t37, t40, t49, t52, t56, t60, t62, t63, t64, t66, t67...1513
48 unique states visited
48 strongly connected components in search stack
50 transitions explored
48 items max in DFS search stack
79671 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,796.784,10879756,1,0,1.66467e+07,3.19715e+06,4003,1.90508e+07,2021,2.74978e+07,7566457
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Anderson-PT-10-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(((F("((u11.next_14==0)||(u2.ncs_5_1==0))"))&&(F("((u11.next_4!=1)||(u1.ncs_4_4!=1))")))&&(F(G("((u11.next_13!=1)||(u8.ncs_1_5!=1)...163
Formula 1 simplified : F(G!"((u11.next_14==0)||(u2.ncs_5_1==0))" | G!"((u11.next_4!=1)||(u1.ncs_4_4!=1))" | GF!"((u11.next_13!=1)||(u8.ncs_1_5!=1))")
5 unique states visited
3 strongly connected components in search stack
6 transitions explored
3 items max in DFS search stack
31085 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1107.63,10889532,1,0,1.66467e+07,3.19715e+06,5200,1.90508e+07,2250,2.74978e+07,65474380
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Anderson-PT-10-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 3598268 ms.

BK_STOP 1748552422364

--------------------
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="Anderson-PT-10"
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 Anderson-PT-10, 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 r002-tall-174853728800196"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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