About the Execution of ITS-Tools for DoubleLock-PT-p2s2
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 421150.00 | 0.00 | 0.00 | FFTTFFTFFFFFTFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r072-tall-174860067700556.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 DoubleLock-PT-p2s2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-174860067700556
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 813K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-00
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-01
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-02
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-03
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-04
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-05
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-06
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-07
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-08
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-09
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-10
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-11
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-12
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-13
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-14
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748775572957
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p2s2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-01 10:59:34] [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-01 10:59:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 10:59:34] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2025-06-01 10:59:34] [INFO ] Transformed 184 places.
[2025-06-01 10:59:34] [INFO ] Transformed 1832 transitions.
[2025-06-01 10:59:34] [INFO ] Parsed PT model containing 184 places and 1832 transitions and 7424 arcs in 243 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 36 places in 7 ms
Reduce places removed 36 places and 64 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA DoubleLock-PT-p2s2-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p2s2-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p2s2-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p2s2-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p2s2-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p2s2-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 1768/1768 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 144 transition count 1768
Applied a total of 4 rules in 29 ms. Remains 144 /148 variables (removed 4) and now considering 1768/1768 (removed 0) transitions.
[2025-06-01 10:59:34] [INFO ] Flow matrix only has 1225 transitions (discarded 543 similar events)
// Phase 1: matrix 1225 rows 144 cols
[2025-06-01 10:59:34] [INFO ] Computed 2 invariants in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:59:34] [INFO ] Implicit Places using invariants in 300 ms returned []
[2025-06-01 10:59:34] [INFO ] Flow matrix only has 1225 transitions (discarded 543 similar events)
[2025-06-01 10:59:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:59:35] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 10:59:36] [INFO ] Implicit Places using invariants and state equation in 1140 ms returned []
Implicit Place search using SMT with State Equation took 1478 ms to find 0 implicit places.
Running 1766 sub problems to find dead transitions.
[2025-06-01 10:59:36] [INFO ] Flow matrix only has 1225 transitions (discarded 543 similar events)
[2025-06-01 10:59:36] [INFO ] Invariant cache hit.
[2025-06-01 10:59:36] [INFO ] State equation strengthened by 116 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1766 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1766 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1766 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1225/1369 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 1766 unsolved
SMT process timed out in 31483ms, After SMT, problems are : Problem set: 0 solved, 1766 unsolved
Search for dead transitions found 0 dead transitions in 31504ms
Starting structural reductions in LTL mode, iteration 1 : 144/148 places, 1768/1768 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33043 ms. Remains : 144/148 places, 1768/1768 transitions.
Support contains 48 out of 144 places after structural reductions.
[2025-06-01 11:00:07] [INFO ] Flatten gal took : 123 ms
[2025-06-01 11:00:07] [INFO ] Flatten gal took : 84 ms
[2025-06-01 11:00:08] [INFO ] Input system was already deterministic with 1768 transitions.
RANDOM walk for 40016 steps (403 resets) in 1660 ms. (24 steps per ms) remains 11/26 properties
BEST_FIRST walk for 40004 steps (63 resets) in 226 ms. (176 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (77 resets) in 122 ms. (325 steps per ms) remains 8/11 properties
BEST_FIRST walk for 40003 steps (69 resets) in 98 ms. (404 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40004 steps (80 resets) in 91 ms. (434 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (76 resets) in 90 ms. (439 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (71 resets) in 89 ms. (444 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (72 resets) in 93 ms. (425 steps per ms) remains 6/6 properties
[2025-06-01 11:00:08] [INFO ] Flow matrix only has 1225 transitions (discarded 543 similar events)
[2025-06-01 11:00:08] [INFO ] Invariant cache hit.
[2025-06-01 11:00:08] [INFO ] State equation strengthened by 116 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 44/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 833/891 variables, 58/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/891 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/891 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 449/1340 variables, 57/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1340 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1340 variables, 104/233 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1340 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp24 is UNSAT
At refinement iteration 10 (OVERLAPS) 29/1369 variables, 29/262 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1369 variables, 0/262 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/1369 variables, 0/262 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1369/1369 variables, and 262 constraints, problems are : Problem set: 1 solved, 5 unsolved in 1061 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 46/56 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 774/830 variables, 56/57 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/830 variables, 12/69 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/830 variables, 0/69 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 509/1339 variables, 58/127 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1339 variables, 1/128 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1339 variables, 104/232 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1339 variables, 5/237 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1339 variables, 0/237 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp22 is UNSAT
At refinement iteration 11 (OVERLAPS) 30/1369 variables, 30/267 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1369 variables, 0/267 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1369 variables, 0/267 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1369/1369 variables, and 267 constraints, problems are : Problem set: 3 solved, 3 unsolved in 2535 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3622ms problems are : Problem set: 3 solved, 3 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 6 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 1768/1768 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 144 transition count 1740
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 143 transition count 1708
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 143 transition count 1708
Applied a total of 30 rules in 83 ms. Remains 143 /144 variables (removed 1) and now considering 1708/1768 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 143/144 places, 1708/1768 transitions.
RANDOM walk for 40007 steps (402 resets) in 191 ms. (208 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (68 resets) in 96 ms. (412 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (77 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (66 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
[2025-06-01 11:00:12] [INFO ] Flow matrix only has 1165 transitions (discarded 543 similar events)
// Phase 1: matrix 1165 rows 143 cols
[2025-06-01 11:00:12] [INFO ] Computed 2 invariants in 6 ms
[2025-06-01 11:00:12] [INFO ] State equation strengthened by 116 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 49/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 646/699 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/699 variables, 12/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/699 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 578/1277 variables, 59/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1277 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1277 variables, 104/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1277 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 31/1308 variables, 31/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1308 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1308 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1308/1308 variables, and 261 constraints, problems are : Problem set: 0 solved, 2 unsolved in 445 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 49/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 646/699 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/699 variables, 12/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/699 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 578/1277 variables, 59/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1277 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1277 variables, 104/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1277 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1277 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 31/1308 variables, 31/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1308 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1308 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1308/1308 variables, and 263 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6557 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7025ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 429 ms.
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1708/1708 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 143 transition count 1706
Applied a total of 2 rules in 34 ms. Remains 143 /143 variables (removed 0) and now considering 1706/1708 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 143/143 places, 1706/1708 transitions.
RANDOM walk for 40000 steps (407 resets) in 148 ms. (268 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (70 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (70 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 356755 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :0 out of 2
Probabilistic random walk after 356755 steps, saw 243551 distinct states, run finished after 3006 ms. (steps per millisecond=118 ) properties seen :0
[2025-06-01 11:00:23] [INFO ] Flow matrix only has 1163 transitions (discarded 543 similar events)
// Phase 1: matrix 1163 rows 143 cols
[2025-06-01 11:00:23] [INFO ] Computed 2 invariants in 7 ms
[2025-06-01 11:00:23] [INFO ] State equation strengthened by 116 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 49/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 646/699 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/699 variables, 12/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/699 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 576/1275 variables, 59/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1275 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1275 variables, 104/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1275 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 31/1306 variables, 31/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1306 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1306 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1306/1306 variables, and 261 constraints, problems are : Problem set: 0 solved, 2 unsolved in 440 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 49/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 646/699 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/699 variables, 12/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/699 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 576/1275 variables, 59/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1275 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1275 variables, 104/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1275 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1275 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 31/1306 variables, 31/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1306 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1306 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1306/1306 variables, and 263 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1211 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1675ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 316 ms.
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1706/1706 transitions.
Applied a total of 0 rules in 33 ms. Remains 143 /143 variables (removed 0) and now considering 1706/1706 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 143/143 places, 1706/1706 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1706/1706 transitions.
Applied a total of 0 rules in 31 ms. Remains 143 /143 variables (removed 0) and now considering 1706/1706 (removed 0) transitions.
[2025-06-01 11:00:25] [INFO ] Flow matrix only has 1163 transitions (discarded 543 similar events)
[2025-06-01 11:00:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:00:25] [INFO ] Implicit Places using invariants in 279 ms returned []
[2025-06-01 11:00:25] [INFO ] Flow matrix only has 1163 transitions (discarded 543 similar events)
[2025-06-01 11:00:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:00:25] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 11:00:26] [INFO ] Implicit Places using invariants and state equation in 992 ms returned []
Implicit Place search using SMT with State Equation took 1287 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:00:26] [INFO ] Redundant transitions in 104 ms returned []
Running 1704 sub problems to find dead transitions.
[2025-06-01 11:00:26] [INFO ] Flow matrix only has 1163 transitions (discarded 543 similar events)
[2025-06-01 11:00:26] [INFO ] Invariant cache hit.
[2025-06-01 11:00:26] [INFO ] State equation strengthened by 116 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1704 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1704 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1704 unsolved
At refinement iteration 3 (OVERLAPS) 1163/1306 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1704 unsolved
SMT process timed out in 31102ms, After SMT, problems are : Problem set: 0 solved, 1704 unsolved
Search for dead transitions found 0 dead transitions in 31106ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32542 ms. Remains : 143/143 places, 1706/1706 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 543 transitions
Reduce isomorphic transitions removed 543 transitions.
Iterating post reduction 0 with 543 rules applied. Total rules applied 543 place count 143 transition count 1163
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 543 place count 143 transition count 1155
Deduced a syphon composed of 8 places in 6 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 559 place count 135 transition count 1155
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 565 place count 132 transition count 1152
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 566 place count 131 transition count 1120
Iterating global reduction 1 with 1 rules applied. Total rules applied 567 place count 131 transition count 1120
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 569 place count 131 transition count 1118
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 571 place count 129 transition count 1118
Applied a total of 571 rules in 75 ms. Remains 129 /143 variables (removed 14) and now considering 1118/1706 (removed 588) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1118 rows 129 cols
[2025-06-01 11:00:57] [INFO ] Computed 2 invariants in 7 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 11:00:58] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 11:00:58] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:00:58] [INFO ] After 219ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
TRAPS : Iteration 0
[2025-06-01 11:00:58] [INFO ] After 262ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
[2025-06-01 11:00:58] [INFO ] After 336ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 11:00:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 11:00:58] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:00:58] [INFO ] After 214ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-06-01 11:00:58] [INFO ] After 300ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-01 11:00:58] [INFO ] After 391ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 823 ms.
FORMULA DoubleLock-PT-p2s2-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 9 simplifications.
Computed a total of 8 stabilizing places and 416 stable transitions
FORMULA DoubleLock-PT-p2s2-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p2s2-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 1768/1768 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 143 transition count 1736
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 143 transition count 1736
Applied a total of 2 rules in 47 ms. Remains 143 /144 variables (removed 1) and now considering 1736/1768 (removed 32) transitions.
[2025-06-01 11:00:59] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
// Phase 1: matrix 1193 rows 143 cols
[2025-06-01 11:00:59] [INFO ] Computed 2 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:00:59] [INFO ] Implicit Places using invariants in 131 ms returned []
[2025-06-01 11:00:59] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2025-06-01 11:00:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:00:59] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 11:01:00] [INFO ] Implicit Places using invariants and state equation in 936 ms returned []
Implicit Place search using SMT with State Equation took 1070 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:01:00] [INFO ] Redundant transitions in 93 ms returned []
Running 1734 sub problems to find dead transitions.
[2025-06-01 11:01:00] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2025-06-01 11:01:00] [INFO ] Invariant cache hit.
[2025-06-01 11:01:00] [INFO ] State equation strengthened by 116 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1193/1336 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
SMT process timed out in 31187ms, After SMT, problems are : Problem set: 0 solved, 1734 unsolved
Search for dead transitions found 0 dead transitions in 31191ms
Starting structural reductions in SI_LTL mode, iteration 1 : 143/144 places, 1736/1768 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32412 ms. Remains : 143/144 places, 1736/1768 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0)]
Running random walk in product with property : DoubleLock-PT-p2s2-LTLFireability-00
Stuttering criterion allowed to conclude after 73 steps with 0 reset in 4 ms.
FORMULA DoubleLock-PT-p2s2-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p2s2-LTLFireability-00 finished in 32621 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)||X((X((!p1||X(!p2))) U ((!p3&&X((!p1||X(!p2))))||X(G((!p1||X(!p2)))))))))))'
Support contains 6 out of 144 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 1768/1768 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 143 transition count 1736
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 143 transition count 1736
Applied a total of 2 rules in 9 ms. Remains 143 /144 variables (removed 1) and now considering 1736/1768 (removed 32) transitions.
[2025-06-01 11:01:31] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2025-06-01 11:01:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:01:31] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-06-01 11:01:31] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2025-06-01 11:01:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:01:32] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 11:01:32] [INFO ] Implicit Places using invariants and state equation in 915 ms returned []
Implicit Place search using SMT with State Equation took 1042 ms to find 0 implicit places.
Running 1734 sub problems to find dead transitions.
[2025-06-01 11:01:32] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2025-06-01 11:01:32] [INFO ] Invariant cache hit.
[2025-06-01 11:01:32] [INFO ] State equation strengthened by 116 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 3 (OVERLAPS) 1193/1336 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
SMT process timed out in 31202ms, After SMT, problems are : Problem set: 0 solved, 1734 unsolved
Search for dead transitions found 0 dead transitions in 31210ms
Starting structural reductions in LTL mode, iteration 1 : 143/144 places, 1736/1768 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32270 ms. Remains : 143/144 places, 1736/1768 transitions.
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2)]
Running random walk in product with property : DoubleLock-PT-p2s2-LTLFireability-02
Product exploration explored 100000 steps with 1593 reset in 466 ms.
Product exploration explored 100000 steps with 1609 reset in 398 ms.
Computed a total of 8 stabilizing places and 416 stable transitions
Computed a total of 8 stabilizing places and 416 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 155 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 97 ms :[(AND p2 (NOT p0) p1), (AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2)]
RANDOM walk for 40008 steps (402 resets) in 229 ms. (173 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (65 resets) in 190 ms. (209 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (68 resets) in 107 ms. (370 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (71 resets) in 86 ms. (459 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (68 resets) in 85 ms. (465 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (67 resets) in 89 ms. (444 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40004 steps (70 resets) in 80 ms. (493 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (76 resets) in 75 ms. (526 steps per ms) remains 5/5 properties
[2025-06-01 11:02:05] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2025-06-01 11:02:05] [INFO ] Invariant cache hit.
[2025-06-01 11:02:05] [INFO ] State equation strengthened by 116 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 49/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 716/771 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/771 variables, 12/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/771 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 535/1306 variables, 58/126 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1306 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1306 variables, 104/231 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1306 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf2 is UNSAT
Problem apf3 is UNSAT
Problem apf5 is UNSAT
Problem apf6 is UNSAT
At refinement iteration 10 (OVERLAPS) 30/1336 variables, 30/261 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1336 variables, 0/261 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1336 variables, 0/261 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1336/1336 variables, and 261 constraints, problems are : Problem set: 4 solved, 1 unsolved in 562 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/51 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 588/639 variables, 51/52 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/639 variables, 12/64 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/639 variables, 0/64 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 641/1280 variables, 45/109 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1280 variables, 38/147 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1280 variables, 1/148 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1280 variables, 0/148 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 56/1336 variables, 47/195 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1336 variables, 1/196 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1336 variables, 66/262 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1336 variables, 0/262 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1336 variables, 0/262 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1336/1336 variables, and 262 constraints, problems are : Problem set: 4 solved, 1 unsolved in 684 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1273ms problems are : Problem set: 4 solved, 1 unsolved
Parikh walk visited 0 properties in 91 ms.
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1736/1736 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 143 transition count 1704
Applied a total of 32 rules in 23 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1736 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 143/143 places, 1704/1736 transitions.
RANDOM walk for 40012 steps (399 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (83 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 477648 steps, run timeout after 3001 ms. (steps per millisecond=159 ) properties seen :0 out of 1
Probabilistic random walk after 477648 steps, saw 324448 distinct states, run finished after 3001 ms. (steps per millisecond=159 ) properties seen :0
[2025-06-01 11:02:10] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2025-06-01 11:02:10] [INFO ] Computed 3 invariants in 19 ms
[2025-06-01 11:02:10] [INFO ] State equation strengthened by 116 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 113/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1144/1259 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1259 variables, 44/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1259 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 45/1304 variables, 28/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1304 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1304 variables, 72/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1304 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1304 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1304/1304 variables, and 262 constraints, problems are : Problem set: 0 solved, 1 unsolved in 370 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 113/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1144/1259 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1259 variables, 44/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1259 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 45/1304 variables, 28/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1304 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1304 variables, 72/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1304 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:02:10] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1304 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1304 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1304 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1304/1304 variables, and 264 constraints, problems are : Problem set: 0 solved, 1 unsolved in 659 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1060ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 21 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 143/143 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 20 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2025-06-01 11:02:11] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2025-06-01 11:02:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:02:11] [INFO ] Implicit Places using invariants in 219 ms returned []
[2025-06-01 11:02:11] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2025-06-01 11:02:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:02:11] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 11:02:12] [INFO ] Implicit Places using invariants and state equation in 888 ms returned []
Implicit Place search using SMT with State Equation took 1125 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:02:12] [INFO ] Redundant transitions in 29 ms returned []
Running 1702 sub problems to find dead transitions.
[2025-06-01 11:02:12] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2025-06-01 11:02:12] [INFO ] Invariant cache hit.
[2025-06-01 11:02:12] [INFO ] State equation strengthened by 116 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1702 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:02:25] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 5 ms to minimize.
Problem TDEAD1096 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:02:25] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 6 ms to minimize.
Problem TDEAD1097 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1403 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1427 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1451 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1460 is UNSAT
Problem TDEAD1465 is UNSAT
Problem TDEAD1466 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1515 is UNSAT
Problem TDEAD1520 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1527 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1536 is UNSAT
Problem TDEAD1546 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1555 is UNSAT
Problem TDEAD1556 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1596 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1603 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 2/5 constraints. Problems are: Problem set: 168 solved, 1534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/5 constraints. Problems are: Problem set: 168 solved, 1534 unsolved
At refinement iteration 3 (OVERLAPS) 1161/1304 variables, 143/148 constraints. Problems are: Problem set: 168 solved, 1534 unsolved
SMT process timed out in 31208ms, After SMT, problems are : Problem set: 168 solved, 1534 unsolved
Search for dead transitions found 168 dead transitions in 31212ms
Found 168 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 168 transitions
Dead transitions reduction (with SMT) removed 168 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 143/143 places, 1536/1704 transitions.
Applied a total of 0 rules in 19 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:02:43] [INFO ] Redundant transitions in 23 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 32457 ms. Remains : 143/143 places, 1536/1704 transitions.
RANDOM walk for 40000 steps (404 resets) in 108 ms. (366 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (76 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 534185 steps, run timeout after 3001 ms. (steps per millisecond=178 ) properties seen :0 out of 1
Probabilistic random walk after 534185 steps, saw 362282 distinct states, run finished after 3001 ms. (steps per millisecond=178 ) properties seen :0
[2025-06-01 11:02:46] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
// Phase 1: matrix 1021 rows 143 cols
[2025-06-01 11:02:46] [INFO ] Computed 3 invariants in 10 ms
[2025-06-01 11:02:46] [INFO ] State equation strengthened by 112 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 113/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1004/1119 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1119 variables, 40/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1119 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 45/1164 variables, 28/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1164 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1164 variables, 72/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 340 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 113/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1004/1119 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1119 variables, 40/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1119 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 45/1164 variables, 28/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1164 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1164 variables, 72/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1164 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:02:47] [INFO ] Deduced a trap composed of 61 places in 106 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1164 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1164 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 260 constraints, problems are : Problem set: 0 solved, 1 unsolved in 570 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 930ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 17 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 143/143 places, 1536/1536 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 17 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
[2025-06-01 11:02:47] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-06-01 11:02:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:02:47] [INFO ] Implicit Places using invariants in 234 ms returned []
[2025-06-01 11:02:47] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-06-01 11:02:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:02:48] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-01 11:02:48] [INFO ] Implicit Places using invariants and state equation in 975 ms returned []
Implicit Place search using SMT with State Equation took 1221 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:02:48] [INFO ] Redundant transitions in 25 ms returned []
Running 1534 sub problems to find dead transitions.
[2025-06-01 11:02:48] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-06-01 11:02:48] [INFO ] Invariant cache hit.
[2025-06-01 11:02:48] [INFO ] State equation strengthened by 112 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1534 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1164 variables, 1534/1792 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 1792 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61093ms problems are : Problem set: 0 solved, 1534 unsolved
Search for dead transitions found 0 dead transitions in 61096ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62366 ms. Remains : 143/143 places, 1536/1536 transitions.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p1))), (G (OR p2 p0 (NOT p1))), (G (OR (NOT p2) p0 p1)), (G (OR p0 (NOT p1))), (G (OR (NOT p2) p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p2), (F (NOT (OR p2 p0 p1))), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 23 factoid took 21 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleLock-PT-p2s2-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleLock-PT-p2s2-LTLFireability-02 finished in 138374 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(p1))))||p0))))'
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 1768/1768 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 143 transition count 1736
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 143 transition count 1736
Applied a total of 2 rules in 11 ms. Remains 143 /144 variables (removed 1) and now considering 1736/1768 (removed 32) transitions.
[2025-06-01 11:03:50] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
// Phase 1: matrix 1193 rows 143 cols
[2025-06-01 11:03:50] [INFO ] Computed 2 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:03:50] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-06-01 11:03:50] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2025-06-01 11:03:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:03:50] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 11:03:51] [INFO ] Implicit Places using invariants and state equation in 950 ms returned []
Implicit Place search using SMT with State Equation took 1075 ms to find 0 implicit places.
Running 1734 sub problems to find dead transitions.
[2025-06-01 11:03:51] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2025-06-01 11:03:51] [INFO ] Invariant cache hit.
[2025-06-01 11:03:51] [INFO ] State equation strengthened by 116 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 3 (OVERLAPS) 1193/1336 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
SMT process timed out in 31114ms, After SMT, problems are : Problem set: 0 solved, 1734 unsolved
Search for dead transitions found 0 dead transitions in 31119ms
Starting structural reductions in LTL mode, iteration 1 : 143/144 places, 1736/1768 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32214 ms. Remains : 143/144 places, 1736/1768 transitions.
Stuttering acceptance computed with spot in 243 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DoubleLock-PT-p2s2-LTLFireability-03
Product exploration explored 100000 steps with 33333 reset in 268 ms.
Product exploration explored 100000 steps with 33333 reset in 252 ms.
Computed a total of 8 stabilizing places and 416 stable transitions
Computed a total of 8 stabilizing places and 416 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 14 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleLock-PT-p2s2-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleLock-PT-p2s2-LTLFireability-03 finished in 33021 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(G(p0)) U p1) U X(p2))))'
Support contains 6 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 1768/1768 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 143 transition count 1736
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 143 transition count 1736
Applied a total of 2 rules in 12 ms. Remains 143 /144 variables (removed 1) and now considering 1736/1768 (removed 32) transitions.
[2025-06-01 11:04:23] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2025-06-01 11:04:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:04:23] [INFO ] Implicit Places using invariants in 113 ms returned []
[2025-06-01 11:04:23] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2025-06-01 11:04:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:04:23] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 11:04:24] [INFO ] Implicit Places using invariants and state equation in 940 ms returned []
Implicit Place search using SMT with State Equation took 1055 ms to find 0 implicit places.
Running 1734 sub problems to find dead transitions.
[2025-06-01 11:04:24] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2025-06-01 11:04:24] [INFO ] Invariant cache hit.
[2025-06-01 11:04:24] [INFO ] State equation strengthened by 116 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1193/1336 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
SMT process timed out in 31167ms, After SMT, problems are : Problem set: 0 solved, 1734 unsolved
Search for dead transitions found 0 dead transitions in 31172ms
Starting structural reductions in LTL mode, iteration 1 : 143/144 places, 1736/1768 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32247 ms. Remains : 143/144 places, 1736/1768 transitions.
Stuttering acceptance computed with spot in 251 ms :[(NOT p2), (NOT p2), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleLock-PT-p2s2-LTLFireability-05
Stuttering criterion allowed to conclude after 54 steps with 0 reset in 1 ms.
FORMULA DoubleLock-PT-p2s2-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p2s2-LTLFireability-05 finished in 32522 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 1768/1768 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 143 transition count 1736
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 143 transition count 1736
Applied a total of 2 rules in 30 ms. Remains 143 /144 variables (removed 1) and now considering 1736/1768 (removed 32) transitions.
[2025-06-01 11:04:55] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2025-06-01 11:04:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:04:55] [INFO ] Implicit Places using invariants in 120 ms returned []
[2025-06-01 11:04:55] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2025-06-01 11:04:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:04:55] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 11:04:56] [INFO ] Implicit Places using invariants and state equation in 944 ms returned []
Implicit Place search using SMT with State Equation took 1080 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:04:56] [INFO ] Redundant transitions in 28 ms returned []
Running 1734 sub problems to find dead transitions.
[2025-06-01 11:04:56] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2025-06-01 11:04:56] [INFO ] Invariant cache hit.
[2025-06-01 11:04:56] [INFO ] State equation strengthened by 116 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 3 (OVERLAPS) 1193/1336 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
SMT process timed out in 31167ms, After SMT, problems are : Problem set: 0 solved, 1734 unsolved
Search for dead transitions found 0 dead transitions in 31170ms
Starting structural reductions in SI_LTL mode, iteration 1 : 143/144 places, 1736/1768 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32327 ms. Remains : 143/144 places, 1736/1768 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleLock-PT-p2s2-LTLFireability-06
Product exploration explored 100000 steps with 1579 reset in 313 ms.
Product exploration explored 100000 steps with 1580 reset in 347 ms.
Computed a total of 8 stabilizing places and 416 stable transitions
Computed a total of 8 stabilizing places and 416 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 116 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40005 steps (411 resets) in 138 ms. (287 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (59 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
[2025-06-01 11:05:28] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2025-06-01 11:05:28] [INFO ] Invariant cache hit.
[2025-06-01 11:05:28] [INFO ] State equation strengthened by 116 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) 11/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 409/424 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/424 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/424 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 1332/1336 variables, and 146 constraints, problems are : Problem set: 1 solved, 0 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 139/143 constraints, ReadFeed: 6/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 327ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 15 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleLock-PT-p2s2-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleLock-PT-p2s2-LTLFireability-06 finished in 33744 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0))) U p1))'
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 1768/1768 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 143 transition count 1736
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 143 transition count 1736
Applied a total of 2 rules in 9 ms. Remains 143 /144 variables (removed 1) and now considering 1736/1768 (removed 32) transitions.
[2025-06-01 11:05:29] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2025-06-01 11:05:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:05:29] [INFO ] Implicit Places using invariants in 122 ms returned []
[2025-06-01 11:05:29] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2025-06-01 11:05:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:05:29] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 11:05:30] [INFO ] Implicit Places using invariants and state equation in 969 ms returned []
Implicit Place search using SMT with State Equation took 1093 ms to find 0 implicit places.
Running 1734 sub problems to find dead transitions.
[2025-06-01 11:05:30] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2025-06-01 11:05:30] [INFO ] Invariant cache hit.
[2025-06-01 11:05:30] [INFO ] State equation strengthened by 116 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 3 (OVERLAPS) 1193/1336 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
SMT process timed out in 31057ms, After SMT, problems are : Problem set: 0 solved, 1734 unsolved
Search for dead transitions found 0 dead transitions in 31062ms
Starting structural reductions in LTL mode, iteration 1 : 143/144 places, 1736/1768 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32173 ms. Remains : 143/144 places, 1736/1768 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : DoubleLock-PT-p2s2-LTLFireability-09
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA DoubleLock-PT-p2s2-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p2s2-LTLFireability-09 finished in 32307 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))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 1768/1768 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 143 transition count 1736
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 143 transition count 1736
Applied a total of 2 rules in 28 ms. Remains 143 /144 variables (removed 1) and now considering 1736/1768 (removed 32) transitions.
[2025-06-01 11:06:01] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2025-06-01 11:06:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:06:01] [INFO ] Implicit Places using invariants in 129 ms returned []
[2025-06-01 11:06:01] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2025-06-01 11:06:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:06:02] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 11:06:02] [INFO ] Implicit Places using invariants and state equation in 944 ms returned []
Implicit Place search using SMT with State Equation took 1075 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:06:02] [INFO ] Redundant transitions in 30 ms returned []
Running 1734 sub problems to find dead transitions.
[2025-06-01 11:06:02] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2025-06-01 11:06:02] [INFO ] Invariant cache hit.
[2025-06-01 11:06:02] [INFO ] State equation strengthened by 116 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 3 (OVERLAPS) 1193/1336 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
SMT process timed out in 31160ms, After SMT, problems are : Problem set: 0 solved, 1734 unsolved
Search for dead transitions found 0 dead transitions in 31162ms
Starting structural reductions in SI_LTL mode, iteration 1 : 143/144 places, 1736/1768 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32308 ms. Remains : 143/144 places, 1736/1768 transitions.
Stuttering acceptance computed with spot in 40 ms :[true, p0]
Running random walk in product with property : DoubleLock-PT-p2s2-LTLFireability-15
Entered a terminal (fully accepting) state of product in 3962 steps with 61 reset in 21 ms.
FORMULA DoubleLock-PT-p2s2-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p2s2-LTLFireability-15 finished in 32382 ms.
All properties solved by simple procedures.
Total runtime 419923 ms.
BK_STOP 1748775994107
--------------------
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="DoubleLock-PT-p2s2"
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 DoubleLock-PT-p2s2, 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 r072-tall-174860067700556"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleLock-PT-p2s2.tgz
mv DoubleLock-PT-p2s2 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 ;