About the Execution of ITS-Tools for Dekker-PT-050
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 309720.00 | 0.00 | 0.00 | TFTFFFTFFFFTTFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r058-smll-174854063700195.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 Dekker-PT-050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854063700195
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K 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.8K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.5M 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 Dekker-PT-050-LTLCardinality-00
FORMULA_NAME Dekker-PT-050-LTLCardinality-01
FORMULA_NAME Dekker-PT-050-LTLCardinality-02
FORMULA_NAME Dekker-PT-050-LTLCardinality-03
FORMULA_NAME Dekker-PT-050-LTLCardinality-04
FORMULA_NAME Dekker-PT-050-LTLCardinality-05
FORMULA_NAME Dekker-PT-050-LTLCardinality-06
FORMULA_NAME Dekker-PT-050-LTLCardinality-07
FORMULA_NAME Dekker-PT-050-LTLCardinality-08
FORMULA_NAME Dekker-PT-050-LTLCardinality-09
FORMULA_NAME Dekker-PT-050-LTLCardinality-10
FORMULA_NAME Dekker-PT-050-LTLCardinality-11
FORMULA_NAME Dekker-PT-050-LTLCardinality-12
FORMULA_NAME Dekker-PT-050-LTLCardinality-13
FORMULA_NAME Dekker-PT-050-LTLCardinality-14
FORMULA_NAME Dekker-PT-050-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748641603802
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-30 21:46:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 21:46:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 21:46:47] [INFO ] Load time of PNML (sax parser for PT used): 508 ms
[2025-05-30 21:46:47] [INFO ] Transformed 250 places.
[2025-05-30 21:46:47] [INFO ] Transformed 2600 transitions.
[2025-05-30 21:46:47] [INFO ] Found NUPN structural information;
[2025-05-30 21:46:47] [INFO ] Parsed PT model containing 250 places and 2600 transitions and 20100 arcs in 749 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA Dekker-PT-050-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 137 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2025-05-30 21:46:47] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2025-05-30 21:46:47] [INFO ] Computed 150 invariants in 36 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:46:50] [INFO ] Implicit Places using invariants in 2576 ms returned [100, 103, 106, 109, 112, 115, 118, 124, 127, 130, 133, 136, 139, 142, 148, 151, 154, 157, 160, 163, 166, 169, 172, 175, 178, 181, 184, 187, 190, 193, 196, 199, 202, 205, 208, 211, 217, 220, 223, 226, 229, 232, 235, 238, 241, 244, 247]
Discarding 47 places :
Implicit Place search using SMT only with invariants took 2637 ms to find 47 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 203/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 101 ms. Remains 203 /203 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2901 ms. Remains : 203/250 places, 2600/2600 transitions.
Support contains 15 out of 203 places after structural reductions.
[2025-05-30 21:46:51] [INFO ] Flatten gal took : 360 ms
[2025-05-30 21:46:51] [INFO ] Flatten gal took : 272 ms
[2025-05-30 21:46:51] [INFO ] Input system was already deterministic with 2600 transitions.
Reduction of identical properties reduced properties to check from 12 to 10
RANDOM walk for 40000 steps (8 resets) in 2595 ms. (15 steps per ms) remains 3/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 283 ms. (140 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 2/3 properties
[2025-05-30 21:46:52] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 203 cols
[2025-05-30 21:46:52] [INFO ] Computed 103 invariants in 8 ms
[2025-05-30 21:46:53] [INFO ] State equation strengthened by 50 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, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 7/11 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:46:53] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 5/16 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/17 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/17 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/17 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 16/33 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/33 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 92/125 variables, 50/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/125 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 232/357 variables, 140/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/357 variables, 140/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/357 variables, 44/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/357 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 46/403 variables, 48/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/403 variables, 46/512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/403 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/403 variables, 46/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/403 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/403 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 560 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1308 ms.
Refiners :[Domain max(s): 203/203 constraints, Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 203/203 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 7/11 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 5/16 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/17 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/17 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/17 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 16/33 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/33 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 92/125 variables, 50/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/125 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 232/357 variables, 140/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/357 variables, 140/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/357 variables, 44/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/357 variables, 2/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:46:55] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 7 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/357 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:46:55] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 7 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/357 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:46:55] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:46:55] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:46:55] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 5 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/357 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/357 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 46/403 variables, 48/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/403 variables, 46/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/403 variables, 2/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/403 variables, 46/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:46:55] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:46:56] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:46:56] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 3 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/403 variables, 3/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:46:56] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:46:56] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 2 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/403 variables, 2/572 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/403 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:46:56] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 3 ms to minimize.
At refinement iteration 31 (OVERLAPS) 0/403 variables, 1/573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/403 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:46:56] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 6 ms to minimize.
At refinement iteration 33 (OVERLAPS) 0/403 variables, 1/574 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:46:56] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:46:57] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 5 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/403 variables, 2/576 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/403 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:46:57] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:46:57] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 5 ms to minimize.
At refinement iteration 36 (OVERLAPS) 0/403 variables, 2/578 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/403 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:46:57] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:46:57] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 4 ms to minimize.
At refinement iteration 38 (OVERLAPS) 0/403 variables, 2/580 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:46:57] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 4 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/403 variables, 1/581 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:46:58] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 2 ms to minimize.
At refinement iteration 40 (INCLUDED_ONLY) 0/403 variables, 1/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:46:58] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 3 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/403 variables, 1/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/403 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (OVERLAPS) 0/403 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/403 variables, and 583 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4042 ms.
Refiners :[Domain max(s): 203/203 constraints, Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 203/203 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5434ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 661 ms.
Support contains 4 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2600/2600 transitions.
Applied a total of 0 rules in 162 ms. Remains 203 /203 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 203/203 places, 2600/2600 transitions.
RANDOM walk for 40000 steps (8 resets) in 1146 ms. (34 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 274992 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :0 out of 2
Probabilistic random walk after 274992 steps, saw 226617 distinct states, run finished after 3013 ms. (steps per millisecond=91 ) properties seen :0
[2025-05-30 21:47:02] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2025-05-30 21:47:02] [INFO ] Invariant cache hit.
[2025-05-30 21:47:02] [INFO ] State equation strengthened by 50 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, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 7/11 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:02] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 5/16 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/17 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/17 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/17 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 16/33 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/33 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 92/125 variables, 50/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/125 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 232/357 variables, 140/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/357 variables, 140/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/357 variables, 44/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/357 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 46/403 variables, 48/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/403 variables, 46/512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/403 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/403 variables, 46/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/403 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/403 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 560 constraints, problems are : Problem set: 0 solved, 2 unsolved in 893 ms.
Refiners :[Domain max(s): 203/203 constraints, Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 203/203 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 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, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 7/11 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 5/16 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/17 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/17 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/17 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 16/33 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/33 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 92/125 variables, 50/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/125 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 232/357 variables, 140/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/357 variables, 140/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/357 variables, 44/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/357 variables, 2/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:04] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:04] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 8 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/357 variables, 2/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:04] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:04] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:04] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:04] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:05] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:05] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:05] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 6 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/357 variables, 7/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:05] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:05] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/357 variables, 2/431 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:05] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:05] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/357 variables, 2/433 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:05] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 5 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/357 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:05] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:06] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:06] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:06] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 3 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/357 variables, 4/438 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:06] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/357 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:06] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:06] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:06] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 3 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/357 variables, 3/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/357 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 46/403 variables, 48/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/403 variables, 46/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/403 variables, 2/538 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/403 variables, 46/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:06] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:06] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 3 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/403 variables, 2/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/403 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 0/403 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/403 variables, and 586 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3539 ms.
Refiners :[Domain max(s): 203/203 constraints, Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 203/203 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4476ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 490 ms.
Support contains 4 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2600/2600 transitions.
Applied a total of 0 rules in 132 ms. Remains 203 /203 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 203/203 places, 2600/2600 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2600/2600 transitions.
Applied a total of 0 rules in 231 ms. Remains 203 /203 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2025-05-30 21:47:08] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2025-05-30 21:47:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:47:09] [INFO ] Implicit Places using invariants in 937 ms returned [114, 178]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 946 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 201/203 places, 2600/2600 transitions.
Applied a total of 0 rules in 125 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1303 ms. Remains : 201/203 places, 2600/2600 transitions.
RANDOM walk for 40000 steps (8 resets) in 1431 ms. (27 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 260610 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :0 out of 2
Probabilistic random walk after 260610 steps, saw 215662 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
[2025-05-30 21:47:12] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2025-05-30 21:47:12] [INFO ] Computed 101 invariants in 4 ms
[2025-05-30 21:47:12] [INFO ] State equation strengthened by 50 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, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 7/11 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:12] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 5/16 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/17 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/17 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/17 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 16/33 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/33 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 92/125 variables, 50/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/125 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 230/355 variables, 138/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/355 variables, 138/370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/355 variables, 46/416 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/355 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 46/401 variables, 46/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/401 variables, 46/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/401 variables, 46/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/401 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/401 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 554 constraints, problems are : Problem set: 0 solved, 2 unsolved in 893 ms.
Refiners :[Domain max(s): 201/201 constraints, Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 201/201 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 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, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 7/11 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 5/16 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/17 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/17 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/17 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 16/33 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/33 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 92/125 variables, 50/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/125 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 230/355 variables, 138/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/355 variables, 138/370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/355 variables, 46/416 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/355 variables, 2/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/355 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 46/401 variables, 46/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/401 variables, 46/510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/401 variables, 46/556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/401 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:14] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:14] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:14] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:15] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:15] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 7 ms to minimize.
At refinement iteration 25 (OVERLAPS) 0/401 variables, 5/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:15] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:15] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:15] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:15] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 6 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/401 variables, 4/565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:15] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:16] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:16] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 6 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/401 variables, 3/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:16] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:16] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:16] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:16] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 5 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/401 variables, 4/572 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:16] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:16] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:17] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 5 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/401 variables, 3/575 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:17] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:17] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:17] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:17] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 5 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/401 variables, 4/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:17] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:17] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:17] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:18] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:18] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:18] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:18] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 4 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/401 variables, 7/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:18] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 4 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/401 variables, 1/587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:18] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:18] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 3 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/401 variables, 2/589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:18] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:18] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 4 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/401 variables, 2/591 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:19] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:19] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:19] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:19] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 3 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/401 variables, 4/595 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:19] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:19] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:19] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 3 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/401 variables, 3/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:19] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 4 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/401 variables, 1/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/401 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:19] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 3 ms to minimize.
At refinement iteration 39 (OVERLAPS) 0/401 variables, 1/600 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/401 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:20] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:20] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 3 ms to minimize.
At refinement iteration 41 (OVERLAPS) 0/401 variables, 2/602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:20] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:20] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:20] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:20] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:20] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:20] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:20] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:20] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/401 variables, 8/610 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:20] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:21] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:21] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:21] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:21] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
At refinement iteration 43 (INCLUDED_ONLY) 0/401 variables, 5/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/401 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (OVERLAPS) 0/401 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 615 constraints, problems are : Problem set: 0 solved, 2 unsolved in 7905 ms.
Refiners :[Domain max(s): 201/201 constraints, Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 201/201 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8842ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 491 ms.
Support contains 4 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 135 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 201/201 places, 2600/2600 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 115 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2025-05-30 21:47:22] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2025-05-30 21:47:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:47:23] [INFO ] Implicit Places using invariants in 863 ms returned []
[2025-05-30 21:47:23] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2025-05-30 21:47:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:47:23] [INFO ] State equation strengthened by 50 read => feed constraints.
[2025-05-30 21:47:24] [INFO ] Implicit Places using invariants and state equation in 1222 ms returned []
Implicit Place search using SMT with State Equation took 2089 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 21:47:24] [INFO ] Redundant transitions in 301 ms returned []
Running 2550 sub problems to find dead transitions.
[2025-05-30 21:47:24] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2025-05-30 21:47:24] [INFO ] Invariant cache hit.
[2025-05-30 21:47:24] [INFO ] State equation strengthened by 50 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 99/299 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:51] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:51] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:51] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:51] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:51] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:51] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:51] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:51] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:51] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:51] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:52] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:52] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:52] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:52] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:52] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:52] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:52] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:52] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:52] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:47:52] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 20/320 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 200/401 variables, and 320 constraints, problems are : Problem set: 0 solved, 2550 unsolved in 30167 ms.
Refiners :[Domain max(s): 200/201 constraints, Positive P Invariants (semi-flows): 99/100 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/201 constraints, ReadFeed: 0/50 constraints, PredecessorRefiner: 2550/2500 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2550 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 99/299 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 20/320 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:03] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:03] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:03] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:03] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:04] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:04] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:04] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:04] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:04] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:04] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:04] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:04] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:04] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:04] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:04] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:04] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:04] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:04] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:04] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:05] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 20/340 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:07] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:07] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:07] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:07] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:07] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:07] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:07] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:07] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:07] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:07] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:07] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:07] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:07] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:08] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:08] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:08] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:08] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:08] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:08] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:08] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 20/360 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:11] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:11] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:11] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:11] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:11] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:11] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:11] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:11] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:11] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:11] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:11] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:11] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:12] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:12] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:12] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:12] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:12] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:12] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:12] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:12] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 20/380 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:15] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:15] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:15] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:15] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:15] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:15] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:15] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:15] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:15] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:15] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:15] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:15] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:15] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:15] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:16] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:16] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:16] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:16] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:16] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:16] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 20/400 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:18] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:18] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:18] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:19] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:19] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:19] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:19] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:19] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:19] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:19] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:19] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:19] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:19] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:19] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:19] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:19] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:19] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:19] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:20] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:20] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:23] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:23] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:23] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:23] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:23] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:24] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:24] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:24] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:24] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:24] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:24] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:24] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:24] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:24] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:24] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:24] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:24] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:24] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:24] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:24] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 200/401 variables, and 440 constraints, problems are : Problem set: 0 solved, 2550 unsolved in 30083 ms.
Refiners :[Domain max(s): 200/201 constraints, Positive P Invariants (semi-flows): 99/100 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/201 constraints, ReadFeed: 0/50 constraints, PredecessorRefiner: 50/2500 constraints, Known Traps: 140/140 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61832ms problems are : Problem set: 0 solved, 2550 unsolved
Search for dead transitions found 0 dead transitions in 61881ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64429 ms. Remains : 201/201 places, 2600/2600 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 305 edges and 201 vertex of which 17 are kept as prefixes of interest. Removing 184 places using SCC suffix rule.2 ms
Discarding 184 places :
Also discarding 2392 output transitions
Drop transitions (Output transitions of discarded places.) removed 2392 transitions
Ensure Unique test removed 1 places
Ensure Unique test removed 192 transitions
Reduce isomorphic transitions removed 192 transitions.
Iterating post reduction 0 with 193 rules applied. Total rules applied 194 place count 16 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 200 place count 12 transition count 14
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 202 place count 12 transition count 12
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 204 place count 12 transition count 10
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 210 place count 8 transition count 8
Applied a total of 210 rules in 50 ms. Remains 8 /201 variables (removed 193) and now considering 8/2600 (removed 2592) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 8 rows 8 cols
[2025-05-30 21:48:26] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 21:48:26] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-30 21:48:26] [INFO ] After 12ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-30 21:48:26] [INFO ] After 30ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
[2025-05-30 21:48:26] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 143 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(X((p1||G(p2))))&&p0))))'
Support contains 4 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 2600/2600 transitions.
Applied a total of 0 rules in 26 ms. Remains 203 /203 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2025-05-30 21:48:27] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 203 cols
[2025-05-30 21:48:27] [INFO ] Computed 103 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:48:28] [INFO ] Implicit Places using invariants in 938 ms returned [131]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 944 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 202/203 places, 2600/2600 transitions.
Applied a total of 0 rules in 26 ms. Remains 202 /202 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1008 ms. Remains : 202/203 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 687 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Dekker-PT-050-LTLCardinality-01
Product exploration explored 100000 steps with 1151 reset in 2091 ms.
Stack based approach found an accepted trace after 33 steps with 1 reset with depth 14 and stack size 14 in 2 ms.
FORMULA Dekker-PT-050-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLCardinality-01 finished in 3921 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 203/203 places, 2600/2600 transitions.
Applied a total of 0 rules in 424 ms. Remains 203 /203 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2025-05-30 21:48:31] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2025-05-30 21:48:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:48:32] [INFO ] Implicit Places using invariants in 953 ms returned [114, 131, 178]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 958 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 200/203 places, 2600/2600 transitions.
Applied a total of 0 rules in 218 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1601 ms. Remains : 200/203 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-050-LTLCardinality-03
Product exploration explored 100000 steps with 979 reset in 1589 ms.
Stack based approach found an accepted trace after 162 steps with 1 reset with depth 70 and stack size 67 in 8 ms.
FORMULA Dekker-PT-050-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLCardinality-03 finished in 3329 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(p0)&&X(p1))))'
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 2600/2600 transitions.
Applied a total of 0 rules in 17 ms. Remains 203 /203 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2025-05-30 21:48:34] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2025-05-30 21:48:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:48:35] [INFO ] Implicit Places using invariants in 872 ms returned [114, 131, 178]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 877 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/203 places, 2600/2600 transitions.
Applied a total of 0 rules in 25 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 920 ms. Remains : 200/203 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : Dekker-PT-050-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Dekker-PT-050-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-050-LTLCardinality-04 finished in 1203 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(p0)))'
Support contains 2 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 2600/2600 transitions.
Applied a total of 0 rules in 25 ms. Remains 203 /203 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2025-05-30 21:48:35] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2025-05-30 21:48:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:48:36] [INFO ] Implicit Places using invariants in 1004 ms returned [114, 131, 178]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1021 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/203 places, 2600/2600 transitions.
Applied a total of 0 rules in 25 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1073 ms. Remains : 200/203 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-050-LTLCardinality-10
Product exploration explored 100000 steps with 39642 reset in 1411 ms.
Stack based approach found an accepted trace after 748 steps with 303 reset with depth 3 and stack size 3 in 16 ms.
FORMULA Dekker-PT-050-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLCardinality-10 finished in 2628 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 203/203 places, 2600/2600 transitions.
Applied a total of 0 rules in 162 ms. Remains 203 /203 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2025-05-30 21:48:38] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2025-05-30 21:48:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:48:39] [INFO ] Implicit Places using invariants in 1002 ms returned [114, 131, 178]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1013 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 200/203 places, 2600/2600 transitions.
Applied a total of 0 rules in 160 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1336 ms. Remains : 200/203 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : Dekker-PT-050-LTLCardinality-13
Product exploration explored 100000 steps with 0 reset in 1510 ms.
Product exploration explored 100000 steps with 0 reset in 2288 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 153 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 1089 ms. (36 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 494190 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :0 out of 1
Probabilistic random walk after 494190 steps, saw 405169 distinct states, run finished after 3001 ms. (steps per millisecond=164 ) properties seen :0
[2025-05-30 21:48:46] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2025-05-30 21:48:46] [INFO ] Computed 100 invariants in 10 ms
[2025-05-30 21:48:46] [INFO ] State equation strengthened by 50 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 3/5 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/8 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/16 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/16 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 96/112 variables, 50/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/112 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 240/352 variables, 144/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/352 variables, 144/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/352 variables, 48/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/352 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 48/400 variables, 48/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/400 variables, 48/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/400 variables, 48/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/400 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/400 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 550 constraints, problems are : Problem set: 0 solved, 1 unsolved in 228 ms.
Refiners :[Domain max(s): 200/200 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 200/200 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 3/5 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/8 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/16 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/16 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 96/112 variables, 50/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/112 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 240/352 variables, 144/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/352 variables, 144/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/352 variables, 48/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/352 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/352 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 48/400 variables, 48/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/400 variables, 48/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/400 variables, 48/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:47] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:47] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:47] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 5 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/400 variables, 3/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:48] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:48] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:48] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:48] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:48:48] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 7 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/400 variables, 5/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/400 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/400 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 559 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1659 ms.
Refiners :[Domain max(s): 200/200 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 200/200 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1929ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 162 steps, including 1 resets, run visited all 1 properties in 5 ms. (steps per millisecond=32 )
Parikh walk visited 1 properties in 14 ms.
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 200 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Support contains 2 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 2600/2600 transitions.
Applied a total of 0 rules in 161 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2025-05-30 21:48:49] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2025-05-30 21:48:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:48:50] [INFO ] Implicit Places using invariants in 911 ms returned []
[2025-05-30 21:48:50] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2025-05-30 21:48:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:48:50] [INFO ] State equation strengthened by 50 read => feed constraints.
[2025-05-30 21:48:51] [INFO ] Implicit Places using invariants and state equation in 1213 ms returned []
Implicit Place search using SMT with State Equation took 2126 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 21:48:51] [INFO ] Redundant transitions in 364 ms returned []
Running 2550 sub problems to find dead transitions.
[2025-05-30 21:48:51] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2025-05-30 21:48:51] [INFO ] Invariant cache hit.
[2025-05-30 21:48:51] [INFO ] State equation strengthened by 50 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 100/300 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:16] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:16] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:16] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:16] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:16] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:16] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:17] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:17] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:17] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:17] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:17] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:17] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:17] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:17] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:17] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:17] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:17] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:17] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:17] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:17] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 20/320 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:19] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:19] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:19] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:19] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:19] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:19] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:19] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:19] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:19] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:19] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:19] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:19] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:19] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:19] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:19] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:19] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:19] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:19] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:20] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:20] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 20/340 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 200/400 variables, and 340 constraints, problems are : Problem set: 0 solved, 2550 unsolved in 30052 ms.
Refiners :[Domain max(s): 200/200 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 0/200 constraints, ReadFeed: 0/50 constraints, PredecessorRefiner: 2550/2500 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2550 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 100/300 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 40/340 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:27] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:27] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:27] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:27] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:28] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:28] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:28] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:28] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:28] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:28] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:28] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:28] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:28] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:28] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:28] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:28] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:28] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:28] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:28] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:28] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 20/360 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:30] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:30] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:30] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:30] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:30] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:31] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:31] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:31] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:31] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:31] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:31] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:31] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:31] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:31] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:31] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:31] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:31] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:31] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:31] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:32] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 20/380 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:34] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:34] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:34] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:34] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:34] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:34] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:34] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:34] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:34] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:34] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:34] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:34] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:34] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:34] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:34] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:34] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:35] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:35] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:35] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:35] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 20/400 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:37] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:37] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:37] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:37] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:37] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:37] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:37] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:37] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:37] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:37] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:37] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:38] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:38] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:38] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:38] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:38] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:38] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:38] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:38] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:38] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:41] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:41] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:41] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:41] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:41] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:41] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:41] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:41] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:41] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:41] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:41] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:41] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:41] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:42] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:42] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:42] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:42] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:42] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:42] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:42] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:44] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:44] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:44] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:45] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:45] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:46] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:47] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:47] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:48] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:48] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:49] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:49] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:50] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:50] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:51] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:51] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:52] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:53] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 200/400 variables, and 458 constraints, problems are : Problem set: 0 solved, 2550 unsolved in 30048 ms.
Refiners :[Domain max(s): 200/200 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 0/200 constraints, ReadFeed: 0/50 constraints, PredecessorRefiner: 50/2500 constraints, Known Traps: 158/158 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61610ms problems are : Problem set: 0 solved, 2550 unsolved
Search for dead transitions found 0 dead transitions in 61633ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64311 ms. Remains : 200/200 places, 2600/2600 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 149 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 827 ms. (48 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 590733 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :0 out of 1
Probabilistic random walk after 590733 steps, saw 481908 distinct states, run finished after 3001 ms. (steps per millisecond=196 ) properties seen :0
[2025-05-30 21:49:57] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2025-05-30 21:49:57] [INFO ] Invariant cache hit.
[2025-05-30 21:49:57] [INFO ] State equation strengthened by 50 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 3/5 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/8 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/16 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/16 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 96/112 variables, 50/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/112 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 240/352 variables, 144/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/352 variables, 144/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/352 variables, 48/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/352 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 48/400 variables, 48/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/400 variables, 48/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/400 variables, 48/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/400 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/400 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 550 constraints, problems are : Problem set: 0 solved, 1 unsolved in 225 ms.
Refiners :[Domain max(s): 200/200 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 200/200 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 3/5 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/8 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/16 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/16 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 96/112 variables, 50/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/112 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 240/352 variables, 144/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/352 variables, 144/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/352 variables, 48/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/352 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:57] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 6 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/352 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/352 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 48/400 variables, 48/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/400 variables, 48/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/400 variables, 48/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:49:57] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 4 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/400 variables, 1/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/400 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/400 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 553 constraints, problems are : Problem set: 0 solved, 1 unsolved in 562 ms.
Refiners :[Domain max(s): 200/200 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 200/200 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 815ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 82 ms.
Support contains 2 out of 200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 2600/2600 transitions.
Applied a total of 0 rules in 70 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 200/200 places, 2600/2600 transitions.
RANDOM walk for 40000 steps (8 resets) in 797 ms. (50 steps per ms) remains 1/1 properties
BEST_FIRST walk for 33472 steps (7 resets) in 85 ms. (389 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 164 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1219 ms.
Product exploration explored 100000 steps with 0 reset in 1304 ms.
Built C files in :
/tmp/ltsmin3289022109043048605
[2025-05-30 21:50:01] [INFO ] Too many transitions (2600) to apply POR reductions. Disabling POR matrices.
[2025-05-30 21:50:01] [INFO ] Built C files in 129ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3289022109043048605
Running compilation step : cd /tmp/ltsmin3289022109043048605;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3289022109043048605;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3289022109043048605;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 2600/2600 transitions.
Applied a total of 0 rules in 91 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2025-05-30 21:50:04] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2025-05-30 21:50:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:50:05] [INFO ] Implicit Places using invariants in 578 ms returned []
[2025-05-30 21:50:05] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2025-05-30 21:50:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:50:05] [INFO ] State equation strengthened by 50 read => feed constraints.
[2025-05-30 21:50:05] [INFO ] Implicit Places using invariants and state equation in 856 ms returned []
Implicit Place search using SMT with State Equation took 1441 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 21:50:06] [INFO ] Redundant transitions in 140 ms returned []
Running 2550 sub problems to find dead transitions.
[2025-05-30 21:50:06] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2025-05-30 21:50:06] [INFO ] Invariant cache hit.
[2025-05-30 21:50:06] [INFO ] State equation strengthened by 50 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 100/300 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:28] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:28] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:28] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:28] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:28] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:28] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:28] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:28] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:28] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:28] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:28] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:28] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:29] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:29] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:29] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:29] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:29] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:29] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:29] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:29] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 20/320 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:30] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:30] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:30] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:30] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:30] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:30] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:30] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:31] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:31] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:31] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:31] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:31] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:31] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:31] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:31] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:31] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:31] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:31] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:31] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:31] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 20/340 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 200/400 variables, and 340 constraints, problems are : Problem set: 0 solved, 2550 unsolved in 30071 ms.
Refiners :[Domain max(s): 200/200 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 0/200 constraints, ReadFeed: 0/50 constraints, PredecessorRefiner: 2550/2500 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2550 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 100/300 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 40/340 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:42] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:42] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:42] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:42] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:42] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:43] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:43] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:43] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:43] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:43] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:43] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:43] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:43] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:43] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:43] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:43] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:43] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:43] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:43] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:43] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 20/360 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:46] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:46] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:46] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:46] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:46] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:46] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:46] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:46] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:46] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:46] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:46] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:46] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:46] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:46] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:46] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:46] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:46] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:47] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:47] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:47] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 20/380 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:49] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:49] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:49] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:49] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:49] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:49] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:49] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:50] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:50] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:50] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:50] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:50] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:50] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:50] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:50] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:50] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:50] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:50] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:50] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:50] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 20/400 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:53] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:53] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:53] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:53] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:53] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:53] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:53] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:53] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:53] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:54] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:54] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:54] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:54] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:54] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:54] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:54] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:54] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:54] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:54] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:54] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:57] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:57] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:57] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:57] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:57] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:57] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:57] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:57] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:58] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:58] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:58] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:58] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:58] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:58] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:58] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:58] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:58] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:58] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:58] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:50:58] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:51:02] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:51:02] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:51:02] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:51:02] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:51:03] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:51:04] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:51:04] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:51:05] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:51:06] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:51:06] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:51:07] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 200/400 variables, and 451 constraints, problems are : Problem set: 0 solved, 2550 unsolved in 30049 ms.
Refiners :[Domain max(s): 200/200 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 0/200 constraints, ReadFeed: 0/50 constraints, PredecessorRefiner: 50/2500 constraints, Known Traps: 151/151 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61536ms problems are : Problem set: 0 solved, 2550 unsolved
Search for dead transitions found 0 dead transitions in 61552ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63241 ms. Remains : 200/200 places, 2600/2600 transitions.
Built C files in :
/tmp/ltsmin1549273314783791829
[2025-05-30 21:51:07] [INFO ] Too many transitions (2600) to apply POR reductions. Disabling POR matrices.
[2025-05-30 21:51:07] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1549273314783791829
Running compilation step : cd /tmp/ltsmin1549273314783791829;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1549273314783791829;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1549273314783791829;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-30 21:51:11] [INFO ] Flatten gal took : 132 ms
[2025-05-30 21:51:11] [INFO ] Flatten gal took : 123 ms
[2025-05-30 21:51:11] [INFO ] Time to serialize gal into /tmp/LTL2974000201188088303.gal : 51 ms
[2025-05-30 21:51:11] [INFO ] Time to serialize properties into /tmp/LTL4118544134249109122.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2974000201188088303.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8569371181685320359.hoa' '-atoms' '/tmp/LTL4118544134249109122.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL4118544134249109122.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8569371181685320359.hoa
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
Detected timeout of ITS tools.
[2025-05-30 21:51:26] [INFO ] Flatten gal took : 111 ms
[2025-05-30 21:51:26] [INFO ] Flatten gal took : 210 ms
[2025-05-30 21:51:26] [INFO ] Time to serialize gal into /tmp/LTL3458989442383201657.gal : 28 ms
[2025-05-30 21:51:26] [INFO ] Time to serialize properties into /tmp/LTL5208761199059829173.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3458989442383201657.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5208761199059829173.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("((p3_12==0)||(flag_1_5==1))"))))
Formula 0 simplified : GF!"((p3_12==0)||(flag_1_5==1))"
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
Detected timeout of ITS tools.
[2025-05-30 21:51:41] [INFO ] Flatten gal took : 96 ms
[2025-05-30 21:51:41] [INFO ] Applying decomposition
[2025-05-30 21:51:41] [INFO ] Flatten gal took : 96 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3776660169449749476.txt' '-o' '/tmp/graph3776660169449749476.bin' '-w' '/tmp/graph3776660169449749476.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3776660169449749476.bin' '-l' '-1' '-v' '-w' '/tmp/graph3776660169449749476.weights' '-q' '0' '-e' '0.001'
[2025-05-30 21:51:42] [INFO ] Decomposing Gal with order
[2025-05-30 21:51:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 21:51:42] [INFO ] Removed a total of 7200 redundant transitions.
[2025-05-30 21:51:42] [INFO ] Flatten gal took : 381 ms
[2025-05-30 21:51:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 93 ms.
[2025-05-30 21:51:43] [INFO ] Time to serialize gal into /tmp/LTL9887917171771924919.gal : 26 ms
[2025-05-30 21:51:43] [INFO ] Time to serialize properties into /tmp/LTL7300640968913713911.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9887917171771924919.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7300640968913713911.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G("((u12.p3_12==0)||(u5.flag_1_5==1))"))))
Formula 0 simplified : GF!"((u12.p3_12==0)||(u5.flag_1_5==1))"
Reverse transition relation is NOT exact ! Due to transitions u0.t51, u1.t103, u2.t155, u3.t207, u4.t259, u5.t311, u6.t363, u7.t415, u8.t467, u9.t519, u10....684
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
314 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.29853,95616,1,0,215581,1350,19012,139710,165,1325,312706
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Dekker-PT-050-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Dekker-PT-050-LTLCardinality-13 finished in 188911 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!((p0 U p1) U G(p0)))'
Support contains 3 out of 203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 203/203 places, 2600/2600 transitions.
Applied a total of 0 rules in 93 ms. Remains 203 /203 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2025-05-30 21:51:47] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 203 cols
[2025-05-30 21:51:47] [INFO ] Computed 103 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:51:47] [INFO ] Implicit Places using invariants in 859 ms returned [114, 178]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 862 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 201/203 places, 2600/2600 transitions.
Applied a total of 0 rules in 98 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1053 ms. Remains : 201/203 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 154 ms :[p0, p0, (AND p1 p0)]
Running random walk in product with property : Dekker-PT-050-LTLCardinality-14
Product exploration explored 100000 steps with 0 reset in 1183 ms.
Stack based approach found an accepted trace after 27 steps with 0 reset with depth 28 and stack size 28 in 1 ms.
FORMULA Dekker-PT-050-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLCardinality-14 finished in 2423 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||G(p1)))))'
Support contains 2 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 2600/2600 transitions.
Applied a total of 0 rules in 22 ms. Remains 203 /203 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2025-05-30 21:51:49] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2025-05-30 21:51:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:51:50] [INFO ] Implicit Places using invariants in 928 ms returned [114, 131, 178]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 931 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/203 places, 2600/2600 transitions.
Applied a total of 0 rules in 14 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 969 ms. Remains : 200/203 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Dekker-PT-050-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 1237 ms.
Product exploration explored 100000 steps with 0 reset in 1392 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be false thanks to negative knowledge :(X (X (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 5 factoid took 218 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Dekker-PT-050-LTLCardinality-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Dekker-PT-050-LTLCardinality-15 finished in 4037 ms.
All properties solved by simple procedures.
Total runtime 307006 ms.
BK_STOP 1748641913522
--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="Dekker-PT-050"
export BK_EXAMINATION="LTLCardinality"
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 Dekker-PT-050, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r058-smll-174854063700195"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-050.tgz
mv Dekker-PT-050 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;