Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 676K
-rw-r--r-- 1 mcc users 9.2K Jun 6 09:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Jun 6 09:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Jun 6 09:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 6 09:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Jun 6 12:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Jun 6 12:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Jun 6 12:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 12:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 18K Jun 6 09:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Jun 6 09:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 6 09:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Jun 6 09:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Jun 6 12:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Jun 6 12:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 17 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 165K Jun 5 20:08 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 ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-00
FORMULA_NAME ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-01
FORMULA_NAME ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-02
FORMULA_NAME ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-03
FORMULA_NAME ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-04
FORMULA_NAME ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-05
FORMULA_NAME ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-06
FORMULA_NAME ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-07
FORMULA_NAME ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-08
FORMULA_NAME ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-09
FORMULA_NAME ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-10
FORMULA_NAME ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-11
FORMULA_NAME ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-12
FORMULA_NAME ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-13
FORMULA_NAME ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-14
FORMULA_NAME ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749415732166

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ZombiesAndSurvivors-PT-Circular64010010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-08 20:48:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-08 20:48:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 20:48:53] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2025-06-08 20:48:53] [INFO ] Transformed 128 places.
[2025-06-08 20:48:53] [INFO ] Transformed 384 transitions.
[2025-06-08 20:48:53] [INFO ] Parsed PT model containing 128 places and 384 transitions and 896 arcs in 157 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 384/384 transitions.
Applied a total of 0 rules in 16 ms. Remains 128 /128 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 128 cols
[2025-06-08 20:48:53] [INFO ] Computed 0 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 20:48:53] [INFO ] Implicit Places using invariants in 143 ms returned []
[2025-06-08 20:48:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 20:48:54] [INFO ] State equation strengthened by 126 read => feed constraints.
[2025-06-08 20:48:54] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Running 380 sub problems to find dead transitions.
[2025-06-08 20:48:54] [INFO ] Invariant cache hit.
[2025-06-08 20:48:54] [INFO ] State equation strengthened by 126 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (OVERLAPS) 384/512 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 126/254 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 512/512 variables, and 254 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30024 ms.
Refiners :[State Equation: 128/128 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 380 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (OVERLAPS) 384/512 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 126/254 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 380/634 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 512/512 variables, and 634 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30020 ms.
Refiners :[State Equation: 128/128 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60146ms problems are : Problem set: 0 solved, 380 unsolved
Search for dead transitions found 0 dead transitions in 60157ms
Finished structural reductions in LTL mode , in 1 iterations and 60593 ms. Remains : 128/128 places, 384/384 transitions.
Support contains 36 out of 128 places after structural reductions.
[2025-06-08 20:49:54] [INFO ] Flatten gal took : 39 ms
[2025-06-08 20:49:54] [INFO ] Flatten gal took : 18 ms
[2025-06-08 20:49:54] [INFO ] Input system was already deterministic with 384 transitions.
RANDOM walk for 40020 steps (8 resets) in 517 ms. (77 steps per ms) remains 18/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
[2025-06-08 20:49:54] [INFO ] Invariant cache hit.
[2025-06-08 20:49:54] [INFO ] State equation strengthened by 126 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 138/166 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 28/56 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 160/326 variables, 46/102 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 48/150 constraints. Problems are: Problem set: 0 solved, 18 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 69/395 variables, 23/173 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 20/193 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 17/412 variables, 5/198 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/412 variables, 4/202 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 16/428 variables, 4/206 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/428 variables, 4/210 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/428 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (OVERLAPS) 16/444 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/444 variables, 4/218 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/444 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 19 (OVERLAPS) 16/460 variables, 4/222 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/460 variables, 4/226 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/460 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 22 (OVERLAPS) 16/476 variables, 4/230 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/476 variables, 4/234 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/476 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 25 (OVERLAPS) 16/492 variables, 4/238 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/492 variables, 4/242 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/492 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 28 (OVERLAPS) 16/508 variables, 4/246 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/508 variables, 4/250 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/508 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 31 (OVERLAPS) 4/512 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 18 unsolved
SMT process timed out in 5026ms, After SMT, problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 28 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 384/384 transitions.
Graph (trivial) has 156 edges and 128 vertex of which 93 / 128 are part of one of the 15 SCC in 9 ms
Free SCC test removed 78 places
Drop transitions (Empty/Sink Transition effects.) removed 156 transitions
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 220 transitions.
Applied a total of 1 rules in 31 ms. Remains 50 /128 variables (removed 78) and now considering 164/384 (removed 220) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 50/128 places, 164/384 transitions.
RANDOM walk for 40029 steps (8 resets) in 137 ms. (290 steps per ms) remains 6/18 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
// Phase 1: matrix 164 rows 50 cols
[2025-06-08 20:50:00] [INFO ] Computed 0 invariants in 1 ms
[2025-06-08 20:50:00] [INFO ] State equation strengthened by 54 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.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) 22/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 51/77 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 52/129 variables, 14/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 18/147 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/147 variables, 5/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/147 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 16/163 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/163 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/163 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 16/179 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/179 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/179 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 16/195 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/195 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/195 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 16/211 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/211 variables, 6/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/211 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 3/214 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/214 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/214 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/214 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 104 constraints, problems are : Problem set: 0 solved, 2 unsolved in 225 ms.
Refiners :[State Equation: 50/50 constraints, ReadFeed: 54/54 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 45.0 s and query timeout 4500.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) 22/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 51/77 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 52/129 variables, 14/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 18/147 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/147 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/147 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 16/163 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/163 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/163 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 16/179 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/179 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/179 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 16/195 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/195 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/195 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 16/211 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/211 variables, 6/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/211 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 3/214 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/214 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/214 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/214 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 106 constraints, problems are : Problem set: 0 solved, 2 unsolved in 270 ms.
Refiners :[State Equation: 50/50 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 506ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 164/164 transitions.
Graph (trivial) has 84 edges and 50 vertex of which 46 / 50 are part of one of the 4 SCC in 0 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 84 transitions
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 138 transitions.
Applied a total of 1 rules in 1 ms. Remains 8 /50 variables (removed 42) and now considering 26/164 (removed 138) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 8/50 places, 26/164 transitions.
RANDOM walk for 40017 steps (8 resets) in 14 ms. (2667 steps per ms) remains 0/2 properties
FORMULA ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 64 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((X(p0)||G(p1)))&&(p2||X(F(p3))))))'
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 384/384 transitions.
Applied a total of 0 rules in 12 ms. Remains 128 /128 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 128 cols
[2025-06-08 20:50:01] [INFO ] Computed 0 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 20:50:01] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-08 20:50:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 20:50:01] [INFO ] State equation strengthened by 126 read => feed constraints.
[2025-06-08 20:50:01] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Running 380 sub problems to find dead transitions.
[2025-06-08 20:50:01] [INFO ] Invariant cache hit.
[2025-06-08 20:50:01] [INFO ] State equation strengthened by 126 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (OVERLAPS) 384/512 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 126/254 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 512/512 variables, and 254 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30036 ms.
Refiners :[State Equation: 128/128 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 380 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (OVERLAPS) 384/512 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 126/254 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 380/634 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 512/512 variables, and 634 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30021 ms.
Refiners :[State Equation: 128/128 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60088ms problems are : Problem set: 0 solved, 380 unsolved
Search for dead transitions found 0 dead transitions in 60089ms
Finished structural reductions in LTL mode , in 1 iterations and 60238 ms. Remains : 128/128 places, 384/384 transitions.
Stuttering acceptance computed with spot in 485 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p3), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-00
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-00 finished in 60807 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 384/384 transitions.
Graph (trivial) has 240 edges and 128 vertex of which 124 / 128 are part of one of the 4 SCC in 1 ms
Free SCC test removed 120 places
Ensure Unique test removed 354 transitions
Reduce isomorphic transitions removed 354 transitions.
Applied a total of 1 rules in 5 ms. Remains 8 /128 variables (removed 120) and now considering 30/384 (removed 354) transitions.
[2025-06-08 20:51:01] [INFO ] Flow matrix only has 27 transitions (discarded 3 similar events)
// Phase 1: matrix 27 rows 8 cols
[2025-06-08 20:51:01] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 20:51:01] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-06-08 20:51:01] [INFO ] Flow matrix only has 27 transitions (discarded 3 similar events)
[2025-06-08 20:51:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 20:51:01] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-08 20:51:01] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 20:51:01] [INFO ] Redundant transitions in 1 ms returned []
Running 23 sub problems to find dead transitions.
[2025-06-08 20:51:01] [INFO ] Flow matrix only has 27 transitions (discarded 3 similar events)
[2025-06-08 20:51:01] [INFO ] Invariant cache hit.
[2025-06-08 20:51:01] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 25/32 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 2/34 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 0/34 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/35 variables, and 14 constraints, problems are : Problem set: 0 solved, 23 unsolved in 236 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 25/32 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 2/34 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 14/37 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 0/34 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 34/35 variables, and 37 constraints, problems are : Problem set: 0 solved, 23 unsolved in 211 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 452ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 452ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/128 places, 30/384 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 509 ms. Remains : 8/128 places, 30/384 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-02 finished in 641 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(p0) U (p1||X(p2))) U (!p0&&X(!p3))))))'
Support contains 7 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 384/384 transitions.
Applied a total of 0 rules in 18 ms. Remains 128 /128 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 128 cols
[2025-06-08 20:51:02] [INFO ] Computed 0 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 20:51:02] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-08 20:51:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 20:51:02] [INFO ] State equation strengthened by 126 read => feed constraints.
[2025-06-08 20:51:02] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 380 sub problems to find dead transitions.
[2025-06-08 20:51:02] [INFO ] Invariant cache hit.
[2025-06-08 20:51:02] [INFO ] State equation strengthened by 126 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (OVERLAPS) 384/512 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 126/254 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 0.0)
(t1 0.0)
(t2 0.0)
(t3 0.0)
(t4 0.0)
(t5 0.0)
(t6 0.0)
(t7 0.0)
(t8 0.0)
(t9 0.0)
(t10 0.0)
(t11 0.0)
(t12 0.0)
(t13 0.0)
(t14 0.0)
(t15 0.0)
(t16 0.0)
(t17 0.0)
(t18 0.0)
(t19 0.0)
(t20 0.0)
(t21 0.0)
(t22 0.0)
(t23 0.0)
(t24 0.0)
(t25 0.0)
(t26 0.0)
(t27 0.0)
(t28 0.0)
(t29 0.0)
(t30 0.0)
(t31 0.0)
(t32 0.0)
(t33 0.0)
(t34 0.0)
(t35 0.0)
(t36 0.0)
(t37 0.0)
(t38 0.0)
(t39 0.0)
(t40 0.0)
(t41 0.0)
(t42 0.0)
(t43 0.0)
(t44 0.0)
(t45 0.0)
(t46 0.0)
(t47 0.0)
(t48 0.0)
(t49 0.0)
(t50 0.0)
(t51 0.0)
(t52 0.0)
(t53 0.0)
(t54 0.0)
(t55 timeout
0.0)
(t56 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 512/512 variables, and 254 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30021 ms.
Refiners :[State Equation: 128/128 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 380 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (OVERLAPS) 384/512 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 126/254 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 380/634 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 512/512 variables, and 634 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30024 ms.
Refiners :[State Equation: 128/128 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60077ms problems are : Problem set: 0 solved, 380 unsolved
Search for dead transitions found 0 dead transitions in 60078ms
Finished structural reductions in LTL mode , in 1 iterations and 60232 ms. Remains : 128/128 places, 384/384 transitions.
Stuttering acceptance computed with spot in 429 ms :[(OR p3 p0), (AND (NOT p0) (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), p3, (OR (AND p0 (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p3)), (OR p3 p0), (AND (NOT p0) p3), false, false]
Running random walk in product with property : ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-05
Product exploration explored 100000 steps with 42888 reset in 268 ms.
Product exploration explored 100000 steps with 42902 reset in 171 ms.
Computed a total of 0 stabilizing places and 64 stable transitions
Computed a total of 0 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 p3))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) p3))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) p3))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT p3))), (X (X (NOT (AND p0 p3)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p2) (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 34 factoid took 188 ms. Reduced automaton from 9 states, 35 edges and 4 AP (stutter sensitive) to 9 states, 35 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 436 ms :[(OR p0 p3), (AND (NOT p0) (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), p3, (OR (AND p0 (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p3)), (OR p0 p3), (AND (NOT p0) p3), false, false]
RANDOM walk for 40006 steps (8 resets) in 293 ms. (136 steps per ms) remains 15/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
[2025-06-08 20:52:04] [INFO ] Invariant cache hit.
[2025-06-08 20:52:04] [INFO ] State equation strengthened by 126 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 36/43 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 63/106 variables, 15/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 15/44 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 60/166 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 15/75 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 48/214 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 12/99 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/214 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 48/262 variables, 12/111 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/262 variables, 12/123 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/262 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (OVERLAPS) 39/301 variables, 11/134 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/301 variables, 11/145 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/301 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 19 (OVERLAPS) 20/321 variables, 6/151 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/321 variables, 6/157 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/321 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 22 (OVERLAPS) 16/337 variables, 4/161 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/337 variables, 4/165 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/337 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 25 (OVERLAPS) 16/353 variables, 4/169 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/353 variables, 3/172 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/353 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 28 (OVERLAPS) 16/369 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/369 variables, 4/180 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/369 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 31 (OVERLAPS) 16/385 variables, 4/184 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/385 variables, 4/188 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/385 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 34 (OVERLAPS) 16/401 variables, 4/192 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/401 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/401 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 37 (OVERLAPS) 16/417 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/417 variables, 4/204 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/417 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 40 (OVERLAPS) 16/433 variables, 4/208 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/433 variables, 4/212 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/433 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 43 (OVERLAPS) 16/449 variables, 4/216 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/449 variables, 4/220 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/449 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 46 (OVERLAPS) 16/465 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/465 variables, 4/228 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 465/512 variables, and 228 constraints, problems are : Problem set: 0 solved, 15 unsolved in 5005 ms.
Refiners :[State Equation: 115/128 constraints, ReadFeed: 113/126 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 36/43 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 63/106 variables, 15/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 15/44 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 60/166 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 15/90 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 48/214 variables, 12/102 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/214 variables, 12/114 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/214 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 48/262 variables, 12/126 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/262 variables, 12/138 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/262 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (OVERLAPS) 39/301 variables, 11/149 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/301 variables, 11/160 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/301 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 20 (OVERLAPS) 20/321 variables, 6/166 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/321 variables, 6/172 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/321 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 23 (OVERLAPS) 16/337 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/337 variables, 4/180 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/337 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 26 (OVERLAPS) 16/353 variables, 4/184 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/353 variables, 3/187 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/353 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 29 (OVERLAPS) 16/369 variables, 4/191 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/369 variables, 4/195 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/369 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 32 (OVERLAPS) 16/385 variables, 4/199 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/385 variables, 4/203 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/385 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 35 (OVERLAPS) 16/401 variables, 4/207 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/401 variables, 4/211 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/401 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 38 (OVERLAPS) 16/417 variables, 4/215 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/417 variables, 4/219 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/417 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 41 (OVERLAPS) 16/433 variables, 4/223 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/433 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/433 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 15 unsolved
SMT process timed out in 10034ms, After SMT, problems are : Problem set: 0 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 384/384 transitions.
Graph (trivial) has 228 edges and 128 vertex of which 121 / 128 are part of one of the 7 SCC in 0 ms
Free SCC test removed 114 places
Drop transitions (Empty/Sink Transition effects.) removed 228 transitions
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 340 transitions.
Applied a total of 1 rules in 4 ms. Remains 14 /128 variables (removed 114) and now considering 44/384 (removed 340) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 14/128 places, 44/384 transitions.
RANDOM walk for 40026 steps (8 resets) in 58 ms. (678 steps per ms) remains 3/15 properties
BEST_FIRST walk for 2908 steps (0 resets) in 7 ms. (363 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 p3))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) p3))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) p3))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT p3))), (X (X (NOT (AND p0 p3)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p2) (NOT p3))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p3) p1 p2))), (F (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR (NOT p0) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p3)))), (F (NOT (OR p0 (NOT p3) p2))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p3) p1))), (F (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p2), (F p1), (F p3), (F p0), (F (NOT (OR p0 (NOT p3) p1 p2))), (F (NOT (OR (NOT p0) (NOT p3) p1))), (F (NOT (OR p0 (NOT p3))))]
Knowledge based reduction with 34 factoid took 864 ms. Reduced automaton from 9 states, 35 edges and 4 AP (stutter sensitive) to 9 states, 35 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 443 ms :[(OR p0 p3), (AND (NOT p0) (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), p3, (OR (AND p0 (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p3)), (OR p0 p3), (AND (NOT p0) p3), false, false]
Stuttering acceptance computed with spot in 403 ms :[(OR p0 p3), (AND (NOT p0) (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), p3, (OR (AND p0 (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p3)), (OR p0 p3), (AND (NOT p0) p3), false, false]
Support contains 7 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 384/384 transitions.
Applied a total of 0 rules in 8 ms. Remains 128 /128 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2025-06-08 20:52:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 20:52:16] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-08 20:52:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 20:52:16] [INFO ] State equation strengthened by 126 read => feed constraints.
[2025-06-08 20:52:16] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 380 sub problems to find dead transitions.
[2025-06-08 20:52:16] [INFO ] Invariant cache hit.
[2025-06-08 20:52:16] [INFO ] State equation strengthened by 126 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (OVERLAPS) 384/512 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 126/254 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 0.0)
(t1 0.0)
(t2 0.0)
(t3 0.0)
(t4 0.0)
(t5 0.0)
(t6 0.0)
(t7 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 512/512 variables, and 254 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30017 ms.
Refiners :[State Equation: 128/128 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 380 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (OVERLAPS) 384/512 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 126/254 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 380/634 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 512/512 variables, and 634 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30019 ms.
Refiners :[State Equation: 128/128 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60062ms problems are : Problem set: 0 solved, 380 unsolved
Search for dead transitions found 0 dead transitions in 60063ms
Finished structural reductions in LTL mode , in 1 iterations and 60203 ms. Remains : 128/128 places, 384/384 transitions.
Computed a total of 0 stabilizing places and 64 stable transitions
Computed a total of 0 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2)))), (X (NOT p3)), (X (NOT (AND (NOT p0) p3 (NOT p2)))), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p3 (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND p0 p3 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (NOT (AND p0 p3 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 34 factoid took 158 ms. Reduced automaton from 9 states, 35 edges and 4 AP (stutter sensitive) to 9 states, 35 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 366 ms :[(OR p3 p0), (AND (NOT p0) (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), p3, (OR (AND p0 (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p3)), (OR p3 p0), (AND (NOT p0) p3), false, false]
RANDOM walk for 40015 steps (8 resets) in 58 ms. (678 steps per ms) remains 15/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 6 ms. (572 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 5 ms. (667 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 5 ms. (667 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 7 ms. (500 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 6 ms. (572 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 6 ms. (572 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 6 ms. (572 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 6 ms. (572 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 6 ms. (572 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 6 ms. (572 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 6 ms. (572 steps per ms) remains 15/15 properties
[2025-06-08 20:53:17] [INFO ] Invariant cache hit.
[2025-06-08 20:53:17] [INFO ] State equation strengthened by 126 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 36/43 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 63/106 variables, 15/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 15/44 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 60/166 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 15/75 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 48/214 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 12/99 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/214 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 48/262 variables, 12/111 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/262 variables, 12/123 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/262 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (OVERLAPS) 39/301 variables, 11/134 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/301 variables, 11/145 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/301 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 19 (OVERLAPS) 20/321 variables, 6/151 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/321 variables, 6/157 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/321 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 22 (OVERLAPS) 16/337 variables, 4/161 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/337 variables, 4/165 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/337 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 25 (OVERLAPS) 16/353 variables, 4/169 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/353 variables, 3/172 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/353 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 28 (OVERLAPS) 16/369 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/369 variables, 4/180 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/369 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 31 (OVERLAPS) 16/385 variables, 4/184 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/385 variables, 4/188 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/385 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 34 (OVERLAPS) 16/401 variables, 4/192 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/401 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/401 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 37 (OVERLAPS) 16/417 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/417 variables, 4/204 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/417 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 40 (OVERLAPS) 16/433 variables, 4/208 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/433 variables, 4/212 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/433 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 43 (OVERLAPS) 16/449 variables, 4/216 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/449 variables, 4/220 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/449 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 46 (OVERLAPS) 16/465 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/465 variables, 4/228 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/465 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 49 (OVERLAPS) 16/481 variables, 4/232 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/481 variables, 4/236 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/481 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 52 (OVERLAPS) 16/497 variables, 4/240 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/497 variables, 4/244 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/497 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 55 (OVERLAPS) 14/511 variables, 4/248 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/511 variables, 5/253 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/511 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 58 (OVERLAPS) 1/512 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/512 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 60 (OVERLAPS) 0/512 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 254 constraints, problems are : Problem set: 0 solved, 15 unsolved in 4801 ms.
Refiners :[State Equation: 128/128 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 36/43 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 63/106 variables, 15/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 15/44 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 60/166 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 15/90 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 48/214 variables, 12/102 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/214 variables, 12/114 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/214 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 48/262 variables, 12/126 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/262 variables, 12/138 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/262 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (OVERLAPS) 39/301 variables, 11/149 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/301 variables, 11/160 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/301 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 20 (OVERLAPS) 20/321 variables, 6/166 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/321 variables, 6/172 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/321 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 23 (OVERLAPS) 16/337 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/337 variables, 4/180 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/337 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 26 (OVERLAPS) 16/353 variables, 4/184 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/353 variables, 3/187 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/353 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 29 (OVERLAPS) 16/369 variables, 4/191 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/369 variables, 4/195 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/369 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 32 (OVERLAPS) 16/385 variables, 4/199 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/385 variables, 4/203 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/385 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 35 (OVERLAPS) 16/401 variables, 4/207 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/401 variables, 4/211 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 401/512 variables, and 211 constraints, problems are : Problem set: 0 solved, 15 unsolved in 5011 ms.
Refiners :[State Equation: 99/128 constraints, ReadFeed: 97/126 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9819ms problems are : Problem set: 0 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 384/384 transitions.
Graph (trivial) has 228 edges and 128 vertex of which 121 / 128 are part of one of the 7 SCC in 1 ms
Free SCC test removed 114 places
Drop transitions (Empty/Sink Transition effects.) removed 228 transitions
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 340 transitions.
Applied a total of 1 rules in 3 ms. Remains 14 /128 variables (removed 114) and now considering 44/384 (removed 340) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 14/128 places, 44/384 transitions.
RANDOM walk for 40027 steps (8 resets) in 38 ms. (1026 steps per ms) remains 3/15 properties
BEST_FIRST walk for 2865 steps (0 resets) in 7 ms. (358 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2)))), (X (NOT p3)), (X (NOT (AND (NOT p0) p3 (NOT p2)))), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p3 (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND p0 p3 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (NOT (AND p0 p3 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p2 (NOT p3)))), (F (NOT (OR p0 (NOT p3)))), (F (NOT (OR (NOT p0) p1 p2 (NOT p3)))), (F (NOT (OR p0 p1 p2 (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR p0 p1 (NOT p3)))), (F (NOT (OR (NOT p0) p1 (NOT p3)))), (F p2), (F (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (F p3), (F p1), (F (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p3)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 34 factoid took 830 ms. Reduced automaton from 9 states, 35 edges and 4 AP (stutter sensitive) to 9 states, 35 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 386 ms :[(OR p3 p0), (AND (NOT p0) (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), p3, (OR (AND p0 (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p3)), (OR p3 p0), (AND (NOT p0) p3), false, false]
Stuttering acceptance computed with spot in 388 ms :[(OR p3 p0), (AND (NOT p0) (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), p3, (OR (AND p0 (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p3)), (OR p3 p0), (AND (NOT p0) p3), false, false]
Stuttering acceptance computed with spot in 350 ms :[(OR p3 p0), (AND (NOT p0) (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), p3, (OR (AND p0 (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p3)), (OR p3 p0), (AND (NOT p0) p3), false, false]
Product exploration explored 100000 steps with 42797 reset in 139 ms.
Product exploration explored 100000 steps with 42843 reset in 155 ms.
Built C files in :
/tmp/ltsmin1154964397330633579
[2025-06-08 20:53:29] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1154964397330633579
Running compilation step : cd /tmp/ltsmin1154964397330633579;'/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 578 ms.
Running link step : cd /tmp/ltsmin1154964397330633579;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin1154964397330633579;'/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/stateBased14451890828026074582.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 384/384 transitions.
Applied a total of 0 rules in 9 ms. Remains 128 /128 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2025-06-08 20:53:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 20:53:44] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-08 20:53:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 20:53:44] [INFO ] State equation strengthened by 126 read => feed constraints.
[2025-06-08 20:53:44] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Running 380 sub problems to find dead transitions.
[2025-06-08 20:53:44] [INFO ] Invariant cache hit.
[2025-06-08 20:53:44] [INFO ] State equation strengthened by 126 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (OVERLAPS) 384/512 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 126/254 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 512/512 variables, and 254 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30015 ms.
Refiners :[State Equation: 128/128 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 380 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (OVERLAPS) 384/512 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 126/254 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 380/634 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 512/512 variables, and 634 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30018 ms.
Refiners :[State Equation: 128/128 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60060ms problems are : Problem set: 0 solved, 380 unsolved
Search for dead transitions found 0 dead transitions in 60060ms
Finished structural reductions in LTL mode , in 1 iterations and 60197 ms. Remains : 128/128 places, 384/384 transitions.
Built C files in :
/tmp/ltsmin16612754615034395644
[2025-06-08 20:54:44] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16612754615034395644
Running compilation step : cd /tmp/ltsmin16612754615034395644;'/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 457 ms.
Running link step : cd /tmp/ltsmin16612754615034395644;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin16612754615034395644;'/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/stateBased7838376303433274709.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-08 20:54:59] [INFO ] Flatten gal took : 13 ms
[2025-06-08 20:54:59] [INFO ] Flatten gal took : 11 ms
[2025-06-08 20:54:59] [INFO ] Time to serialize gal into /tmp/LTL12835861678097412039.gal : 5 ms
[2025-06-08 20:54:59] [INFO ] Time to serialize properties into /tmp/LTL11375032110683243244.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/LTL12835861678097412039.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7712005672962304206.hoa' '-atoms' '/tmp/LTL11375032110683243244.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G(((F("((pl_survivor_n16>=1)&&(pl_undead_n16>=1))"))U((X("(pl_undead_n26>=1)"))||("((pl_survivor_n63>=1)&&(pl_undead_n63>=1))")))...263
Formula 0 simplified : GF((G!"((pl_survivor_n16>=1)&&(pl_undead_n16>=1))" R (!"((pl_survivor_n63>=1)&&(pl_undead_n63>=1))" & X!"(pl_undead_n26>=1)")) R ("(...245
Detected timeout of ITS tools.
[2025-06-08 20:55:30] [INFO ] Flatten gal took : 10 ms
[2025-06-08 20:55:30] [INFO ] Applying decomposition
[2025-06-08 20:55:30] [INFO ] Flatten gal took : 11 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/graph827718143179948354.txt' '-o' '/tmp/graph827718143179948354.bin' '-w' '/tmp/graph827718143179948354.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph827718143179948354.bin' '-l' '-1' '-v' '-w' '/tmp/graph827718143179948354.weights' '-q' '0' '-e' '0.001'
[2025-06-08 20:55:30] [INFO ] Decomposing Gal with order
[2025-06-08 20:55:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 20:55:30] [INFO ] Removed a total of 118 redundant transitions.
[2025-06-08 20:55:30] [INFO ] Flatten gal took : 57 ms
[2025-06-08 20:55:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-06-08 20:55:30] [INFO ] Time to serialize gal into /tmp/LTL9320912436334728471.gal : 7 ms
[2025-06-08 20:55:30] [INFO ] Time to serialize properties into /tmp/LTL15007890891100011819.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/LTL9320912436334728471.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15007890891100011819.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G(((F("((i1.i2.u15.pl_survivor_n16>=1)&&(i4.u16.pl_undead_n16>=1))"))U((X("(i5.i0.u24.pl_undead_n26>=1)"))||("((i0.i0.u57.pl_surv...345
Formula 0 simplified : GF((G!"((i1.i2.u15.pl_survivor_n16>=1)&&(i4.u16.pl_undead_n16>=1))" R (!"((i0.i0.u57.pl_survivor_n63>=1)&&(i9.i2.u58.pl_undead_n63>=...327
Detected timeout of ITS tools.
Treatment of property ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-05 finished in 282865 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X((X(F(!p1))||G(p0)))) U X((G(p2) U X(G(p1))))))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 384/384 transitions.
Applied a total of 0 rules in 7 ms. Remains 128 /128 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2025-06-08 20:55:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 20:55:45] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-06-08 20:55:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 20:55:45] [INFO ] State equation strengthened by 126 read => feed constraints.
[2025-06-08 20:55:45] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Running 380 sub problems to find dead transitions.
[2025-06-08 20:55:45] [INFO ] Invariant cache hit.
[2025-06-08 20:55:45] [INFO ] State equation strengthened by 126 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (OVERLAPS) 384/512 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 126/254 constraints. Problems are: Problem set: 0 solved, 380 unsolved
(t127 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((t0 0.0)
(t1 0.0)
(t2 0.0)
(t3 0.0)
(t4 0.0)
(t5 0.0)
(t6 0.0)
(t7 0.0)
(t8 0.0)
(t9 0.0)
(t10 0.0)
(t11 0.0)
(t12 0.0)
(t13 0.0)
(t14 0.0)
(t15 0.0)
(t16 0.0)
(t17 0.0)
(t18 0.0)
(t19 0.0)
(t20 0.0)
(t21 0.0)
(t22 0.0)
(t23 0.0)
(t24 0.0)
(t25 0.0)
(t26 0.0)
(t27 0.0)
(t28 0.0)
(t29 0.0)
(t30 0.0)
(t31 0.0)
(t32 0.0)
(t33 0.0)
(t34 0.0)
(t35 0.0)
(t36 0.0)
(t37 0.0)
(t38 0.0)
(t39 0.0)
(t40 0.0)
(t41 0.0)
(t42 0.0)
(t43 0.0)
(t44 0.0)
(t45 0.0)
(t46 0.0)
(t47 0.0)
(t48 0.0)
(t49 0.0)
(t50 0.0)
(t51 0.0)
(t52 0.0)
(t53 0.0)
(t54 0.0)
(t55 0.0)
(t56 0.0)
(t57 0.0)
(t58 0.0)
(t59 0.0)
(t60 0.0)
(t61 0.0)
(t62 0.0)
(t63 0.0)
(t64 0.0)
(t65 0.0)
(t66 0.0)
(t67 0.0)
(t68 0.0)
(t69 0.0)
(t70 0.0)
(t71 0.0)
(t72 0.0)
(t73 0.0)
(t74 0.0)
(t75 0.0)
(t76 0.0)
(t77 0.0)
(t78 0.0)
(t79 0.0)
(t80 0.0)
(t81 0.0)
(t82 0.0)
(t83 0.0)
(t84 0.0)
(t85 0.0)
(t86 0.0)
(t87 0.0)
(t88 0.0)
(t89 0.0)
(t90 0.0)
(t91 0.0)
(t92 0.0)
(t93 0.0)
(t94 0.0)
(t95 0.0)
(t96 0.0)
(t97 0.0)
(t98 0.0)
(t99 0.0)
(t100 0.0)
(t101 0.0)
(t102 0.0)
(t103 0.0)
(t104 0.0)
(t105 0.0)
(t106 0.0)
(t107 0.0)
(t108 0.0)
(t109 0.0)
(t110 0.0)
(t111 0.0)
(t112 0.0)
(t113 0.0)
(t114 0.0)
(t115 0.0)
(t116 0.0)
(t117 0.0)
(t118 0.0)
(t119 0.0)
(t120 0.0)
(t121 0.0)
(t122 0.0)
(t123 0.0)
(t124 0.0)
(t125 0.0)
(t126 0.0)
(t127 0.0timeout
)
(t128 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 512/512 variables, and 254 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30020 ms.
Refiners :[State Equation: 128/128 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 380 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (OVERLAPS) 384/512 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 126/254 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 380/634 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 512/512 variables, and 634 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30018 ms.
Refiners :[State Equation: 128/128 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60069ms problems are : Problem set: 0 solved, 380 unsolved
Search for dead transitions found 0 dead transitions in 60069ms
Finished structural reductions in LTL mode , in 1 iterations and 60267 ms. Remains : 128/128 places, 384/384 transitions.
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), true, (NOT p1), (AND p1 (NOT p2))]
Running random walk in product with property : ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-06
Entered a terminal (fully accepting) state of product in 2996 steps with 0 reset in 7 ms.
FORMULA ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-06 finished in 60509 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 384/384 transitions.
Graph (trivial) has 252 edges and 128 vertex of which 127 / 128 are part of one of the 2 SCC in 1 ms
Free SCC test removed 125 places
Ensure Unique test removed 376 transitions
Reduce isomorphic transitions removed 376 transitions.
Applied a total of 1 rules in 2 ms. Remains 3 /128 variables (removed 125) and now considering 8/384 (removed 376) transitions.
[2025-06-08 20:56:45] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 3 cols
[2025-06-08 20:56:45] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 20:56:45] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-06-08 20:56:45] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
[2025-06-08 20:56:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 20:56:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-08 20:56:45] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 20:56:45] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-08 20:56:45] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
[2025-06-08 20:56:45] [INFO ] Invariant cache hit.
[2025-06-08 20:56:45] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2/9 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/10 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 33 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2/9 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/9 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/10 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 38 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 73ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 74ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3/128 places, 8/384 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 122 ms. Remains : 3/128 places, 8/384 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-08 finished in 167 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))||F(p1))))'
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 384/384 transitions.
Applied a total of 0 rules in 4 ms. Remains 128 /128 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 128 cols
[2025-06-08 20:56:46] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 20:56:46] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-08 20:56:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 20:56:46] [INFO ] State equation strengthened by 126 read => feed constraints.
[2025-06-08 20:56:46] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Running 380 sub problems to find dead transitions.
[2025-06-08 20:56:46] [INFO ] Invariant cache hit.
[2025-06-08 20:56:46] [INFO ] State equation strengthened by 126 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (OVERLAPS) 384/512 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 126/254 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 512/512 variables, and 254 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30014 ms.
Refiners :[State Equation: 128/128 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 380 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (OVERLAPS) 384/512 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 126/254 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 380/634 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 512/512 variables, and 634 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30021 ms.
Refiners :[State Equation: 128/128 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60059ms problems are : Problem set: 0 solved, 380 unsolved
Search for dead transitions found 0 dead transitions in 60060ms
Finished structural reductions in LTL mode , in 1 iterations and 60186 ms. Remains : 128/128 places, 384/384 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-09
Product exploration explored 100000 steps with 1 reset in 156 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-09 finished in 60516 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((X(p0)&&p1))))&&F((F(!p1)||!p0)))))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 384/384 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2025-06-08 20:57:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 20:57:46] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-08 20:57:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 20:57:46] [INFO ] State equation strengthened by 126 read => feed constraints.
[2025-06-08 20:57:46] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Running 380 sub problems to find dead transitions.
[2025-06-08 20:57:46] [INFO ] Invariant cache hit.
[2025-06-08 20:57:46] [INFO ] State equation strengthened by 126 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (OVERLAPS) 384/512 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 126/254 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 512/512 variables, and 254 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30016 ms.
Refiners :[State Equation: 128/128 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 380 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (OVERLAPS) 384/512 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 126/254 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 380/634 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 512/512 variables, and 634 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30021 ms.
Refiners :[State Equation: 128/128 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60059ms problems are : Problem set: 0 solved, 380 unsolved
Search for dead transitions found 0 dead transitions in 60060ms
Finished structural reductions in LTL mode , in 1 iterations and 60181 ms. Remains : 128/128 places, 384/384 transitions.
Stuttering acceptance computed with spot in 226 ms :[true, true, (OR (NOT p0) (NOT p1)), (AND p1 p0), (OR (NOT p1) (NOT p0)), true, (AND p1 (NOT p0))]
Running random walk in product with property : ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-10
Product exploration explored 100000 steps with 102 reset in 203 ms.
Stack based approach found an accepted trace after 18 steps with 2 reset with depth 7 and stack size 7 in 0 ms.
FORMULA ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-10 finished in 60631 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 384/384 transitions.
Graph (trivial) has 252 edges and 128 vertex of which 127 / 128 are part of one of the 2 SCC in 0 ms
Free SCC test removed 125 places
Ensure Unique test removed 376 transitions
Reduce isomorphic transitions removed 376 transitions.
Applied a total of 1 rules in 2 ms. Remains 3 /128 variables (removed 125) and now considering 8/384 (removed 376) transitions.
[2025-06-08 20:58:47] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 3 cols
[2025-06-08 20:58:47] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 20:58:47] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-08 20:58:47] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
[2025-06-08 20:58:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 20:58:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-08 20:58:47] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 20:58:47] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-08 20:58:47] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
[2025-06-08 20:58:47] [INFO ] Invariant cache hit.
[2025-06-08 20:58:47] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2/9 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/10 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 23 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2/9 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/9 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/10 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 31 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 57ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3/128 places, 8/384 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 110 ms. Remains : 3/128 places, 8/384 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-11
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-11 finished in 201 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X((p1&&F(G(p2))))))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 384/384 transitions.
Applied a total of 0 rules in 3 ms. Remains 128 /128 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 128 cols
[2025-06-08 20:58:47] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 20:58:47] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-08 20:58:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 20:58:47] [INFO ] State equation strengthened by 126 read => feed constraints.
[2025-06-08 20:58:47] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Running 380 sub problems to find dead transitions.
[2025-06-08 20:58:47] [INFO ] Invariant cache hit.
[2025-06-08 20:58:47] [INFO ] State equation strengthened by 126 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (OVERLAPS) 384/512 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 126/254 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 512/512 variables, and 254 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30029 ms.
Refiners :[State Equation: 128/128 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 380 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (OVERLAPS) 384/512 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 126/254 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 380/634 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 512/512 variables, and 634 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30017 ms.
Refiners :[State Equation: 128/128 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60067ms problems are : Problem set: 0 solved, 380 unsolved
Search for dead transitions found 0 dead transitions in 60068ms
Finished structural reductions in LTL mode , in 1 iterations and 60190 ms. Remains : 128/128 places, 384/384 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-12
Product exploration explored 100000 steps with 4 reset in 221 ms.
Stack based approach found an accepted trace after 3374 steps with 0 reset with depth 3375 and stack size 3254 in 10 ms.
FORMULA ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-12 finished in 60594 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (p1||(F(p2) U (p3||X(p0))))))'
Support contains 5 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 384/384 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2025-06-08 20:59:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 20:59:47] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-08 20:59:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 20:59:48] [INFO ] State equation strengthened by 126 read => feed constraints.
[2025-06-08 20:59:48] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 380 sub problems to find dead transitions.
[2025-06-08 20:59:48] [INFO ] Invariant cache hit.
[2025-06-08 20:59:48] [INFO ] State equation strengthened by 126 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (OVERLAPS) 384/512 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 126/254 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 512/512 variables, and 254 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30011 ms.
Refiners :[State Equation: 128/128 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 380 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (OVERLAPS) 384/512 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 126/254 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 380/634 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 512/512 variables, and 634 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30021 ms.
Refiners :[State Equation: 128/128 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60058ms problems are : Problem set: 0 solved, 380 unsolved
Search for dead transitions found 0 dead transitions in 60060ms
Finished structural reductions in LTL mode , in 1 iterations and 60179 ms. Remains : 128/128 places, 384/384 transitions.
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-15
Product exploration explored 100000 steps with 155 reset in 191 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 0 ms.
FORMULA ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-15 finished in 60688 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(p0) U (p1||X(p2))) U (!p0&&X(!p3))))))'
[2025-06-08 21:00:48] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1616864179468736314
[2025-06-08 21:00:48] [INFO ] Computing symmetric may disable matrix : 384 transitions.
[2025-06-08 21:00:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 21:00:48] [INFO ] Computing symmetric may enable matrix : 384 transitions.
[2025-06-08 21:00:48] [INFO ] Applying decomposition
[2025-06-08 21:00:48] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 21:00:48] [INFO ] Flatten gal took : 8 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/graph10410192596686694701.txt' '-o' '/tmp/graph10410192596686694701.bin' '-w' '/tmp/graph10410192596686694701.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10410192596686694701.bin' '-l' '-1' '-v' '-w' '/tmp/graph10410192596686694701.weights' '-q' '0' '-e' '0.001'
[2025-06-08 21:00:48] [INFO ] Decomposing Gal with order
[2025-06-08 21:00:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 21:00:48] [INFO ] Removed a total of 112 redundant transitions.
[2025-06-08 21:00:48] [INFO ] Flatten gal took : 20 ms
[2025-06-08 21:00:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-08 21:00:48] [INFO ] Time to serialize gal into /tmp/LTLFireability10395197040819680639.gal : 15 ms
[2025-06-08 21:00:48] [INFO ] Time to serialize properties into /tmp/LTLFireability16318154360060138324.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/LTLFireability10395197040819680639.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16318154360060138324.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...278
Read 1 LTL properties
[2025-06-08 21:00:48] [INFO ] Computing Do-Not-Accords matrix : 384 transitions.
[2025-06-08 21:00:48] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 21:00:48] [INFO ] Built C files in 128ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1616864179468736314
Running compilation step : cd /tmp/ltsmin1616864179468736314;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Checking formula 0 : !((F(G(((F("((i3.i1.u13.pl_survivor_n16>=1)&&(i2.i0.u14.pl_undead_n16>=1))"))U(("((i1.i0.u54.pl_survivor_n63>=1)&&(i11.i1.u55.pl_undea...352
Formula 0 simplified : GF((G!"((i3.i1.u13.pl_survivor_n16>=1)&&(i2.i0.u14.pl_undead_n16>=1))" R (!"((i1.i0.u54.pl_survivor_n63>=1)&&(i11.i1.u55.pl_undead_n...334
Compilation finished in 704 ms.
Running link step : cd /tmp/ltsmin1616864179468736314;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1616864179468736314;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](((<>((LTLAPp0==true)) U ((LTLAPp1==true)||X((LTLAPp2==true)))) U (!(LTLAPp0==true)&&X(!(LTLAPp3==true))))))' '--buchi-type=spotba'
LTSmin run took 55272 ms.
FORMULA ZombiesAndSurvivors-PT-Circular64010010-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 771687 ms.

BK_STOP 1749416505075

--------------------
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="ZombiesAndSurvivors-PT-Circular64010010"
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 ZombiesAndSurvivors-PT-Circular64010010, 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 r254-tall-174931340100556"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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