About the Execution of ITS-Tools for ShieldIIPt-PT-020B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | T?TTTTFFFFFFTTTT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r198-tall-174894532900535.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 ShieldIIPt-PT-020B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894532900535
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K 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 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 338K 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 ShieldIIPt-PT-020B-ReachabilityFireability-2025-00
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2025-01
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2025-02
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2025-03
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2025-04
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2025-05
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2025-06
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2025-07
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2025-08
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2025-09
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2025-10
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2025-11
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2025-12
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2025-13
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2025-14
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2025-15
=== Now, execution of the tool begins
BK_START 1749140137971
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-020B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-05 16:15:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 16:15:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 16:15:39] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2025-06-05 16:15:39] [INFO ] Transformed 1403 places.
[2025-06-05 16:15:39] [INFO ] Transformed 1303 transitions.
[2025-06-05 16:15:39] [INFO ] Found NUPN structural information;
[2025-06-05 16:15:39] [INFO ] Parsed PT model containing 1403 places and 1303 transitions and 3246 arcs in 249 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2025-06-05 16:15:40] [INFO ] Flatten gal took : 225 ms
[2025-06-05 16:15:40] [INFO ] Flatten gal took : 70 ms
RANDOM walk for 40000 steps (8 resets) in 2425 ms. (16 steps per ms) remains 8/16 properties
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2025-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2025-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-05 16:15:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10610294354414486336.gal : 47 ms
[2025-06-05 16:15:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11314507328048744462.prop : 2 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/ReachabilityCardinality10610294354414486336.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11314507328048744462.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 347 ms. (114 steps per ms) remains 8/8 properties
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
BEST_FIRST walk for 40004 steps (8 resets) in 281 ms. (141 steps per ms) remains 8/8 properties
Loading property file /tmp/ReachabilityCardinality11314507328048744462.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 589 ms. (67 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 8/8 properties
// Phase 1: matrix 1303 rows 1403 cols
[2025-06-05 16:15:41] [INFO ] Computed 181 invariants in 35 ms
Excessive predecessor constraint size, skipping predecessor.
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/135 variables, 135/135 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :19 after 28
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :28 after 277
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :277 after 733
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :733 after 88423
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :88423 after 5.78704e+08
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :5.78704e+08 after 6.90677e+16
At refinement iteration 2 (OVERLAPS) 963/1098 variables, 128/263 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1098 variables, 963/1226 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1098 variables, 0/1226 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 305/1403 variables, 53/1279 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1403 variables, 305/1584 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1403 variables, 0/1584 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1303/2706 variables, 1403/2987 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2706 variables, 0/2987 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/2706 variables, 0/2987 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2706/2706 variables, and 2987 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2325 ms.
Refiners :[Domain max(s): 1403/1403 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 1403/1403 constraints, PredecessorRefiner: 8/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 135/135 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 963/1098 variables, 128/263 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1098 variables, 963/1226 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:44] [INFO ] Deduced a trap composed of 12 places in 203 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:44] [INFO ] Deduced a trap composed of 12 places in 262 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:44] [INFO ] Deduced a trap composed of 16 places in 201 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:45] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:45] [INFO ] Deduced a trap composed of 22 places in 162 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:45] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:45] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:45] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:45] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:46] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:46] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:46] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:46] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:46] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:46] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:46] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:47] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:47] [INFO ] Deduced a trap composed of 33 places in 111 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:47] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:47] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1098 variables, 20/1246 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:47] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:47] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:47] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:48] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:48] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:48] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:48] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:48] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 11 ms to minimize.
SMT process timed out in 7551ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 135 out of 1403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1403/1403 places, 1303/1303 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 227 transitions
Trivial Post-agglo rules discarded 227 transitions
Performed 227 trivial Post agglomeration. Transition count delta: 227
Iterating post reduction 0 with 227 rules applied. Total rules applied 227 place count 1403 transition count 1076
Reduce places removed 227 places and 0 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Iterating post reduction 1 with 269 rules applied. Total rules applied 496 place count 1176 transition count 1034
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 538 place count 1134 transition count 1034
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 538 place count 1134 transition count 940
Deduced a syphon composed of 94 places in 2 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 188 rules applied. Total rules applied 726 place count 1040 transition count 940
Discarding 124 places :
Symmetric choice reduction at 3 with 124 rule applications. Total rules 850 place count 916 transition count 816
Iterating global reduction 3 with 124 rules applied. Total rules applied 974 place count 916 transition count 816
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 975 place count 916 transition count 815
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 39 Pre rules applied. Total rules applied 975 place count 916 transition count 776
Deduced a syphon composed of 39 places in 3 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 1053 place count 877 transition count 776
Performed 271 Post agglomeration using F-continuation condition.Transition count delta: 271
Deduced a syphon composed of 271 places in 3 ms
Reduce places removed 271 places and 0 transitions.
Iterating global reduction 4 with 542 rules applied. Total rules applied 1595 place count 606 transition count 505
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 1675 place count 566 transition count 518
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1681 place count 566 transition count 512
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1687 place count 560 transition count 512
Partial Free-agglomeration rule applied 19 times.
Drop transitions (Partial Free agglomeration) removed 19 transitions
Iterating global reduction 5 with 19 rules applied. Total rules applied 1706 place count 560 transition count 512
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1707 place count 559 transition count 511
Applied a total of 1707 rules in 372 ms. Remains 559 /1403 variables (removed 844) and now considering 511/1303 (removed 792) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 379 ms. Remains : 559/1403 places, 511/1303 transitions.
RANDOM walk for 40000 steps (8 resets) in 800 ms. (49 steps per ms) remains 6/8 properties
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2025-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2025-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 293 ms. (136 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 369 ms. (108 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 287 ms. (138 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 6/6 properties
// Phase 1: matrix 511 rows 559 cols
[2025-06-05 16:15:49] [INFO ] Computed 181 invariants in 4 ms
[2025-06-05 16:15:49] [INFO ] State equation strengthened by 76 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/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 294/406 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 153/559 variables, 71/181 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/559 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 511/1070 variables, 559/740 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1070 variables, 76/816 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1070 variables, 0/816 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/1070 variables, 0/816 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1070/1070 variables, and 816 constraints, problems are : Problem set: 0 solved, 6 unsolved in 716 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 559/559 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 6/4 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/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 294/406 variables, 110/110 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 16:15:50] [INFO ] Deduced a trap composed of 5 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:15:50] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:50] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:50] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:50] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:50] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:50] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:51] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:51] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:51] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:51] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:51] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:51] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:51] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:51] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:51] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:51] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 17/127 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 16:15:51] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:51] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:51] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:51] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 4/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 153/559 variables, 71/202 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 16:15:51] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:52] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:52] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:52] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:52] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:52] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/559 variables, 6/208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/559 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 511/1070 variables, 559/767 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1070 variables, 76/843 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1070 variables, 4/847 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 16:15:53] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:53] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:53] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:53] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:53] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:53] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1070 variables, 6/853 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 16:15:54] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1070 variables, 1/854 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 16:15:54] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1070 variables, 1/855 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 16:15:54] [INFO ] Deduced a trap along path composed of 5 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:54] [INFO ] Deduced a trap along path composed of 4 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:54] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:55] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:55] [INFO ] Deduced a trap along path composed of 6 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:55] [INFO ] Deduced a trap along path composed of 5 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:15:55] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1070 variables, 7/862 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 16:15:56] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1070 variables, 1/863 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1070 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/1070 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1070/1070 variables, and 863 constraints, problems are : Problem set: 0 solved, 6 unsolved in 7254 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 559/559 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 6/4 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 8017ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 10479 ms.
Support contains 112 out of 559 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 559/559 places, 511/511 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 559 transition count 505
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 553 transition count 505
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 12 place count 553 transition count 502
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 550 transition count 502
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 549 transition count 501
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 549 transition count 501
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 50 place count 534 transition count 486
Renaming transitions due to excessive name length > 1024 char.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 58 place count 530 transition count 488
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 530 transition count 488
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 528 transition count 486
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 527 transition count 486
Applied a total of 64 rules in 279 ms. Remains 527 /559 variables (removed 32) and now considering 486/511 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 279 ms. Remains : 527/559 places, 486/511 transitions.
RANDOM walk for 40000 steps (8 resets) in 416 ms. (95 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 274 ms. (145 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 199 ms. (200 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 136 ms. (291 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 250002 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 6
Probabilistic random walk after 250002 steps, saw 101966 distinct states, run finished after 3007 ms. (steps per millisecond=83 ) properties seen :0
// Phase 1: matrix 486 rows 527 cols
[2025-06-05 16:16:11] [INFO ] Computed 180 invariants in 2 ms
[2025-06-05 16:16:11] [INFO ] State equation strengthened by 21 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 267/379 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/379 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 23/402 variables, 11/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 435/837 variables, 402/523 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/837 variables, 20/543 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/837 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 130/967 variables, 99/642 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/967 variables, 45/687 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/967 variables, 1/688 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/967 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 1/968 variables, 2/690 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/968 variables, 1/691 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/968 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 16/984 variables, 8/699 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/984 variables, 4/703 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 17/1001 variables, 8/711 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1001 variables, 3/714 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1001 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 1/1002 variables, 1/715 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1002 variables, 1/716 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1002 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 2/1004 variables, 1/717 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1004 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 9/1013 variables, 8/725 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1013 variables, 3/728 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1013 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (OVERLAPS) 0/1013 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1013/1013 variables, and 728 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1358 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 527/527 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 6/4 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 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 267/379 variables, 110/110 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 16:16:13] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:13] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:13] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:13] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:13] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:13] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:13] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:13] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:13] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:13] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:14] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:14] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/379 variables, 12/122 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 16:16:14] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:14] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:14] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:14] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/379 variables, 4/126 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 16:16:14] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 1/127 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 16:16:14] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 1/128 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 16:16:14] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 23/402 variables, 11/140 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 16:16:14] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/402 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 435/837 variables, 402/543 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/837 variables, 20/563 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 16:16:15] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/837 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/837 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 130/967 variables, 99/663 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/967 variables, 45/708 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/967 variables, 1/709 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/967 variables, 4/713 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 16:16:15] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:15] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/967 variables, 2/715 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 16:16:16] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:16] [INFO ] Deduced a trap along path composed of 4 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:16] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:16] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:16] [INFO ] Deduced a trap along path composed of 2 places in 30 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:16] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:16] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/967 variables, 7/722 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/967 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 1/968 variables, 2/724 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/968 variables, 1/725 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 16:16:17] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 3 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/968 variables, 1/726 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/968 variables, 0/726 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 16/984 variables, 8/734 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/984 variables, 4/738 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 16:16:18] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 3 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/984 variables, 1/739 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 16:16:18] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:18] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:18] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:18] [INFO ] Deduced a trap along path composed of 4 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:18] [INFO ] Deduced a trap along path composed of 5 places in 29 ms of which 1 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/984 variables, 5/744 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/984 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (OVERLAPS) 17/1001 variables, 8/752 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1001 variables, 3/755 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 16:16:19] [INFO ] Deduced a trap along path composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/1001 variables, 1/756 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1001 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (OVERLAPS) 1/1002 variables, 1/757 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1002 variables, 1/758 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1002 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (OVERLAPS) 2/1004 variables, 1/759 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1004 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 40 (OVERLAPS) 9/1013 variables, 8/767 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1013 variables, 3/770 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 16:16:21] [INFO ] Deduced a trap along path composed of 3 places in 17 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:21] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:21] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:21] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/1013 variables, 4/774 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1013 variables, 0/774 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 44 (OVERLAPS) 0/1013 variables, 0/774 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1013/1013 variables, and 774 constraints, problems are : Problem set: 0 solved, 6 unsolved in 9388 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 527/527 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 6/4 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 17/17 constraints]
After SMT, in 10768ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 3621 ms.
Support contains 112 out of 527 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 527/527 places, 486/486 transitions.
Applied a total of 0 rules in 40 ms. Remains 527 /527 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 527/527 places, 486/486 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 527/527 places, 486/486 transitions.
Applied a total of 0 rules in 10 ms. Remains 527 /527 variables (removed 0) and now considering 486/486 (removed 0) transitions.
[2025-06-05 16:16:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:16:26] [INFO ] Implicit Places using invariants in 277 ms returned []
[2025-06-05 16:16:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:16:26] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-06-05 16:16:27] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 782 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 16:16:27] [INFO ] Redundant transitions in 28 ms returned []
Running 457 sub problems to find dead transitions.
[2025-06-05 16:16:27] [INFO ] Invariant cache hit.
[2025-06-05 16:16:27] [INFO ] State equation strengthened by 21 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (OVERLAPS) 29/527 variables, 93/180 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:37] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:37] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:37] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:37] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:37] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:37] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:37] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:37] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:37] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:37] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:37] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:37] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:38] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:38] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:38] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:38] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:38] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:38] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:38] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:38] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:42] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:42] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:42] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:43] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:43] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:43] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:43] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:43] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:43] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:43] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:43] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:43] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:43] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:44] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:44] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:45] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:45] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:46] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 18/218 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:46] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:47] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:48] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:48] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:16:49] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 5/223 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 527/1013 variables, and 223 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 0/527 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 8/95 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 3 (OVERLAPS) 29/527 variables, 93/188 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 35/223 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:17:02] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 7 (OVERLAPS) 486/1013 variables, 527/751 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1013 variables, 21/772 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1013 variables, 457/1229 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:17:14] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:17:15] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:17:15] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:17:15] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:17:15] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:17:16] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:17:17] [INFO ] Deduced a trap composed of 4 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 16:17:19] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:17:19] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:17:21] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1013 variables, 10/1239 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1013/1013 variables, and 1239 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 527/527 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 54/54 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60129ms problems are : Problem set: 0 solved, 457 unsolved
Search for dead transitions found 0 dead transitions in 60131ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60964 ms. Remains : 527/527 places, 486/486 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 29 times.
Drop transitions (Partial Free agglomeration) removed 29 transitions
Iterating global reduction 0 with 29 rules applied. Total rules applied 29 place count 527 transition count 486
Applied a total of 29 rules in 25 ms. Remains 527 /527 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 486 rows 527 cols
[2025-06-05 16:17:27] [INFO ] Computed 180 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 16:17:27] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 16:17:27] [INFO ] [Nat]Absence check using 180 positive place invariants in 25 ms returned sat
[2025-06-05 16:17:27] [INFO ] After 317ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2025-06-05 16:17:27] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-05 16:17:28] [INFO ] After 256ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:17:28] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:17:28] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:17:28] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:17:28] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:17:28] [INFO ] Deduced a trap composed of 7 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:17:28] [INFO ] Deduced a trap composed of 7 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:17:28] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 5 ms to minimize.
[2025-06-05 16:17:28] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 725 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:17:29] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 3 ms to minimize.
[2025-06-05 16:17:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:17:29] [INFO ] Deduced a trap composed of 4 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:17:29] [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:17:29] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 3 ms to minimize.
[2025-06-05 16:17:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 288 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:17:29] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:17:29] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 4 ms to minimize.
[2025-06-05 16:17:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 169 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:17:29] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 4 ms to minimize.
[2025-06-05 16:17:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:17:29] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:17:29] [INFO ] Deduced a trap composed of 7 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:17:30] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 3 ms to minimize.
[2025-06-05 16:17:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 272 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:17:30] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:17:30] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 3 ms to minimize.
[2025-06-05 16:17:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 184 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:17:30] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 3 ms to minimize.
[2025-06-05 16:17:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
TRAPS : Iteration 2
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:17:30] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 4 ms to minimize.
[2025-06-05 16:17:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:17:30] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 3 ms to minimize.
[2025-06-05 16:17:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:17:30] [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:17:30] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:17:31] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:17:31] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:17:31] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 3 ms to minimize.
[2025-06-05 16:17:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 436 ms
TRAPS : Iteration 3
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:17:31] [INFO ] Deduced a trap composed of 7 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:17:31] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 3 ms to minimize.
[2025-06-05 16:17:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 175 ms
TRAPS : Iteration 4
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:17:31] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 3 ms to minimize.
[2025-06-05 16:17:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:17:32] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:17:32] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 3 ms to minimize.
[2025-06-05 16:17:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 157 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:17:32] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 3 ms to minimize.
[2025-06-05 16:17:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
TRAPS : Iteration 5
[2025-06-05 16:17:32] [INFO ] After 4631ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2025-06-05 16:17:32] [INFO ] After 5316ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2025-06-05 16:17:32] [INFO ] Flatten gal took : 29 ms
[2025-06-05 16:17:32] [INFO ] Flatten gal took : 25 ms
[2025-06-05 16:17:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6567922504275918918.gal : 4 ms
[2025-06-05 16:17:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15842340529518427549.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/ReachabilityCardinality6567922504275918918.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15842340529518427549.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/ReachabilityCardinality15842340529518427549.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :5 after 39
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :39 after 189
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :189 after 23814
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :23814 after 1.1907e+07
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :1.1907e+07 after 7.07276e+10
Detected timeout of ITS tools.
[2025-06-05 16:17:47] [INFO ] Flatten gal took : 23 ms
[2025-06-05 16:17:47] [INFO ] Applying decomposition
[2025-06-05 16:17:47] [INFO ] Flatten gal took : 22 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/graph14799788733169508015.txt' '-o' '/tmp/graph14799788733169508015.bin' '-w' '/tmp/graph14799788733169508015.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14799788733169508015.bin' '-l' '-1' '-v' '-w' '/tmp/graph14799788733169508015.weights' '-q' '0' '-e' '0.001'
[2025-06-05 16:17:48] [INFO ] Decomposing Gal with order
[2025-06-05 16:17:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 16:17:48] [INFO ] Removed a total of 211 redundant transitions.
[2025-06-05 16:17:48] [INFO ] Flatten gal took : 86 ms
[2025-06-05 16:17:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 17 ms.
[2025-06-05 16:17:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4399248621746381559.gal : 8 ms
[2025-06-05 16:17:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1121161804665206358.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/ReachabilityCardinality4399248621746381559.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1121161804665206358.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 ...307
Loading property file /tmp/ReachabilityCardinality1121161804665206358.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :1 after 1323
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :1323 after 59535
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :59535 after 59535
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :59535 after 1.96466e+09
Reachability property ShieldIIPt-PT-020B-ReachabilityFireability-2025-05 is true.
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :7.21571e+17 after 1.25069e+25
Invariant property ShieldIIPt-PT-020B-ReachabilityFireability-2025-09 does not hold.
Invariant property ShieldIIPt-PT-020B-ReachabilityFireability-2025-07 does not hold.
Reachability property ShieldIIPt-PT-020B-ReachabilityFireability-2025-04 is true.
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.25069e+25 after 2.32632e+36
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 36064 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-05 16:18:03] [INFO ] Flatten gal took : 36 ms
[2025-06-05 16:18:03] [INFO ] Applying decomposition
[2025-06-05 16:18:03] [INFO ] Flatten gal took : 36 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/graph1087898243777528551.txt' '-o' '/tmp/graph1087898243777528551.bin' '-w' '/tmp/graph1087898243777528551.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1087898243777528551.bin' '-l' '-1' '-v' '-w' '/tmp/graph1087898243777528551.weights' '-q' '0' '-e' '0.001'
[2025-06-05 16:18:03] [INFO ] Decomposing Gal with order
[2025-06-05 16:18:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 16:18:03] [INFO ] Removed a total of 120 redundant transitions.
[2025-06-05 16:18:03] [INFO ] Flatten gal took : 76 ms
[2025-06-05 16:18:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2025-06-05 16:18:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10043037415082321146.gal : 19 ms
[2025-06-05 16:18:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7179323361638151715.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/ReachabilityCardinality10043037415082321146.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7179323361638151715.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/ReachabilityCardinality7179323361638151715.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :1 after 9029
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :9029 after 4.35204e+15
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :4.35204e+15 after 1.52263e+61
Invariant property ShieldIIPt-PT-020B-ReachabilityFireability-2025-09 does not hold.
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldIIPt-PT-020B-ReachabilityFireability-2025-05 is true.
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldIIPt-PT-020B-ReachabilityFireability-2025-04 is true.
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1.52263e+61 after 1.81434e+71
Detected timeout of ITS tools.
[2025-06-05 16:48:08] [INFO ] Flatten gal took : 429 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin700875229884047451
[2025-06-05 16:48:08] [INFO ] Applying decomposition
[2025-06-05 16:48:08] [INFO ] Computing symmetric may disable matrix : 486 transitions.
[2025-06-05 16:48:08] [INFO ] Flatten gal took : 195 ms
[2025-06-05 16:48:08] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 16:48:08] [INFO ] Computing symmetric may enable matrix : 486 transitions.
[2025-06-05 16:48:10] [INFO ] Computation of Complete enable matrix. took 1324 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 16:48:11] [INFO ] Computing Do-Not-Accords matrix : 486 transitions.
[2025-06-05 16:48:11] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph648260771810044061.txt' '-o' '/tmp/graph648260771810044061.bin' '-w' '/tmp/graph648260771810044061.weights'
[2025-06-05 16:48:11] [INFO ] Built C files in 2769ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin700875229884047451
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph648260771810044061.bin' '-l' '-1' '-v' '-w' '/tmp/graph648260771810044061.weights' '-q' '0' '-e' '0.001'
[2025-06-05 16:48:11] [INFO ] Decomposing Gal with order
[2025-06-05 16:48:11] [INFO ] Rewriting arrays to variables to allow decomposition.
Running compilation step : cd /tmp/ltsmin700875229884047451;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '240' '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'
[2025-06-05 16:48:11] [INFO ] Removed a total of 229 redundant transitions.
[2025-06-05 16:48:11] [INFO ] Flatten gal took : 151 ms
[2025-06-05 16:48:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 148 labels/synchronizations in 75 ms.
[2025-06-05 16:48:12] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability3537991088820637384.gal : 26 ms
[2025-06-05 16:48:12] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability13126654348268894423.prop : 5 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/ReachabilityFireability3537991088820637384.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability13126654348268894423.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/ReachabilityFireability13126654348268894423.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 39
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :39 after 2646
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :2646 after 2.3814e+06
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :2.3814e+06 after 1.52772e+13
Compilation finished in 1637 ms.
Running link step : cd /tmp/ltsmin700875229884047451;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin700875229884047451;'/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' 'ShieldIIPtPT020BReachabilityFireability202501==true'
Invariant property ShieldIIPt-PT-020B-ReachabilityFireability-2025-07 does not hold.
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldIIPt-PT-020B-ReachabilityFireability-2025-06 does not hold.
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.74233e+18 after 1.09698e+48
WARNING : LTSmin timed out (>200 s) on command cd /tmp/ltsmin700875229884047451;'/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' 'ShieldIIPtPT020BReachabilityFireability202501==true'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin700875229884047451;'/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' 'ShieldIIPtPT020BReachabilityFireability202501==true'
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 ReachabilityFireability -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="ShieldIIPt-PT-020B"
export BK_EXAMINATION="ReachabilityFireability"
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 ShieldIIPt-PT-020B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r198-tall-174894532900535"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-020B.tgz
mv ShieldIIPt-PT-020B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;