About the Execution of ITS-Tools for ZombiesAndSurvivors-PT-Heawood381515
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 931217.00 | 0.00 | 0.00 | TFTFFFFFFTFFFFFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r254-tall-174931340200604.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-Heawood381515, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931340200604
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 12K Jun 6 09:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Jun 6 09:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Jun 6 09:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Jun 6 09:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K Jun 6 12:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Jun 6 12:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Jun 6 12:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 12:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 12K Jun 6 09:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Jun 6 09:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 6 09:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Jun 6 09:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Jun 6 12:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Jun 6 12:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 14 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 137K 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-Heawood381515-LTLFireability-00
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-01
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-02
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-03
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-04
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-05
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-06
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-07
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-08
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-09
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-10
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-11
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-12
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-13
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-14
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1749423830167
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-Heawood381515
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-08 23:03:51] [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 23:03:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 23:03:51] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2025-06-08 23:03:51] [INFO ] Transformed 76 places.
[2025-06-08 23:03:51] [INFO ] Transformed 304 transitions.
[2025-06-08 23:03:51] [INFO ] Parsed PT model containing 76 places and 304 transitions and 684 arcs in 151 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-Heawood381515-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 304/304 transitions.
Applied a total of 0 rules in 13 ms. Remains 76 /76 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Running 298 sub problems to find dead transitions.
// Phase 1: matrix 304 rows 76 cols
[2025-06-08 23:03:51] [INFO ] Computed 0 invariants in 9 ms
[2025-06-08 23:03:51] [INFO ] State equation strengthened by 74 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 304/380 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 74/150 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 150 constraints, problems are : Problem set: 0 solved, 298 unsolved in 20054 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 304/380 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 74/150 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 298/448 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 448 constraints, problems are : Problem set: 0 solved, 298 unsolved in 20024 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40210ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 40226ms
[2025-06-08 23:04:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:04:31] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-08 23:04:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:04:32] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-08 23:04:32] [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 298 sub problems to find dead transitions.
[2025-06-08 23:04:32] [INFO ] Invariant cache hit.
[2025-06-08 23:04:32] [INFO ] State equation strengthened by 74 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 304/380 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 74/150 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 150 constraints, problems are : Problem set: 0 solved, 298 unsolved in 30018 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 304/380 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 74/150 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 298/448 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 448 constraints, problems are : Problem set: 0 solved, 298 unsolved in 30016 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60075ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 60076ms
Finished structural reductions in LTL mode , in 1 iterations and 100494 ms. Remains : 76/76 places, 304/304 transitions.
Support contains 25 out of 76 places after structural reductions.
[2025-06-08 23:05:32] [INFO ] Flatten gal took : 42 ms
[2025-06-08 23:05:32] [INFO ] Flatten gal took : 21 ms
[2025-06-08 23:05:32] [INFO ] Input system was already deterministic with 304 transitions.
RANDOM walk for 40034 steps (8 resets) in 442 ms. (90 steps per ms) remains 3/25 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 1/2 properties
[2025-06-08 23:05:32] [INFO ] Invariant cache hit.
[2025-06-08 23:05:32] [INFO ] State equation strengthened by 74 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 28/32 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 72/104 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 96/200 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 17/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 68/268 variables, 16/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/268 variables, 16/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/268 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 60/328 variables, 12/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/328 variables, 12/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/328 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 44/372 variables, 10/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/372 variables, 9/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/372 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/380 variables, 4/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/380 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/380 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/380 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 131 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 28/32 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 72/104 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 96/200 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 17/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 68/268 variables, 16/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/268 variables, 16/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/268 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 60/328 variables, 12/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/328 variables, 12/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/328 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 44/372 variables, 10/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/372 variables, 9/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/372 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 8/380 variables, 4/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/380 variables, 4/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/380 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/380 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 380/380 variables, and 151 constraints, problems are : Problem set: 0 solved, 1 unsolved in 353 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 490ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 4 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 304/304 transitions.
Graph (trivial) has 136 edges and 76 vertex of which 72 / 76 are part of one of the 4 SCC in 1 ms
Free SCC test removed 68 places
Drop transitions (Empty/Sink Transition effects.) removed 168 transitions
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 268 transitions.
Reduce isomorphic (modulo) transitions removed 4 transitions.
Applied a total of 1 rules in 12 ms. Remains 8 /76 variables (removed 68) and now considering 32/304 (removed 272) transitions.
Running 25 sub problems to find dead transitions.
Normalized transition count is 28 out of 32 initially.
// Phase 1: matrix 28 rows 8 cols
[2025-06-08 23:05:33] [INFO ] Computed 0 invariants in 1 ms
[2025-06-08 23:05:33] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 32/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 25 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 0/40 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 14 constraints, problems are : Problem set: 0 solved, 25 unsolved in 112 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 32/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 25/39 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 0/40 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 39 constraints, problems are : Problem set: 0 solved, 25 unsolved in 222 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 340ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 341ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 354 ms. Remains : 8/76 places, 32/304 transitions.
RANDOM walk for 40033 steps (8 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
BEST_FIRST walk for 188 steps (0 resets) in 4 ms. (37 steps per ms) remains 0/1 properties
FORMULA ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 38 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' '!(G(F(p0)))'
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 304/304 transitions.
Graph (trivial) has 148 edges and 76 vertex of which 75 / 76 are part of one of the 2 SCC in 0 ms
Free SCC test removed 73 places
Ensure Unique test removed 292 transitions
Reduce isomorphic transitions removed 292 transitions.
Reduce isomorphic (modulo) transitions removed 2 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 3 transition count 8
Applied a total of 3 rules in 5 ms. Remains 3 /76 variables (removed 73) and now considering 8/304 (removed 296) transitions.
[2025-06-08 23:05:33] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
// Phase 1: matrix 6 rows 3 cols
[2025-06-08 23:05:33] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:05:34] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-08 23:05:34] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2025-06-08 23:05:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:05:34] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 23:05:34] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-08 23:05:34] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2025-06-08 23:05:34] [INFO ] Invariant cache hit.
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, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/9 variables, and 3 constraints, problems are : Problem set: 0 solved, 3 unsolved in 29 ms.
Refiners :[State Equation: 3/3 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, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/9 variables, and 6 constraints, problems are : Problem set: 0 solved, 3 unsolved in 38 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 72ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 72ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3/76 places, 8/304 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 134 ms. Remains : 3/76 places, 8/304 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-01 finished in 365 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)||X(X(X((!p0 U (p1||G(!p0))))))) U p2))'
Support contains 6 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 304/304 transitions.
Applied a total of 0 rules in 12 ms. Remains 76 /76 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Running 298 sub problems to find dead transitions.
// Phase 1: matrix 304 rows 76 cols
[2025-06-08 23:05:34] [INFO ] Computed 0 invariants in 2 ms
[2025-06-08 23:05:34] [INFO ] State equation strengthened by 74 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 304/380 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 74/150 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 150 constraints, problems are : Problem set: 0 solved, 298 unsolved in 20014 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 304/380 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 74/150 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 298/448 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 448 constraints, problems are : Problem set: 0 solved, 298 unsolved in 20020 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40081ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 40082ms
[2025-06-08 23:06:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:06:14] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-08 23:06:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:06:14] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-08 23:06:14] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 298 sub problems to find dead transitions.
[2025-06-08 23:06:14] [INFO ] Invariant cache hit.
[2025-06-08 23:06:14] [INFO ] State equation strengthened by 74 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 304/380 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 74/150 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 150 constraints, problems are : Problem set: 0 solved, 298 unsolved in 30012 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 304/380 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 74/150 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 298/448 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 448 constraints, problems are : Problem set: 0 solved, 298 unsolved in 30015 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60053ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 60054ms
Finished structural reductions in LTL mode , in 1 iterations and 100281 ms. Remains : 76/76 places, 304/304 transitions.
Stuttering acceptance computed with spot in 287 ms :[(NOT p2), (AND p0 (NOT p1)), false, (AND p0 (NOT p1)), (AND p0 (NOT p1)), true, false, false, (NOT p0)]
Running random walk in product with property : ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-04
Product exploration explored 100000 steps with 19989 reset in 292 ms.
Stack based approach found an accepted trace after 17 steps with 3 reset with depth 3 and stack size 3 in 0 ms.
FORMULA ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-04 finished in 100889 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))||G(((F(p0)&&F(!p1))||F(((p2&&X(p3))||G(p3)))))))'
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 304/304 transitions.
Applied a total of 0 rules in 9 ms. Remains 76 /76 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Running 298 sub problems to find dead transitions.
[2025-06-08 23:07:15] [INFO ] Invariant cache hit.
[2025-06-08 23:07:15] [INFO ] State equation strengthened by 74 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 304/380 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 74/150 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 150 constraints, problems are : Problem set: 0 solved, 298 unsolved in 20025 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 304/380 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 74/150 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 298/448 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 448 constraints, problems are : Problem set: 0 solved, 298 unsolved in 20016 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40107ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 40109ms
[2025-06-08 23:07:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:07:55] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-08 23:07:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:07:55] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-08 23:07:55] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Running 298 sub problems to find dead transitions.
[2025-06-08 23:07:55] [INFO ] Invariant cache hit.
[2025-06-08 23:07:55] [INFO ] State equation strengthened by 74 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 304/380 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 74/150 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 150 constraints, problems are : Problem set: 0 solved, 298 unsolved in 30016 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 304/380 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 74/150 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 298/448 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 448 constraints, problems are : Problem set: 0 solved, 298 unsolved in 30013 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60048ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 60050ms
Finished structural reductions in LTL mode , in 1 iterations and 100293 ms. Remains : 76/76 places, 304/304 transitions.
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-05
Product exploration explored 100000 steps with 1 reset in 238 ms.
Product exploration explored 100000 steps with 0 reset in 355 ms.
Computed a total of 0 stabilizing places and 38 stable transitions
Computed a total of 0 stabilizing places and 38 stable transitions
Knowledge obtained : [(AND p0 p3 p2), (X p2), (X p3), (X (NOT (AND (NOT p0) p3 (NOT p2)))), (X (NOT (AND (NOT p0) p3 p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X p0), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 119 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
RANDOM walk for 40018 steps (8 resets) in 185 ms. (215 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 248 ms. (160 steps per ms) remains 1/1 properties
[2025-06-08 23:08:56] [INFO ] Invariant cache hit.
[2025-06-08 23:08:56] [INFO ] State equation strengthened by 74 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/24 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 62/86 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 74/160 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 15/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 66/226 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 14/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 60/286 variables, 12/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/286 variables, 12/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/286 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 58/344 variables, 12/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/344 variables, 11/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/344 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 32/376 variables, 8/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/376 variables, 14/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/376 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 4/380 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/380 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/380 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/380 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 242 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/24 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 62/86 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 74/160 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 66/226 variables, 13/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 14/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/226 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 60/286 variables, 12/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/286 variables, 12/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/286 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 58/344 variables, 12/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/344 variables, 11/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/344 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 32/376 variables, 8/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/376 variables, 14/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/376 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/380 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/380 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/380 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/380 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 380/380 variables, and 151 constraints, problems are : Problem set: 0 solved, 1 unsolved in 323 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 571ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 85 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=85 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [(AND p0 p3 p2), (X p2), (X p3), (X (NOT (AND (NOT p0) p3 (NOT p2)))), (X (NOT (AND (NOT p0) p3 p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X p0), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p3) p0))), (F (NOT (OR (NOT p2) p3 p0))), (F (NOT p0)), (F (NOT (OR p2 p3 p0))), (F (NOT p2)), (F (NOT (OR p2 (NOT p3) p0))), (F (NOT p3))]
Knowledge based reduction with 15 factoid took 374 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 304/304 transitions.
Applied a total of 0 rules in 8 ms. Remains 76 /76 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Running 298 sub problems to find dead transitions.
[2025-06-08 23:08:57] [INFO ] Invariant cache hit.
[2025-06-08 23:08:57] [INFO ] State equation strengthened by 74 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 304/380 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 74/150 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 150 constraints, problems are : Problem set: 0 solved, 298 unsolved in 20012 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 304/380 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 74/150 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 298/448 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 448 constraints, problems are : Problem set: 0 solved, 298 unsolved in 20013 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40052ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 40053ms
[2025-06-08 23:09:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:09:37] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-08 23:09:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:09:38] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-08 23:09:38] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Running 298 sub problems to find dead transitions.
[2025-06-08 23:09:38] [INFO ] Invariant cache hit.
[2025-06-08 23:09:38] [INFO ] State equation strengthened by 74 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 304/380 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 74/150 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 150 constraints, problems are : Problem set: 0 solved, 298 unsolved in 30021 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 304/380 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 74/150 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 298/448 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 448 constraints, problems are : Problem set: 0 solved, 298 unsolved in 30022 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60070ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 60071ms
Finished structural reductions in LTL mode , in 1 iterations and 100257 ms. Remains : 76/76 places, 304/304 transitions.
Computed a total of 0 stabilizing places and 38 stable transitions
Computed a total of 0 stabilizing places and 38 stable transitions
Knowledge obtained : [(AND p2 p3 p0), (X p2), (X p3), (X (NOT (AND (NOT p2) p3 (NOT p0)))), (X (NOT (AND p2 (NOT p3) (NOT p0)))), (X (NOT (AND p2 p3 (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p2) p3 (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND p2 p3 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 103 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
RANDOM walk for 40040 steps (8 resets) in 45 ms. (870 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
[2025-06-08 23:10:38] [INFO ] Invariant cache hit.
[2025-06-08 23:10:38] [INFO ] State equation strengthened by 74 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/24 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 62/86 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 74/160 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 15/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 66/226 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 14/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 60/286 variables, 12/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/286 variables, 12/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/286 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 58/344 variables, 12/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/344 variables, 11/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/344 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 32/376 variables, 8/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/376 variables, 14/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/376 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 4/380 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/380 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/380 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/380 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 320 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/24 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 62/86 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 74/160 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 66/226 variables, 13/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 14/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/226 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 60/286 variables, 12/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/286 variables, 12/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/286 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 58/344 variables, 12/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/344 variables, 11/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/344 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 32/376 variables, 8/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/376 variables, 14/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/376 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/380 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/380 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/380 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/380 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 380/380 variables, and 151 constraints, problems are : Problem set: 0 solved, 1 unsolved in 315 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 656ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 92 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=92 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p2 p3 p0), (X p2), (X p3), (X (NOT (AND (NOT p2) p3 (NOT p0)))), (X (NOT (AND p2 (NOT p3) (NOT p0)))), (X (NOT (AND p2 p3 (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p2) p3 (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND p2 p3 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p3) p0))), (F (NOT (OR (NOT p2) p3 p0))), (F (NOT p0)), (F (NOT (OR p2 p3 p0))), (F (NOT p2)), (F (NOT (OR p2 (NOT p3) p0))), (F (NOT p3))]
Knowledge based reduction with 15 factoid took 341 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 0 reset in 245 ms.
Product exploration explored 100000 steps with 0 reset in 273 ms.
Built C files in :
/tmp/ltsmin16212113013386302173
[2025-06-08 23:10:40] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16212113013386302173
Running compilation step : cd /tmp/ltsmin16212113013386302173;'/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 513 ms.
Running link step : cd /tmp/ltsmin16212113013386302173;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16212113013386302173;'/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/stateBased9206302601947388520.hoa' '--buchi-type=spotba'
LTSmin run took 7922 ms.
FORMULA ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-05 finished in 213897 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 304/304 transitions.
Graph (trivial) has 144 edges and 76 vertex of which 74 / 76 are part of one of the 2 SCC in 1 ms
Free SCC test removed 72 places
Ensure Unique test removed 288 transitions
Reduce isomorphic transitions removed 288 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 4 transition count 14
Applied a total of 3 rules in 4 ms. Remains 4 /76 variables (removed 72) and now considering 14/304 (removed 290) transitions.
Running 6 sub problems to find dead transitions.
[2025-06-08 23:10:49] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
Normalized transition count is 9 out of 13 initially.
// Phase 1: matrix 9 rows 4 cols
[2025-06-08 23:10:49] [INFO ] Computed 0 invariants in 1 ms
[2025-06-08 23:10:49] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 10/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 4/16 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/17 variables, and 6 constraints, problems are : Problem set: 0 solved, 6 unsolved in 51 ms.
Refiners :[State Equation: 4/4 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 10/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 4/16 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/17 variables, and 12 constraints, problems are : Problem set: 0 solved, 6 unsolved in 57 ms.
Refiners :[State Equation: 4/4 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 115ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 115ms
[2025-06-08 23:10:49] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2025-06-08 23:10:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:10:49] [INFO ] Implicit Places using invariants in 13 ms returned []
[2025-06-08 23:10:49] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2025-06-08 23:10:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:10:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-08 23:10:49] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 23:10:49] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-08 23:10:49] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2025-06-08 23:10:49] [INFO ] Invariant cache hit.
[2025-06-08 23:10:49] [INFO ] State equation strengthened by 2 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, 6 unsolved
At refinement iteration 1 (OVERLAPS) 10/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 4/16 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/17 variables, and 6 constraints, problems are : Problem set: 0 solved, 6 unsolved in 46 ms.
Refiners :[State Equation: 4/4 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 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, 6 unsolved
At refinement iteration 1 (OVERLAPS) 10/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 4/16 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/17 variables, and 12 constraints, problems are : Problem set: 0 solved, 6 unsolved in 76 ms.
Refiners :[State Equation: 4/4 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 125ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 125ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/76 places, 14/304 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 293 ms. Remains : 4/76 places, 14/304 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-08 finished in 349 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(G(p0)))))))'
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 304/304 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Running 298 sub problems to find dead transitions.
// Phase 1: matrix 304 rows 76 cols
[2025-06-08 23:10:49] [INFO ] Computed 0 invariants in 3 ms
[2025-06-08 23:10:49] [INFO ] State equation strengthened by 74 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 304/380 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 74/150 constraints. Problems are: Problem set: 0 solved, 298 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 (/ 35.0 36.0))
(t8 0.0)
(t9 (/ 35.0 36.0))
(t10 0.0)
(t11 (/ 35.0 36.0))
(t12 0.0)
(t13 (/ 2.0 9.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 (/ 35.0 36.0))
(t36 0.0)
(t37 (/ 35.0 36.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 (/ 35.0 36.0))
(t58 0.0)
(t59 (/ 35.0 36.0))
(t60 0.0)
(t61 (/ 35.0 36.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 13.0)
(t77 0.0)
(t78 0.0)
(t79 1.0)
(t80 0.0)
(t81 (/ 1.0 2.0))
(t82 0.0)
(t83 0.0)
(t84 7.0)
(t85 0.0)
(t86 0.0)
(t87 1.0)
(t88 2.0)
(t89 (/ 1.0 2.0))
(t90 0.0)
(t91 (/ 1.0 2.0))
(t92 5.0)
(t93 0.0)
(t94 0.0)
(t95 0.0)
(t96 1.0)
(t97 0.0)
(t98 0.0)
(t99 (/ 1.0 2.0))
(t100 (/ 59.0 12.0))
(t101 (/ 1.0 36.0))
(t102 0.0)
(t103 1.0)
(t104 (/ 1.0 2.0))
(t105 0.0)
(t106 (/ 17.0 timeout
36.0)) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 150 constraints, problems are : Problem set: 0 solved, 298 unsolved in 20013 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 304/380 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 74/150 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 298/448 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 448 constraints, problems are : Problem set: 0 solved, 298 unsolved in 20018 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40057ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 40058ms
[2025-06-08 23:11:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:11:29] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-08 23:11:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:11:29] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-08 23:11:29] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Running 298 sub problems to find dead transitions.
[2025-06-08 23:11:29] [INFO ] Invariant cache hit.
[2025-06-08 23:11:29] [INFO ] State equation strengthened by 74 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 304/380 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 74/150 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 150 constraints, problems are : Problem set: 0 solved, 298 unsolved in 30016 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 304/380 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 74/150 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 298/448 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 448 constraints, problems are : Problem set: 0 solved, 298 unsolved in 30028 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60064ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 60065ms
Finished structural reductions in LTL mode , in 1 iterations and 100246 ms. Remains : 76/76 places, 304/304 transitions.
Stuttering acceptance computed with spot in 243 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-10
Entered a terminal (fully accepting) state of product in 334 steps with 0 reset in 5 ms.
FORMULA ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-10 finished in 100511 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (p1||X(F((p1&&X(p2))))))))'
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 304/304 transitions.
Applied a total of 0 rules in 4 ms. Remains 76 /76 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Running 298 sub problems to find dead transitions.
[2025-06-08 23:12:29] [INFO ] Invariant cache hit.
[2025-06-08 23:12:29] [INFO ] State equation strengthened by 74 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 304/380 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 74/150 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 150 constraints, problems are : Problem set: 0 solved, 298 unsolved in 20019 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 304/380 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 74/150 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 298/448 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 448 constraints, problems are : Problem set: 0 solved, 298 unsolved in 20030 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40073ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 40074ms
[2025-06-08 23:13:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:13:10] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-08 23:13:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:13:10] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-08 23:13:10] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Running 298 sub problems to find dead transitions.
[2025-06-08 23:13:10] [INFO ] Invariant cache hit.
[2025-06-08 23:13:10] [INFO ] State equation strengthened by 74 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 304/380 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 74/150 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 150 constraints, problems are : Problem set: 0 solved, 298 unsolved in 30021 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 304/380 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 74/150 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 298/448 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 448 constraints, problems are : Problem set: 0 solved, 298 unsolved in 30015 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60057ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 60058ms
Finished structural reductions in LTL mode , in 1 iterations and 100255 ms. Remains : 76/76 places, 304/304 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p2), (NOT p1), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-11
Product exploration explored 100000 steps with 45 reset in 165 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 17 in 0 ms.
FORMULA ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-11 finished in 100583 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((G(p1)||p0))))'
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 304/304 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Running 298 sub problems to find dead transitions.
[2025-06-08 23:14:10] [INFO ] Invariant cache hit.
[2025-06-08 23:14:10] [INFO ] State equation strengthened by 74 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 304/380 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 74/150 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 150 constraints, problems are : Problem set: 0 solved, 298 unsolved in 20015 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 304/380 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 74/150 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 298/448 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 448 constraints, problems are : Problem set: 0 solved, 298 unsolved in 20021 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40071ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 40071ms
[2025-06-08 23:14:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:14:50] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-08 23:14:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:14:50] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-08 23:14:50] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Running 298 sub problems to find dead transitions.
[2025-06-08 23:14:50] [INFO ] Invariant cache hit.
[2025-06-08 23:14:50] [INFO ] State equation strengthened by 74 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 304/380 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 74/150 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 150 constraints, problems are : Problem set: 0 solved, 298 unsolved in 30012 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 304/380 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 74/150 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 298/448 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 448 constraints, problems are : Problem set: 0 solved, 298 unsolved in 30017 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60051ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 60052ms
Finished structural reductions in LTL mode , in 1 iterations and 100242 ms. Remains : 76/76 places, 304/304 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-12
Entered a terminal (fully accepting) state of product in 140 steps with 0 reset in 0 ms.
FORMULA ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-12 finished in 100381 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 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 304/304 transitions.
Graph (trivial) has 148 edges and 76 vertex of which 75 / 76 are part of one of the 2 SCC in 0 ms
Free SCC test removed 73 places
Ensure Unique test removed 292 transitions
Reduce isomorphic transitions removed 292 transitions.
Reduce isomorphic (modulo) transitions removed 2 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 3 transition count 8
Applied a total of 3 rules in 3 ms. Remains 3 /76 variables (removed 73) and now considering 8/304 (removed 296) transitions.
[2025-06-08 23:15:50] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
// Phase 1: matrix 6 rows 3 cols
[2025-06-08 23:15:50] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:15:50] [INFO ] Implicit Places using invariants in 13 ms returned []
[2025-06-08 23:15:50] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2025-06-08 23:15:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:15:50] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 23:15:50] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-08 23:15:50] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2025-06-08 23:15:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/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, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/9 variables, and 3 constraints, problems are : Problem set: 0 solved, 3 unsolved in 30 ms.
Refiners :[State Equation: 3/3 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, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/9 variables, and 6 constraints, problems are : Problem set: 0 solved, 3 unsolved in 35 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 68ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 68ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3/76 places, 8/304 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 112 ms. Remains : 3/76 places, 8/304 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-13 finished in 155 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) U (p1&&F(!p2)))&&F((G(F(p3))||(!p0&&F(p3))))))'
Support contains 6 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 304/304 transitions.
Graph (trivial) has 128 edges and 76 vertex of which 70 / 76 are part of one of the 6 SCC in 1 ms
Free SCC test removed 64 places
Ensure Unique test removed 234 transitions
Reduce isomorphic transitions removed 234 transitions.
Reduce isomorphic (modulo) transitions removed 2 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 12 transition count 64
Applied a total of 5 rules in 8 ms. Remains 12 /76 variables (removed 64) and now considering 64/304 (removed 240) transitions.
Running 53 sub problems to find dead transitions.
[2025-06-08 23:15:51] [INFO ] Flow matrix only has 57 transitions (discarded 7 similar events)
Normalized transition count is 53 out of 57 initially.
// Phase 1: matrix 53 rows 12 cols
[2025-06-08 23:15:51] [INFO ] Computed 0 invariants in 1 ms
[2025-06-08 23:15:51] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 56/68 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 53 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 0/68 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 68/69 variables, and 20 constraints, problems are : Problem set: 0 solved, 53 unsolved in 265 ms.
Refiners :[State Equation: 12/12 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 56/68 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 53/73 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 0/68 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 68/69 variables, and 73 constraints, problems are : Problem set: 0 solved, 53 unsolved in 872 ms.
Refiners :[State Equation: 12/12 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1145ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 1146ms
[2025-06-08 23:15:52] [INFO ] Flow matrix only has 57 transitions (discarded 7 similar events)
[2025-06-08 23:15:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:15:52] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-08 23:15:52] [INFO ] Flow matrix only has 57 transitions (discarded 7 similar events)
[2025-06-08 23:15:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:15:52] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-08 23:15:52] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 23:15:52] [INFO ] Redundant transitions in 1 ms returned []
Running 53 sub problems to find dead transitions.
[2025-06-08 23:15:52] [INFO ] Flow matrix only has 57 transitions (discarded 7 similar events)
[2025-06-08 23:15:52] [INFO ] Invariant cache hit.
[2025-06-08 23:15:52] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 56/68 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 53 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 0/68 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 68/69 variables, and 20 constraints, problems are : Problem set: 0 solved, 53 unsolved in 250 ms.
Refiners :[State Equation: 12/12 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 56/68 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 53/73 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 0/68 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 68/69 variables, and 73 constraints, problems are : Problem set: 0 solved, 53 unsolved in 928 ms.
Refiners :[State Equation: 12/12 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1187ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 1187ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/76 places, 64/304 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2415 ms. Remains : 12/76 places, 64/304 transitions.
Stuttering acceptance computed with spot in 293 ms :[(OR (NOT p3) (NOT p1) p2), (NOT p0), (OR (NOT p1) p2), (NOT p3), (NOT p3), p2]
Running random walk in product with property : ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-14 finished in 2732 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(X(p0))&&(X(p1) U ((X(p1)&&(p0 U (p2||G(p0))))||X(G(p1))))))))'
Support contains 4 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 304/304 transitions.
Applied a total of 0 rules in 5 ms. Remains 76 /76 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Running 298 sub problems to find dead transitions.
// Phase 1: matrix 304 rows 76 cols
[2025-06-08 23:15:53] [INFO ] Computed 0 invariants in 4 ms
[2025-06-08 23:15:53] [INFO ] State equation strengthened by 74 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 304/380 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 74/150 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 150 constraints, problems are : Problem set: 0 solved, 298 unsolved in 20022 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 304/380 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 74/150 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 298/448 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 448 constraints, problems are : Problem set: 0 solved, 298 unsolved in 20020 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40069ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 40069ms
[2025-06-08 23:16:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:16:33] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-08 23:16:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:16:33] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-08 23:16:34] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Running 298 sub problems to find dead transitions.
[2025-06-08 23:16:34] [INFO ] Invariant cache hit.
[2025-06-08 23:16:34] [INFO ] State equation strengthened by 74 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 304/380 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 74/150 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 150 constraints, problems are : Problem set: 0 solved, 298 unsolved in 30012 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 304/380 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 74/150 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 298/448 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 448 constraints, problems are : Problem set: 0 solved, 298 unsolved in 30010 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60043ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 60044ms
Finished structural reductions in LTL mode , in 1 iterations and 100242 ms. Remains : 76/76 places, 304/304 transitions.
Stuttering acceptance computed with spot in 464 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), false, (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-15
Product exploration explored 100000 steps with 28619 reset in 112 ms.
Product exploration explored 100000 steps with 28592 reset in 121 ms.
Computed a total of 0 stabilizing places and 38 stable transitions
Computed a total of 0 stabilizing places and 38 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1))))]
Knowledge based reduction with 11 factoid took 359 ms. Reduced automaton from 12 states, 43 edges and 3 AP (stutter sensitive) to 12 states, 40 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 563 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), false, (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), false, (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40024 steps (8 resets) in 56 ms. (702 steps per ms) remains 2/11 properties
BEST_FIRST walk for 32205 steps (6 resets) in 134 ms. (238 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR p2 p0))), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 p0 p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 11 factoid took 889 ms. Reduced automaton from 12 states, 40 edges and 3 AP (stutter sensitive) to 12 states, 40 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 431 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), false, (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), false, (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 420 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), false, (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), false, (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 304/304 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Running 298 sub problems to find dead transitions.
[2025-06-08 23:17:37] [INFO ] Invariant cache hit.
[2025-06-08 23:17:37] [INFO ] State equation strengthened by 74 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 304/380 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 74/150 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 150 constraints, problems are : Problem set: 0 solved, 298 unsolved in 20009 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 304/380 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 74/150 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 298/448 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 448 constraints, problems are : Problem set: 0 solved, 298 unsolved in 20016 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40047ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 40048ms
[2025-06-08 23:18:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:18:17] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-08 23:18:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:18:17] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-08 23:18:17] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Running 298 sub problems to find dead transitions.
[2025-06-08 23:18:17] [INFO ] Invariant cache hit.
[2025-06-08 23:18:17] [INFO ] State equation strengthened by 74 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 304/380 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 74/150 constraints. Problems are: Problem set: 0 solved, 298 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 (/ 15.0 16.0))
(t8 0.0)
(t9 (/ 15.0 16.0))
(t10 0.0)
(t11 (/ 15.0 16.0))
(t12 0.0)
(t13 (/ 7.0 16.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 (/ 15.0 16.0))
(t36 0.0)
(t37 (/ 15.0 16.0))
(t38 0.0)
(t39 (/ 15.0 16.0))
(t40 0.0)
(t41 (/ 15.0 16.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 11.0)
(t77 0.0)
(t78 0.0)
(t79 3.0)
(t80 1.0)
(t81 (/ 3.0 2.0))
(t82 0.0)
(t83 0.0)
(t84 9.0)
(t85 0.0)
(t86 0.0)
(t87 3.0)
(t88 1.0)
(t89 (/ 1.0 2.0))
(t90 0.0)
(t91 (/ 1.0 2.0))
(t92 9.0)
(t93 0.0)
(t94 0.0)
(t95 0.0)
(t96 0.0)
(t97 0.0)
(t98 0.0)
(t99 (/ 3.0 2.0))
(t100 (/ 127.0 16.0))
(t101 (/ 1.0 16.0))
(t102 0.0)
(t103 1.0)
(t104 0.0)
(t105 0.0)
(t106 0.0)
(t107 0.0)
(t108 (/ 27.0 4.0))
(t109 0.0)
(t110 0.0)
(t111 (/ 109.0 16.0))
(t112 (/ 17.0 16.0))
(t113 (/ 79.0 32.0))
(t114 0.0)
(t115 0.0)
(t116 (/ 59.0 16.0))
(t117 0.0)
(t118 0.0)
(t119 (/ 31.0 4.0))
(t120 1.0)
(t121 (/ 1.0 2.0))
(t122 0.0)
(t123 (/ 1.0 2.0))
(t124 6.0)
(t125 3.0)
(t126 0.0)
(t127 0.0)
(t128 0.0)
(t129 0.0)
(t130 (/ 15.0 16.0))
(t131 (/ 179.0 32.0))
(t132 6.0)
(t133 2.0)
(t134 0.0)
(t135 0.0)
(t136 0.0)
(t137 (/ 1.0 2.0))
(t138 0.0)
(t139 0.0)
(t140 4.0)
(t141 2.0)
(t142 0.0)
(t143 0.0)
(t144 1.0)
(t145 0.0)
(t146 0.0)
(t147 0.0)
(t148 2.0)
(t149 2.0)
(t150 0.0)
(t151 0.0)
(t152 1.0)
(t153 0.0)
(t154 0.0)
(t155 0.0)
(t156 0.0)
(t157 0.0)
(t158 0.0)
(t159 0.0)
(t160 1.0)
(t161 (/ 1.0 2.0))
(t162 0.0)
(t163 0.0)
(t164 0.0)
(t165 0.0)
(t166 0.0)
(t167 0.0)
(t168 (/ 1.0 2.0))
(t169 (/ 1.0 2.0))
(t170 (/ 1.0 2.0))
(t171 (/ 1.0 2.0))
(t172 0.0)
(t173 0.0)
(t174 2.0)
(t175 2.0)
(t176 0.0)
(t177 (/ 1.0 2.0))
(t178 0.0)
(t179 0.0)
(t180 1.0)
(t181 1.0)
(t182 1.0)
(t183 0.0)
(t184 0.0)
(t185 0.0)
(t186 0.0)
(t187 0.0)
(t188 0.0)
(t189 (/ 1.0 2.0))
(t190 0.0)
(t191 0.0)
(t192 1.0)
(t193 0.0)
(t194 1.0)
(t195 3.0)
(t196 0.0)
(t197 0.0)
(t198 0.0)
(t199 4.0)
(t200 0.0)
(t201 (/ 1.0 2.0))
(t202 0.0)
(t203 0.0)
(t204 (/ 17.0 16.0))
(t205 0.0)
(t206 0.0)
(t207 0.0)
(t208 0.0)
(t209 0.0)
(t210 0.0)
(t211 (/ 31.0 16.0))
(t212 0.0)
(t213 (/ 1.0 2.0))
(t214 0.0)
(t215 (/ 1.0 2.0))
(t216 1.0)
(t217 (/ 15.0 16.0))
(t218 (/ 31.0 16.0))
(t219 0.0)
(t220 0.0)
(t221 0.0)
(t222 0.0)
(t223 0.0)
(t224 0.0)
(t225 (/ 1.0 2.0))
(t226 0.0)
(t227 (/ 1.0 2.0))
(t228 2.0)
(t229 1.0)
(t230 0.0)
(t231 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 150 constraints, problems are : Problem set: 0 solved, 298 unsolved in 30011 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 304/380 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 74/150 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 298/448 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 448 constraints, problems are : Problem set: 0 solved, 298 unsolved in 30025 ms.
Refiners :[State Equation: 76/76 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60056ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 60057ms
Finished structural reductions in LTL mode , in 1 iterations and 100227 ms. Remains : 76/76 places, 304/304 transitions.
Computed a total of 0 stabilizing places and 38 stable transitions
Computed a total of 0 stabilizing places and 38 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0))))]
Knowledge based reduction with 3 factoid took 225 ms. Reduced automaton from 12 states, 40 edges and 3 AP (stutter sensitive) to 12 states, 40 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 436 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), false, (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), false, (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 3/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p2 p0 p1), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR p2 p0))), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 p0 p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 465 ms. Reduced automaton from 12 states, 40 edges and 3 AP (stutter sensitive) to 12 states, 40 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 449 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), false, (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), false, (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 453 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), false, (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), false, (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 537 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), false, (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), false, (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 25000 reset in 115 ms.
Product exploration explored 100000 steps with 25000 reset in 112 ms.
Built C files in :
/tmp/ltsmin18315748779732460985
[2025-06-08 23:19:20] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18315748779732460985
Running compilation step : cd /tmp/ltsmin18315748779732460985;'/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 377 ms.
Running link step : cd /tmp/ltsmin18315748779732460985;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin18315748779732460985;'/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/stateBased1858203354417122766.hoa' '--buchi-type=spotba'
LTSmin run took 112 ms.
FORMULA ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ZombiesAndSurvivors-PT-Heawood381515-LTLFireability-15 finished in 207553 ms.
All properties solved by simple procedures.
Total runtime 930017 ms.
BK_STOP 1749424761384
--------------------
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-Heawood381515"
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-Heawood381515, 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-174931340200604"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ZombiesAndSurvivors-PT-Heawood381515.tgz
mv ZombiesAndSurvivors-PT-Heawood381515 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;