Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r016-smll-174853765300510.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 BugTracking-PT-q3m016, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-smll-174853765300510
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K 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 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 16M 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 BugTracking-PT-q3m016-ReachabilityCardinality-2023-13
FORMULA_NAME BugTracking-PT-q3m016-ReachabilityCardinality-2023-14
FORMULA_NAME BugTracking-PT-q3m016-ReachabilityCardinality-2024-04
FORMULA_NAME BugTracking-PT-q3m016-ReachabilityCardinality-2024-10
FORMULA_NAME BugTracking-PT-q3m016-ReachabilityCardinality-2025-00
FORMULA_NAME BugTracking-PT-q3m016-ReachabilityCardinality-2025-01
FORMULA_NAME BugTracking-PT-q3m016-ReachabilityCardinality-2025-02
FORMULA_NAME BugTracking-PT-q3m016-ReachabilityCardinality-2025-03
FORMULA_NAME BugTracking-PT-q3m016-ReachabilityCardinality-2025-05
FORMULA_NAME BugTracking-PT-q3m016-ReachabilityCardinality-2025-06
FORMULA_NAME BugTracking-PT-q3m016-ReachabilityCardinality-2025-07
FORMULA_NAME BugTracking-PT-q3m016-ReachabilityCardinality-2025-08
FORMULA_NAME BugTracking-PT-q3m016-ReachabilityCardinality-2025-09
FORMULA_NAME BugTracking-PT-q3m016-ReachabilityCardinality-2025-11
FORMULA_NAME BugTracking-PT-q3m016-ReachabilityCardinality-2025-12
FORMULA_NAME BugTracking-PT-q3m016-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749138929838

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m016
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-05 15:55:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 15:55:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 15:55:33] [INFO ] Load time of PNML (sax parser for PT used): 1382 ms
[2025-06-05 15:55:33] [INFO ] Transformed 754 places.
[2025-06-05 15:55:33] [INFO ] Transformed 27370 transitions.
[2025-06-05 15:55:33] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1674 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 39 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 514 places in 182 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m016-ReachabilityCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-ReachabilityCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-ReachabilityCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-ReachabilityCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-ReachabilityCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-ReachabilityCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40012 steps (145 resets) in 2686 ms. (14 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (25 resets) in 916 ms. (43 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (28 resets) in 347 ms. (114 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (21 resets) in 351 ms. (113 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (28 resets) in 431 ms. (92 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (23 resets) in 358 ms. (111 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (25 resets) in 254 ms. (156 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (25 resets) in 219 ms. (181 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (26 resets) in 216 ms. (184 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (25 resets) in 202 ms. (197 steps per ms) remains 9/9 properties
[2025-06-05 15:55:36] [INFO ] Flatten gal took : 1218 ms
[2025-06-05 15:55:36] [INFO ] Flatten gal took : 263 ms
[2025-06-05 15:55:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3187711806071646622.gal : 162 ms
[2025-06-05 15:55:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17787298244375869098.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3187711806071646622.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17787298244375869098.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality17787298244375869098.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :10 after 20
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :20 after 56
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :56 after 165
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :165 after 680
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :680 after 53142
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :53142 after 302175
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :302175 after 799272
Interrupted probabilistic random walk after 92687 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :0 out of 9
Probabilistic random walk after 92687 steps, saw 49094 distinct states, run finished after 3008 ms. (steps per millisecond=30 ) properties seen :0
[2025-06-05 15:55:39] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2025-06-05 15:55:39] [INFO ] Computed 10 invariants in 47 ms
[2025-06-05 15:55:39] [INFO ] State equation strengthened by 255 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/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem BugTracking-PT-q3m016-ReachabilityCardinality-2025-00 is UNSAT
FORMULA BugTracking-PT-q3m016-ReachabilityCardinality-2025-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem BugTracking-PT-q3m016-ReachabilityCardinality-2025-07 is UNSAT
FORMULA BugTracking-PT-q3m016-ReachabilityCardinality-2025-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem BugTracking-PT-q3m016-ReachabilityCardinality-2025-12 is UNSAT
FORMULA BugTracking-PT-q3m016-ReachabilityCardinality-2025-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 108/126 variables, 6/6 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2420/2546 variables, 126/132 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2546 variables, 151/283 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2546 variables, 0/283 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 323/2869 variables, 102/385 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2869 variables, 2/387 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2869 variables, 103/490 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2869 variables, 0/490 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 3/2872 variables, 2/492 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2872 variables, 1/493 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2872 variables, 0/493 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 10/2882 variables, 11/504 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2882 variables, 1/505 constraints. Problems are: Problem set: 3 solved, 6 unsolved
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :799272 after 1.7925e+06
At refinement iteration 15 (INCLUDED_ONLY) 0/2882 variables, 0/505 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2882/2882 variables, and 505 constraints, problems are : Problem set: 3 solved, 6 unsolved in 5048 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 240/240 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 82/96 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:55:44] [INFO ] Deduced a trap composed of 8 places in 322 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:55:45] [INFO ] Deduced a trap composed of 10 places in 269 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:55:45] [INFO ] Deduced a trap composed of 12 places in 201 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 1640/1736 variables, 96/104 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1736 variables, 149/253 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1736 variables, 0/253 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1130/2866 variables, 129/382 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2866 variables, 3/385 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2866 variables, 105/490 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2866 variables, 6/496 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:55:48] [INFO ] Deduced a trap composed of 21 places in 170 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2866 variables, 1/497 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:55:49] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2866/2882 variables, and 498 constraints, problems are : Problem set: 3 solved, 6 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 8/10 constraints, State Equation: 225/240 constraints, ReadFeed: 254/255 constraints, PredecessorRefiner: 6/9 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10293ms problems are : Problem set: 3 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Graph (complete) has 3422 edges and 240 vertex of which 239 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 238 transition count 2750
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 238 transition count 2750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 236 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 236 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 230 transition count 2747
Applied a total of 19 rules in 409 ms. Remains 230 /240 variables (removed 10) and now considering 2747/2769 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 421 ms. Remains : 230/240 places, 2747/2769 transitions.
RANDOM walk for 40028 steps (9 resets) in 472 ms. (84 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 306 ms. (130 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 317 ms. (125 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 300 ms. (132 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 273 ms. (145 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 323 ms. (123 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 100612 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 6
Probabilistic random walk after 100612 steps, saw 34398 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
[2025-06-05 15:55:53] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 230 cols
[2025-06-05 15:55:53] [INFO ] Computed 9 invariants in 19 ms
[2025-06-05 15:55:53] [INFO ] State equation strengthened by 241 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 79/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1622/1715 variables, 93/98 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1715 variables, 135/233 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1715 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1121/2836 variables, 125/358 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2836 variables, 3/361 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2836 variables, 106/467 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2836 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/2837 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2837 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2837 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 11/2848 variables, 11/480 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2848 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/2848 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2848/2848 variables, and 480 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2708 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 230/230 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 79/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:55:56] [INFO ] Deduced a trap composed of 11 places in 236 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:55:56] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 1622/1715 variables, 93/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1715 variables, 135/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:55:57] [INFO ] Deduced a trap composed of 11 places in 223 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1715 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1715 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1121/2836 variables, 125/361 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2836 variables, 3/364 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2836 variables, 106/470 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2836 variables, 6/476 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:55:59] [INFO ] Deduced a trap composed of 10 places in 263 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:55:59] [INFO ] Deduced a trap composed of 16 places in 236 ms of which 9 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2836 variables, 2/478 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:00] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2836 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2836 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 1/2837 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2837 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2837 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 11/2848 variables, 11/492 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2848 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:05] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 4 ms to minimize.
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :1.7925e+06 after 3.77798e+06
At refinement iteration 20 (OVERLAPS) 0/2848 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2848 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 0/2848 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2848/2848 variables, and 493 constraints, problems are : Problem set: 0 solved, 6 unsolved in 12411 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 230/230 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15206ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 15151 ms.
Support contains 14 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2747/2747 transitions.
Applied a total of 0 rules in 63 ms. Remains 230 /230 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 230/230 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2747/2747 transitions.
Applied a total of 0 rules in 61 ms. Remains 230 /230 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2025-06-05 15:56:23] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-06-05 15:56:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:56:24] [INFO ] Implicit Places using invariants in 476 ms returned []
[2025-06-05 15:56:24] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-06-05 15:56:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:56:25] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-06-05 15:56:27] [INFO ] Implicit Places using invariants and state equation in 3551 ms returned []
Implicit Place search using SMT with State Equation took 4045 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:56:28] [INFO ] Redundant transitions in 267 ms returned []
Running 2746 sub problems to find dead transitions.
[2025-06-05 15:56:28] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-06-05 15:56:28] [INFO ] Invariant cache hit.
[2025-06-05 15:56:28] [INFO ] State equation strengthened by 241 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.
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.
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.
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.
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.
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.
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.
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.
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.
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/229 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2746 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:57:03] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 229/2848 variables, and 9 constraints, problems are : Problem set: 0 solved, 2746 unsolved in 30107 ms.
Refiners :[Positive P Invariants (semi-flows): 8/9 constraints, State Equation: 0/230 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 2746/1184 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2746 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2746 unsolved
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 1/9 constraints. Problems are: Problem set: 8 solved, 2738 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:57:21] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 4 ms to minimize.
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1439 is UNSAT
Problem TDEAD1440 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1446 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1450 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:57:21] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 4 ms to minimize.
Problem TDEAD1456 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1460 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1476 is UNSAT
Problem TDEAD1477 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:57:21] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 3 ms to minimize.
Problem TDEAD1480 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1568 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1576 is UNSAT
Problem TDEAD1577 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1585 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1596 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1604 is UNSAT
Problem TDEAD1605 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1613 is UNSAT
Problem TDEAD1614 is UNSAT
Problem TDEAD1615 is UNSAT
Problem TDEAD1616 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1637 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1643 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1716 is UNSAT
Problem TDEAD1717 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1719 is UNSAT
Problem TDEAD1720 is UNSAT
Problem TDEAD1721 is UNSAT
Problem TDEAD1722 is UNSAT
Problem TDEAD1723 is UNSAT
Problem TDEAD1724 is UNSAT
Problem TDEAD1725 is UNSAT
Problem TDEAD1726 is UNSAT
Problem TDEAD1727 is UNSAT
Problem TDEAD1728 is UNSAT
Problem TDEAD1729 is UNSAT
Problem TDEAD1730 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1732 is UNSAT
Problem TDEAD1733 is UNSAT
Problem TDEAD1734 is UNSAT
Problem TDEAD1735 is UNSAT
Problem TDEAD1736 is UNSAT
Problem TDEAD1737 is UNSAT
Problem TDEAD1738 is UNSAT
Problem TDEAD1739 is UNSAT
Problem TDEAD1740 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1742 is UNSAT
Problem TDEAD1743 is UNSAT
Problem TDEAD1747 is UNSAT
Problem TDEAD1748 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1753 is UNSAT
Problem TDEAD1754 is UNSAT
Problem TDEAD1755 is UNSAT
Problem TDEAD1756 is UNSAT
Problem TDEAD1757 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1764 is UNSAT
Problem TDEAD1766 is UNSAT
Problem TDEAD1767 is UNSAT
Problem TDEAD1771 is UNSAT
Problem TDEAD1772 is UNSAT
Problem TDEAD1773 is UNSAT
Problem TDEAD1774 is UNSAT
Problem TDEAD1775 is UNSAT
Problem TDEAD1776 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1783 is UNSAT
Problem TDEAD1785 is UNSAT
Problem TDEAD1786 is UNSAT
Problem TDEAD1790 is UNSAT
Problem TDEAD1791 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1793 is UNSAT
Problem TDEAD1794 is UNSAT
Problem TDEAD1795 is UNSAT
Problem TDEAD1801 is UNSAT
Problem TDEAD1802 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:57:30] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 4 ms to minimize.
Problem TDEAD2709 is UNSAT
Problem TDEAD2710 is UNSAT
Problem TDEAD2720 is UNSAT
Problem TDEAD2721 is UNSAT
Problem TDEAD2732 is UNSAT
Problem TDEAD2733 is UNSAT
Problem TDEAD2743 is UNSAT
Problem TDEAD2744 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 4/13 constraints. Problems are: Problem set: 222 solved, 2524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 229/2848 variables, and 13 constraints, problems are : Problem set: 222 solved, 2524 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 8/9 constraints, State Equation: 0/230 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 1562/1184 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 68287ms problems are : Problem set: 222 solved, 2524 unsolved
Search for dead transitions found 222 dead transitions in 68317ms
Found 222 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 222 transitions
Dead transitions reduction (with SMT) removed 222 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 230/230 places, 2525/2747 transitions.
Reduce places removed 26 places and 563 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 204 transition count 1962
Reduce places removed 20 places and 260 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 46 place count 184 transition count 1702
Reduce places removed 8 places and 198 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 54 place count 176 transition count 1504
Reduce places removed 9 places and 118 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 63 place count 167 transition count 1386
Reduce places removed 3 places and 66 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 66 place count 164 transition count 1320
Reduce places removed 3 places and 52 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 69 place count 161 transition count 1268
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 72 place count 158 transition count 1225
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 15 places and 270 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 90 place count 143 transition count 955
Deduced a syphon composed of 4 places in 2 ms
Applied a total of 90 rules in 80 ms. Remains 143 /230 variables (removed 87) and now considering 955/2525 (removed 1570) transitions.
[2025-06-05 15:57:36] [INFO ] Flow matrix only has 904 transitions (discarded 51 similar events)
// Phase 1: matrix 904 rows 143 cols
[2025-06-05 15:57:36] [INFO ] Computed 13 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:57:36] [INFO ] Implicit Places using invariants in 204 ms returned []
[2025-06-05 15:57:36] [INFO ] Flow matrix only has 904 transitions (discarded 51 similar events)
[2025-06-05 15:57:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:57:37] [INFO ] State equation strengthened by 113 read => feed constraints.
[2025-06-05 15:57:38] [INFO ] Implicit Places using invariants and state equation in 1342 ms returned []
Implicit Place search using SMT with State Equation took 1549 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 143/230 places, 955/2747 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 74344 ms. Remains : 143/230 places, 955/2747 transitions.
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
FORMULA BugTracking-PT-q3m016-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-ReachabilityCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40019 steps (8 resets) in 310 ms. (128 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 143 ms. (277 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 160 ms. (248 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 232540 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 3
Probabilistic random walk after 232540 steps, saw 116943 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
[2025-06-05 15:57:41] [INFO ] Flow matrix only has 904 transitions (discarded 51 similar events)
// Phase 1: matrix 904 rows 139 cols
[2025-06-05 15:57:41] [INFO ] Computed 9 invariants in 5 ms
[2025-06-05 15:57:41] [INFO ] State equation strengthened by 113 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 69/76 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 903/979 variables, 70/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/979 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/979 variables, 104/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/979 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 5/984 variables, 3/196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/984 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/984 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 59/1043 variables, 59/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1043 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1043 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1043 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1043 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1043/1043 variables, and 261 constraints, problems are : Problem set: 0 solved, 3 unsolved in 593 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 139/139 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 69/76 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 903/979 variables, 70/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/979 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/979 variables, 104/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/979 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/979 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 5/984 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/984 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/984 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 59/1043 variables, 59/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1043 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1043 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1043 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:57:42] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 4 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1043 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1043 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/1043 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1043/1043 variables, and 265 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1259 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 139/139 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1871ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 481 ms.
Support contains 4 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 955/955 transitions.
Graph (complete) has 1326 edges and 139 vertex of which 138 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 20 ms. Remains 138 /139 variables (removed 1) and now considering 955/955 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 138/139 places, 955/955 transitions.
RANDOM walk for 40021 steps (8 resets) in 192 ms. (207 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 124 ms. (320 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 133 ms. (298 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 229310 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 3
Probabilistic random walk after 229310 steps, saw 114844 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
[2025-06-05 15:57:47] [INFO ] Flow matrix only has 904 transitions (discarded 51 similar events)
// Phase 1: matrix 904 rows 138 cols
[2025-06-05 15:57:47] [INFO ] Computed 8 invariants in 6 ms
[2025-06-05 15:57:47] [INFO ] State equation strengthened by 113 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 69/76 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 902/978 variables, 69/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/978 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/978 variables, 104/192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/978 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/980 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/980 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/980 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 62/1042 variables, 60/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1042 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1042 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1042 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1042 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1042/1042 variables, and 259 constraints, problems are : Problem set: 0 solved, 3 unsolved in 633 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 138/138 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 69/76 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 902/978 variables, 69/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/978 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/978 variables, 104/192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/978 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :3.77798e+06 after 7.74797e+06
At refinement iteration 10 (INCLUDED_ONLY) 0/978 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/980 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/980 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/980 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 62/1042 variables, 60/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1042 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1042 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1042 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1042 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1042 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1042/1042 variables, and 262 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1076 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 138/138 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1727ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1254 ms.
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 955/955 transitions.
Applied a total of 0 rules in 17 ms. Remains 138 /138 variables (removed 0) and now considering 955/955 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 138/138 places, 955/955 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 955/955 transitions.
Applied a total of 0 rules in 14 ms. Remains 138 /138 variables (removed 0) and now considering 955/955 (removed 0) transitions.
[2025-06-05 15:57:50] [INFO ] Flow matrix only has 904 transitions (discarded 51 similar events)
[2025-06-05 15:57:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:57:50] [INFO ] Implicit Places using invariants in 228 ms returned []
[2025-06-05 15:57:50] [INFO ] Flow matrix only has 904 transitions (discarded 51 similar events)
[2025-06-05 15:57:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:57:50] [INFO ] State equation strengthened by 113 read => feed constraints.
[2025-06-05 15:57:51] [INFO ] Implicit Places using invariants and state equation in 1162 ms returned []
Implicit Place search using SMT with State Equation took 1392 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:57:51] [INFO ] Redundant transitions in 49 ms returned []
Running 954 sub problems to find dead transitions.
[2025-06-05 15:57:51] [INFO ] Flow matrix only has 904 transitions (discarded 51 similar events)
[2025-06-05 15:57:51] [INFO ] Invariant cache hit.
[2025-06-05 15:57:51] [INFO ] State equation strengthened by 113 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:57:57] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:57:58] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 4 ms to minimize.
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:57:59] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 3 ms to minimize.
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 3/11 constraints. Problems are: Problem set: 150 solved, 804 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/11 constraints. Problems are: Problem set: 150 solved, 804 unsolved
Problem TDEAD619 is UNSAT
At refinement iteration 3 (OVERLAPS) 904/1042 variables, 138/149 constraints. Problems are: Problem set: 151 solved, 803 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1042 variables, 113/262 constraints. Problems are: Problem set: 151 solved, 803 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1042/1042 variables, and 262 constraints, problems are : Problem set: 151 solved, 803 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 138/138 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 151 solved, 803 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 7/7 constraints. Problems are: Problem set: 151 solved, 803 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 3/10 constraints. Problems are: Problem set: 151 solved, 803 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/10 constraints. Problems are: Problem set: 151 solved, 803 unsolved
At refinement iteration 3 (OVERLAPS) 1/138 variables, 1/11 constraints. Problems are: Problem set: 151 solved, 803 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/11 constraints. Problems are: Problem set: 151 solved, 803 unsolved
At refinement iteration 5 (OVERLAPS) 904/1042 variables, 138/149 constraints. Problems are: Problem set: 151 solved, 803 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1042 variables, 113/262 constraints. Problems are: Problem set: 151 solved, 803 unsolved
Problem TDEAD105 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/1042 variables, 803/1065 constraints. Problems are: Problem set: 216 solved, 738 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1042/1042 variables, and 1065 constraints, problems are : Problem set: 216 solved, 738 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 138/138 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 803/954 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61500ms problems are : Problem set: 216 solved, 738 unsolved
Search for dead transitions found 216 dead transitions in 61505ms
Found 216 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 216 transitions
Dead transitions reduction (with SMT) removed 216 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 138/138 places, 739/955 transitions.
Graph (complete) has 1062 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 17 places and 211 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 120 transition count 528
Reduce places removed 16 places and 97 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 34 place count 104 transition count 431
Reduce places removed 3 places and 32 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 37 place count 101 transition count 399
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 39 place count 99 transition count 383
Reduce places removed 1 places and 14 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 40 place count 98 transition count 369
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 44 place count 94 transition count 341
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 5 with 4 rules applied. Total rules applied 48 place count 94 transition count 341
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 48 rules in 19 ms. Remains 94 /138 variables (removed 44) and now considering 341/739 (removed 398) transitions.
[2025-06-05 15:58:52] [INFO ] Flow matrix only has 317 transitions (discarded 24 similar events)
// Phase 1: matrix 317 rows 94 cols
[2025-06-05 15:58:53] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:58:53] [INFO ] Implicit Places using invariants in 146 ms returned []
[2025-06-05 15:58:53] [INFO ] Flow matrix only has 317 transitions (discarded 24 similar events)
[2025-06-05 15:58:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:58:53] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-06-05 15:58:53] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 94/138 places, 341/955 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 63575 ms. Remains : 94/138 places, 341/955 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
FORMULA BugTracking-PT-q3m016-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40028 steps (8 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 384856 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :0 out of 2
Probabilistic random walk after 384856 steps, saw 218687 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
[2025-06-05 15:58:56] [INFO ] Flow matrix only has 317 transitions (discarded 24 similar events)
// Phase 1: matrix 317 rows 93 cols
[2025-06-05 15:58:56] [INFO ] Computed 8 invariants in 1 ms
[2025-06-05 15:58:56] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:58:56] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 37/46 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 200/246 variables, 35/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 21/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/248 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/248 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/248 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 86/334 variables, 27/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/334 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/334 variables, 14/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/334 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 67/401 variables, 11/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/401 variables, 14/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/401 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/402 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/402 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/402 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 8/410 variables, 8/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/410 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/410 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/410 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 155 constraints, problems are : Problem set: 0 solved, 2 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, ReadFeed: 53/53 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 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 37/46 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 200/246 variables, 35/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 21/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/248 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/248 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/248 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 86/334 variables, 27/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/334 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/334 variables, 14/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/334 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 67/401 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/401 variables, 14/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/401 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 1/402 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/402 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/402 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 8/410 variables, 8/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/410 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/410 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/410 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 410/410 variables, and 157 constraints, problems are : Problem set: 0 solved, 2 unsolved in 521 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 829ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 273 ms.
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 341/341 transitions.
Applied a total of 0 rules in 7 ms. Remains 93 /93 variables (removed 0) and now considering 341/341 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 93/93 places, 341/341 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 341/341 transitions.
Applied a total of 0 rules in 5 ms. Remains 93 /93 variables (removed 0) and now considering 341/341 (removed 0) transitions.
[2025-06-05 15:58:57] [INFO ] Flow matrix only has 317 transitions (discarded 24 similar events)
[2025-06-05 15:58:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:58:57] [INFO ] Implicit Places using invariants in 126 ms returned []
[2025-06-05 15:58:57] [INFO ] Flow matrix only has 317 transitions (discarded 24 similar events)
[2025-06-05 15:58:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:58:58] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-06-05 15:58:58] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:58:58] [INFO ] Redundant transitions in 4 ms returned []
Running 340 sub problems to find dead transitions.
[2025-06-05 15:58:58] [INFO ] Flow matrix only has 317 transitions (discarded 24 similar events)
[2025-06-05 15:58:58] [INFO ] Invariant cache hit.
[2025-06-05 15:58:58] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
At refinement iteration 2 (OVERLAPS) 317/410 variables, 93/101 constraints. Problems are: Problem set: 4 solved, 336 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 53/154 constraints. Problems are: Problem set: 4 solved, 336 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 0/154 constraints. Problems are: Problem set: 4 solved, 336 unsolved
At refinement iteration 5 (OVERLAPS) 0/410 variables, 0/154 constraints. Problems are: Problem set: 4 solved, 336 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 154 constraints, problems are : Problem set: 4 solved, 336 unsolved in 10138 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 336 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 8/8 constraints. Problems are: Problem set: 4 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/8 constraints. Problems are: Problem set: 4 solved, 336 unsolved
At refinement iteration 2 (OVERLAPS) 317/410 variables, 93/101 constraints. Problems are: Problem set: 4 solved, 336 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 53/154 constraints. Problems are: Problem set: 4 solved, 336 unsolved
Problem TDEAD213 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD336 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 336/490 constraints. Problems are: Problem set: 15 solved, 325 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:59:17] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:59:18] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:59:18] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 3 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:59:21] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:59:21] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 3 ms to minimize.
Problem TDEAD217 is UNSAT
Problem TDEAD68 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/410 variables, 5/495 constraints. Problems are: Problem set: 56 solved, 284 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:59:33] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:59:33] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 2/497 constraints. Problems are: Problem set: 56 solved, 284 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/410 variables, and 497 constraints, problems are : Problem set: 56 solved, 284 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 336/340 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40336ms problems are : Problem set: 56 solved, 284 unsolved
Search for dead transitions found 56 dead transitions in 40337ms
Found 56 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 56 transitions
Dead transitions reduction (with SMT) removed 56 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 93/93 places, 285/341 transitions.
Graph (complete) has 487 edges and 93 vertex of which 90 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 4 places and 21 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 86 transition count 264
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 8 place count 83 transition count 240
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 83 transition count 240
Applied a total of 11 rules in 10 ms. Remains 83 /93 variables (removed 10) and now considering 240/285 (removed 45) transitions.
[2025-06-05 15:59:38] [INFO ] Flow matrix only has 223 transitions (discarded 17 similar events)
// Phase 1: matrix 223 rows 83 cols
[2025-06-05 15:59:38] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:59:38] [INFO ] Implicit Places using invariants in 145 ms returned []
[2025-06-05 15:59:38] [INFO ] Flow matrix only has 223 transitions (discarded 17 similar events)
[2025-06-05 15:59:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:59:38] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-05 15:59:39] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 83/93 places, 240/341 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 41361 ms. Remains : 83/93 places, 240/341 transitions.
RANDOM walk for 40030 steps (8 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 425176 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :0 out of 2
Probabilistic random walk after 425176 steps, saw 244816 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :0
[2025-06-05 15:59:42] [INFO ] Flow matrix only has 223 transitions (discarded 17 similar events)
[2025-06-05 15:59:42] [INFO ] Invariant cache hit.
[2025-06-05 15:59:42] [INFO ] State equation strengthened by 47 read => feed constraints.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:59:42] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 27/38 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 119/157 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 17/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/157 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/159 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/159 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/159 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 79/238 variables, 26/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/238 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/238 variables, 13/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/238 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 60/298 variables, 11/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/298 variables, 13/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/298 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 1/299 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/299 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/299 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 7/306 variables, 7/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/306 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/306 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/306 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 139 constraints, problems are : Problem set: 0 solved, 2 unsolved in 332 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 47/47 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 120.0 s and query timeout 12000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 27/38 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 119/157 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 17/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/157 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/157 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/159 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/159 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/159 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 79/238 variables, 26/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/238 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/238 variables, 13/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/238 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 60/298 variables, 11/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/298 variables, 13/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/298 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 1/299 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/299 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/299 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 7/306 variables, 7/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/306 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/306 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/306 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 141 constraints, problems are : Problem set: 0 solved, 2 unsolved in 414 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 753ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 238 ms.
Support contains 3 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 240/240 transitions.
Applied a total of 0 rules in 4 ms. Remains 83 /83 variables (removed 0) and now considering 240/240 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 83/83 places, 240/240 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 240/240 transitions.
Applied a total of 0 rules in 4 ms. Remains 83 /83 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-05 15:59:43] [INFO ] Flow matrix only has 223 transitions (discarded 17 similar events)
[2025-06-05 15:59:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:59:43] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-06-05 15:59:43] [INFO ] Flow matrix only has 223 transitions (discarded 17 similar events)
[2025-06-05 15:59:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:59:43] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-05 15:59:43] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:59:43] [INFO ] Redundant transitions in 1 ms returned []
Running 239 sub problems to find dead transitions.
[2025-06-05 15:59:43] [INFO ] Flow matrix only has 223 transitions (discarded 17 similar events)
[2025-06-05 15:59:43] [INFO ] Invariant cache hit.
[2025-06-05 15:59:43] [INFO ] State equation strengthened by 47 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (OVERLAPS) 223/306 variables, 83/91 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:59:47] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 139 constraints, problems are : Problem set: 0 solved, 239 unsolved in 11673 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (OVERLAPS) 223/306 variables, 83/92 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 47/139 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Problem TDEAD110 is UNSAT
Problem TDEAD115 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 239/378 constraints. Problems are: Problem set: 2 solved, 237 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:00:02] [INFO ] Deduced a trap along path composed of 6 places in 44 ms of which 4 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD29 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 1/379 constraints. Problems are: Problem set: 7 solved, 232 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:00:09] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:00:09] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:00:09] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:00:09] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:00:11] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 5/384 constraints. Problems are: Problem set: 7 solved, 232 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:00:16] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:00:17] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:00:17] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:00:18] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:00:18] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:00:20] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:00:21] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:00:22] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 8/392 constraints. Problems are: Problem set: 7 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/306 variables, and 392 constraints, problems are : Problem set: 7 solved, 232 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 41771ms problems are : Problem set: 7 solved, 232 unsolved
Search for dead transitions found 7 dead transitions in 41773ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 83/83 places, 233/240 transitions.
Reduce places removed 1 places and 7 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 82 transition count 226
Applied a total of 1 rules in 6 ms. Remains 82 /83 variables (removed 1) and now considering 226/233 (removed 7) transitions.
[2025-06-05 16:00:25] [INFO ] Flow matrix only has 210 transitions (discarded 16 similar events)
// Phase 1: matrix 210 rows 82 cols
[2025-06-05 16:00:25] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:00:25] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-06-05 16:00:25] [INFO ] Flow matrix only has 210 transitions (discarded 16 similar events)
[2025-06-05 16:00:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:00:25] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-05 16:00:25] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 82/83 places, 226/240 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 42570 ms. Remains : 82/83 places, 226/240 transitions.
RANDOM walk for 40015 steps (8 resets) in 104 ms. (381 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 427037 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :0 out of 2
Probabilistic random walk after 427037 steps, saw 243680 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
[2025-06-05 16:00:28] [INFO ] Flow matrix only has 210 transitions (discarded 16 similar events)
[2025-06-05 16:00:28] [INFO ] Invariant cache hit.
[2025-06-05 16:00:28] [INFO ] State equation strengthened by 47 read => feed constraints.
Starting Z3 with timeout 135.0 s and query timeout 13500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 26/37 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 111/148 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/150 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/150 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/150 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 79/229 variables, 26/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/229 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/229 variables, 13/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/229 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 55/284 variables, 11/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/284 variables, 13/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/284 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/285 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/285 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/285 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 7/292 variables, 7/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/292 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/292 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/292 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 137 constraints, problems are : Problem set: 0 solved, 2 unsolved in 253 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 135.0 s and query timeout 13500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 26/37 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 111/148 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:00:29] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/148 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/148 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/150 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/150 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/150 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 79/229 variables, 26/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/229 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/229 variables, 13/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/229 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 55/284 variables, 11/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/284 variables, 13/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/284 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 1/285 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/285 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/285 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 7/292 variables, 7/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/292 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/292 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/292 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 140 constraints, problems are : Problem set: 0 solved, 2 unsolved in 472 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 734ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 231 ms.
Support contains 3 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 226/226 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 226/226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 82/82 places, 226/226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 226/226 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 226/226 (removed 0) transitions.
[2025-06-05 16:00:29] [INFO ] Flow matrix only has 210 transitions (discarded 16 similar events)
[2025-06-05 16:00:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:00:29] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-06-05 16:00:29] [INFO ] Flow matrix only has 210 transitions (discarded 16 similar events)
[2025-06-05 16:00:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:00:30] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-05 16:00:30] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 16:00:30] [INFO ] Redundant transitions in 1 ms returned []
Running 225 sub problems to find dead transitions.
[2025-06-05 16:00:30] [INFO ] Flow matrix only has 210 transitions (discarded 16 similar events)
[2025-06-05 16:00:30] [INFO ] Invariant cache hit.
[2025-06-05 16:00:30] [INFO ] State equation strengthened by 47 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
At refinement iteration 3 (OVERLAPS) 210/292 variables, 82/90 constraints. Problems are: Problem set: 12 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 47/137 constraints. Problems are: Problem set: 12 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:00:34] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 1/138 constraints. Problems are: Problem set: 12 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/138 constraints. Problems are: Problem set: 12 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 0/292 variables, 0/138 constraints. Problems are: Problem set: 12 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 138 constraints, problems are : Problem set: 12 solved, 213 unsolved in 10493 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 213 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 12 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 12 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 1/9 constraints. Problems are: Problem set: 12 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/9 constraints. Problems are: Problem set: 12 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 210/292 variables, 82/91 constraints. Problems are: Problem set: 12 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 47/138 constraints. Problems are: Problem set: 12 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 213/351 constraints. Problems are: Problem set: 12 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:00:46] [INFO ] Deduced a trap along path composed of 6 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:00:49] [INFO ] Deduced a trap along path composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 2/353 constraints. Problems are: Problem set: 12 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:00:51] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:00:51] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:00:51] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 3/356 constraints. Problems are: Problem set: 12 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:00:56] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 1/357 constraints. Problems are: Problem set: 12 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:01:00] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:01:00] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:01:01] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 3/360 constraints. Problems are: Problem set: 12 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:01:05] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:01:05] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:01:06] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/292 variables, 3/363 constraints. Problems are: Problem set: 12 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 292/292 variables, and 363 constraints, problems are : Problem set: 12 solved, 213 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 213/225 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 40583ms problems are : Problem set: 12 solved, 213 unsolved
Search for dead transitions found 12 dead transitions in 40585ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 82/82 places, 214/226 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 16:01:10] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 40982 ms. Remains : 82/82 places, 214/226 transitions.
RANDOM walk for 40018 steps (8 resets) in 95 ms. (416 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 437404 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :0 out of 2
Probabilistic random walk after 437404 steps, saw 250431 distinct states, run finished after 3001 ms. (steps per millisecond=145 ) properties seen :0
[2025-06-05 16:01:13] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
// Phase 1: matrix 198 rows 82 cols
[2025-06-05 16:01:13] [INFO ] Computed 8 invariants in 2 ms
[2025-06-05 16:01:13] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 150.0 s and query timeout 15000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:01:13] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 24/35 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 100/135 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 16/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/135 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/137 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/137 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/137 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 80/217 variables, 27/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/217 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/217 variables, 13/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/217 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 55/272 variables, 11/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/272 variables, 13/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/272 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 1/273 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/273 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/273 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 7/280 variables, 7/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/280 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/280 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/280 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 136 constraints, problems are : Problem set: 0 solved, 2 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 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 150.0 s and query timeout 15000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 24/35 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 100/135 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 16/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/135 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/135 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/137 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/137 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/137 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 80/217 variables, 27/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/217 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/217 variables, 13/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/217 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 55/272 variables, 11/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/272 variables, 13/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/272 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 1/273 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/273 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/273 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 7/280 variables, 7/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/280 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/280 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/280 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 138 constraints, problems are : Problem set: 0 solved, 2 unsolved in 385 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 700ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 241 ms.
Support contains 3 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 82 /82 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 82/82 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2025-06-05 16:01:14] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
[2025-06-05 16:01:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:01:14] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-06-05 16:01:14] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
[2025-06-05 16:01:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:01:15] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-06-05 16:01:15] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 16:01:15] [INFO ] Redundant transitions in 1 ms returned []
Running 213 sub problems to find dead transitions.
[2025-06-05 16:01:15] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
[2025-06-05 16:01:15] [INFO ] Invariant cache hit.
[2025-06-05 16:01:15] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 198/280 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:01:19] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 0/280 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 136 constraints, problems are : Problem set: 0 solved, 213 unsolved in 11970 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 198/280 variables, 82/91 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 45/136 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 213/349 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:01:32] [INFO ] Deduced a trap along path composed of 6 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:01:37] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:01:37] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:01:37] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:01:38] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 4/354 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:01:42] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 280/280 variables, and 355 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 42055ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 42055ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42453 ms. Remains : 82/82 places, 214/214 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 326 edges and 82 vertex of which 80 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 80 transition count 197
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 28 place count 70 transition count 155
Iterating global reduction 1 with 10 rules applied. Total rules applied 38 place count 70 transition count 155
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 69 transition count 154
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 69 transition count 154
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 68 transition count 153
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 68 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 45 place count 67 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 66 transition count 151
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 55 place count 61 transition count 147
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 59 place count 59 transition count 150
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 63 place count 59 transition count 146
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 67 place count 55 transition count 146
Applied a total of 67 rules in 23 ms. Remains 55 /82 variables (removed 27) and now considering 146/214 (removed 68) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 146 rows 55 cols
[2025-06-05 16:01:57] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 16:01:57] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-06-05 16:01:57] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 16:01:57] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-06-05 16:01:57] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-06-05 16:01:57] [INFO ] After 93ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-05 16:01:57] [INFO ] After 148ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-06-05 16:01:57] [INFO ] Flatten gal took : 11 ms
[2025-06-05 16:01:57] [INFO ] Flatten gal took : 9 ms
[2025-06-05 16:01:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13610183609737885823.gal : 3 ms
[2025-06-05 16:01:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17219507204483437334.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13610183609737885823.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17219507204483437334.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality17219507204483437334.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 17
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :17 after 152
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :152 after 713
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :713 after 1818
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1818 after 4011
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :4011 after 8380
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :8380 after 17101
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :17101 after 34526
Detected timeout of ITS tools.
[2025-06-05 16:02:12] [INFO ] Flatten gal took : 13 ms
[2025-06-05 16:02:12] [INFO ] Applying decomposition
[2025-06-05 16:02:12] [INFO ] Flatten gal took : 7 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/graph6211610629619347899.txt' '-o' '/tmp/graph6211610629619347899.bin' '-w' '/tmp/graph6211610629619347899.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6211610629619347899.bin' '-l' '-1' '-v' '-w' '/tmp/graph6211610629619347899.weights' '-q' '0' '-e' '0.001'
[2025-06-05 16:02:12] [INFO ] Decomposing Gal with order
[2025-06-05 16:02:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 16:02:13] [INFO ] Removed a total of 138 redundant transitions.
[2025-06-05 16:02:13] [INFO ] Flatten gal took : 98 ms
[2025-06-05 16:02:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 12 ms.
[2025-06-05 16:02:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality589199068504540567.gal : 10 ms
[2025-06-05 16:02:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1875214789977020977.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality589199068504540567.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1875214789977020977.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/ReachabilityCardinality1875214789977020977.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :2 after 17
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :17 after 3281
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :3281 after 3417
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3417 after 151351
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :151351 after 2.95025e+06
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2.95025e+06 after 2.91363e+07
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2.91363e+07 after 5.18521e+09
Reachability property BugTracking-PT-q3m016-ReachabilityCardinality-2025-03 is true.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5.18521e+09 after 1.99462e+12
Reachability property BugTracking-PT-q3m016-ReachabilityCardinality-2023-13 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,7.27438e+13,7.82991,129392,1380,6881,88178,112180,160,284327,155,1.28478e+06,0
Total reachable state count : 72743774972166

Verifying 2 reachability properties.
Reachability property BugTracking-PT-q3m016-ReachabilityCardinality-2025-03 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BugTracking-PT-q3m016-ReachabilityCardinality-2025-03,39984,7.83865,129520,34,141,88178,112180,166,284327,160,1.28478e+06,0
Reachability property BugTracking-PT-q3m016-ReachabilityCardinality-2023-13 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BugTracking-PT-q3m016-ReachabilityCardinality-2023-13,17136,7.83993,129520,31,104,88178,112180,168,284327,162,1.28478e+06,0
Over-approximation ignoring read arcs solved 0 properties in 23662 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-05 16:02:21] [INFO ] Flatten gal took : 179 ms
[2025-06-05 16:02:21] [INFO ] Applying decomposition
[2025-06-05 16:02:21] [INFO ] Flatten gal took : 158 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/graph13019089971243197808.txt' '-o' '/tmp/graph13019089971243197808.bin' '-w' '/tmp/graph13019089971243197808.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13019089971243197808.bin' '-l' '-1' '-v' '-w' '/tmp/graph13019089971243197808.weights' '-q' '0' '-e' '0.001'
[2025-06-05 16:02:22] [INFO ] Decomposing Gal with order
[2025-06-05 16:02:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 16:02:22] [INFO ] Removed a total of 399 redundant transitions.
[2025-06-05 16:02:22] [INFO ] Flatten gal took : 308 ms
[2025-06-05 16:02:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 301 labels/synchronizations in 31 ms.
[2025-06-05 16:02:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality159513073202784904.gal : 36 ms
[2025-06-05 16:02:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8884848443382776679.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality159513073202784904.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8884848443382776679.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/ReachabilityCardinality8884848443382776679.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 1785
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1785 after 2907
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :2907 after 11679
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :11679 after 12736
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :12736 after 12924
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :12924 after 15828
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :15828 after 16692
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :16692 after 115761
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :115761 after 117784
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :117784 after 300677
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :300677 after 364644
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :364644 after 1.38746e+06
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :1.38746e+06 after 3.77711e+06
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :3.77711e+06 after 1.86742e+07
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :1.86742e+07 after 6.51023e+07
SDD proceeding with computation,2 properties remain. new max is 524288
SDD size :6.51023e+07 after 9.01332e+07
Detected timeout of ITS tools.
[2025-06-05 16:32:27] [INFO ] Flatten gal took : 677 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8344885995968979636
[2025-06-05 16:32:29] [INFO ] Applying decomposition
[2025-06-05 16:32:29] [INFO ] Flatten gal took : 313 ms
[2025-06-05 16:32:29] [INFO ] Computing symmetric may disable matrix : 214 transitions.
[2025-06-05 16:32:30] [INFO ] Computation of Complete disable matrix. took 95 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 16:32:30] [INFO ] Computing symmetric may enable matrix : 214 transitions.
[2025-06-05 16:32:30] [INFO ] Computation of Complete enable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 16:32:30] [INFO ] Computing Do-Not-Accords matrix : 214 transitions.
[2025-06-05 16:32:30] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 16:32:31] [INFO ] Built C files in 2473ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8344885995968979636
Running compilation step : cd /tmp/ltsmin8344885995968979636;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/graph5770651585534114947.txt' '-o' '/tmp/graph5770651585534114947.bin' '-w' '/tmp/graph5770651585534114947.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5770651585534114947.bin' '-l' '-1' '-v' '-w' '/tmp/graph5770651585534114947.weights' '-q' '0' '-e' '0.001'
[2025-06-05 16:32:33] [INFO ] Decomposing Gal with order
[2025-06-05 16:32:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 16:32:33] [INFO ] Removed a total of 5 redundant transitions.
[2025-06-05 16:32:33] [INFO ] Flatten gal took : 156 ms
[2025-06-05 16:32:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 6 ms.
[2025-06-05 16:32:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8678471369145691277.gal : 17 ms
[2025-06-05 16:32:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18331213959527861182.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8678471369145691277.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18331213959527861182.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality18331213959527861182.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 17
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :17 after 34
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :34 after 281
Compilation finished in 1942 ms.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :281 after 411
Running link step : cd /tmp/ltsmin8344885995968979636;'gcc' '-shared' '-o' 'gal.so' 'model.o'
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :411 after 1224
Link finished in 88 ms.
Running LTSmin : cd /tmp/ltsmin8344885995968979636;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'BugTrackingPTq3m016ReachabilityCardinality202503==true'
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1224 after 4530
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :4530 after 10741
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :10741 after 22404
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :22404 after 41927
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :41927 after 68792
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :68792 after 155361
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :155361 after 298231
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :298231 after 647737
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :647737 after 1.39382e+06
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :1.39382e+06 after 2.90157e+06
SDD proceeding with computation,2 properties remain. new max is 524288
SDD size :2.90157e+06 after 6.30889e+06
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin8344885995968979636;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'BugTrackingPTq3m016ReachabilityCardinality202503==true'
Running LTSmin : cd /tmp/ltsmin8344885995968979636;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'BugTrackingPTq3m016ReachabilityCardinality202313==true'
SDD proceeding with computation,2 properties remain. new max is 1048576
SDD size :6.30889e+06 after 2.18963e+07

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="BugTracking-PT-q3m016"
export BK_EXAMINATION="ReachabilityCardinality"
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 BugTracking-PT-q3m016, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r016-smll-174853765300510"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q3m016.tgz
mv BugTracking-PT-q3m016 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;