Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r198-tall-174894533500871.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 ShieldPPPt-PT-010B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894533500871
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K 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:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 185K May 29 14:33 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 ShieldPPPt-PT-010B-ReachabilityFireability-2025-00
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-2025-01
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-2025-02
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-2025-03
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-2025-04
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-2025-05
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-2025-06
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-2025-07
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-2025-08
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-2025-09
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-2025-10
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-2025-11
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-2025-12
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-2025-13
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-2025-14
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1749304067032

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-010B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-07 13:47:48] [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-07 13:47:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 13:47:48] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2025-06-07 13:47:48] [INFO ] Transformed 783 places.
[2025-06-07 13:47:48] [INFO ] Transformed 713 transitions.
[2025-06-07 13:47:48] [INFO ] Found NUPN structural information;
[2025-06-07 13:47:48] [INFO ] Parsed PT model containing 783 places and 713 transitions and 1786 arcs in 215 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2025-06-07 13:47:48] [INFO ] Flatten gal took : 104 ms
RANDOM walk for 40000 steps (8 resets) in 1587 ms. (25 steps per ms) remains 4/16 properties
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-2025-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-2025-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-07 13:47:49] [INFO ] Flatten gal took : 116 ms
BEST_FIRST walk for 40004 steps (8 resets) in 375 ms. (106 steps per ms) remains 4/4 properties
[2025-06-07 13:47:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17441716187442773113.gal : 60 ms
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 4/4 properties
[2025-06-07 13:47:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5737911467044499615.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17441716187442773113.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5737911467044499615.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
BEST_FIRST walk for 40004 steps (8 resets) in 557 ms. (71 steps per ms) remains 4/4 properties
Loading property file /tmp/ReachabilityCardinality5737911467044499615.prop.
BEST_FIRST walk for 40003 steps (8 resets) in 213 ms. (186 steps per ms) remains 4/4 properties
// Phase 1: matrix 713 rows 783 cols
[2025-06-07 13:47:49] [INFO ] Computed 111 invariants in 17 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 12
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :12 after 19
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :19 after 289
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :289 after 7515
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :7515 after 1.93828e+08
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1.93828e+08 after 3.61401e+15
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :3.61401e+15 after 1.96785e+29
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 573/648 variables, 88/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/648 variables, 573/736 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/648 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 135/783 variables, 23/759 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/783 variables, 135/894 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/783 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 713/1496 variables, 783/1677 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1496 variables, 0/1677 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1496 variables, 0/1677 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1496/1496 variables, and 1677 constraints, problems are : Problem set: 0 solved, 4 unsolved in 966 ms.
Refiners :[Domain max(s): 783/783 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 783/783 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 573/648 variables, 88/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/648 variables, 573/736 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:50] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:51] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:51] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:51] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:51] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:51] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:51] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:51] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:51] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:51] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:52] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:52] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:52] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:52] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:52] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:52] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:52] [INFO ] Deduced a trap composed of 16 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-07 13:47:52] [INFO ] Deduced a trap composed of 20 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-07 13:47:52] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/648 variables, 19/755 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/648 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 135/783 variables, 23/778 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/783 variables, 135/913 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:53] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:53] [INFO ] Deduced a trap composed of 27 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-07 13:47:53] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:53] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/783 variables, 4/917 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:53] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/783 variables, 1/918 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/783 variables, 0/918 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 713/1496 variables, 783/1701 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1496 variables, 4/1705 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:54] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:54] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:54] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:55] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:55] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:55] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1496/1496 variables, and 1711 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5009 ms.
Refiners :[Domain max(s): 783/783 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 783/783 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6064ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 75 out of 783 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 783/783 places, 713/713 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 139 place count 783 transition count 574
Reduce places removed 139 places and 0 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 1 with 162 rules applied. Total rules applied 301 place count 644 transition count 551
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 324 place count 621 transition count 551
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 324 place count 621 transition count 511
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 404 place count 581 transition count 511
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 454 place count 531 transition count 461
Iterating global reduction 3 with 50 rules applied. Total rules applied 504 place count 531 transition count 461
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 504 place count 531 transition count 446
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 534 place count 516 transition count 446
Performed 146 Post agglomeration using F-continuation condition.Transition count delta: 146
Deduced a syphon composed of 146 places in 1 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 3 with 292 rules applied. Total rules applied 826 place count 370 transition count 300
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 4 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 860 place count 353 transition count 300
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 861 place count 353 transition count 299
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 862 place count 352 transition count 299
Partial Free-agglomeration rule applied 27 times.
Drop transitions (Partial Free agglomeration) removed 27 transitions
Iterating global reduction 4 with 27 rules applied. Total rules applied 889 place count 352 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 890 place count 351 transition count 298
Applied a total of 890 rules in 276 ms. Remains 351 /783 variables (removed 432) and now considering 298/713 (removed 415) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 286 ms. Remains : 351/783 places, 298/713 transitions.
RANDOM walk for 40000 steps (8 resets) in 1040 ms. (38 steps per ms) remains 2/4 properties
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-2025-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 2/2 properties
// Phase 1: matrix 298 rows 351 cols
[2025-06-07 13:47:56] [INFO ] Computed 111 invariants in 2 ms
[2025-06-07 13:47:56] [INFO ] State equation strengthened by 16 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/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 138/177 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 113/290 variables, 44/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 267/557 variables, 290/377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 14/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 66/623 variables, 42/433 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/623 variables, 14/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/623 variables, 2/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/623 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 4/627 variables, 4/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/627 variables, 4/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/627 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 4/631 variables, 2/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/631 variables, 2/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/631 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 16/647 variables, 11/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/647 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/647 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/649 variables, 3/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/649 variables, 2/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/649 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/649 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 649/649 variables, and 478 constraints, problems are : Problem set: 0 solved, 2 unsolved in 382 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 351/351 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 138/177 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:56] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:56] [INFO ] Deduced a trap composed of 7 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-07 13:47:56] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:56] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 113/290 variables, 44/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:57] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:57] [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-07 13:47:57] [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-07 13:47:57] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 267/557 variables, 290/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/557 variables, 14/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/557 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:57] [INFO ] Deduced a trap composed of 7 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-07 13:47:57] [INFO ] Deduced a trap composed of 6 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-07 13:47:57] [INFO ] Deduced a trap composed of 11 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-07 13:47:57] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/557 variables, 4/404 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:57] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/557 variables, 1/405 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:57] [INFO ] Deduced a trap along path composed of 4 places in 30 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:57] [INFO ] Deduced a trap along path composed of 5 places in 30 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:57] [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-07 13:47:57] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:57] [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-07 13:47:57] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:58] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:58] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/557 variables, 8/413 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:58] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/557 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:58] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/557 variables, 1/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/557 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 66/623 variables, 42/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/623 variables, 14/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/623 variables, 2/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/623 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:58] [INFO ] Deduced a trap along path composed of 2 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:58] [INFO ] Deduced a trap along path composed of 4 places in 18 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:58] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/623 variables, 3/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:58] [INFO ] Deduced a trap along path composed of 2 places in 14 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:58] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:59] [INFO ] Deduced a trap along path composed of 2 places in 17 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/623 variables, 3/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:59] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/623 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/623 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 4/627 variables, 4/485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/627 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/627 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 4/631 variables, 2/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/631 variables, 2/493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/631 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 16/647 variables, 11/504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/647 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:47:59] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 2 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/647 variables, 1/506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/647 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 2/649 variables, 3/509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/649 variables, 2/511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/649 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (OVERLAPS) 0/649 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 649/649 variables, and 511 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3386 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 351/351 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 16/16 constraints]
After SMT, in 3797ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-2025-03 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 218 ms.
Support contains 24 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 298/298 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 351 transition count 290
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 18 place count 343 transition count 288
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 342 transition count 288
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 19 place count 342 transition count 278
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 39 place count 332 transition count 278
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 41 place count 330 transition count 276
Iterating global reduction 3 with 2 rules applied. Total rules applied 43 place count 330 transition count 276
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 43 place count 330 transition count 274
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 47 place count 328 transition count 274
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 113 place count 295 transition count 241
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 125 place count 289 transition count 241
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 128 place count 289 transition count 241
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 132 place count 285 transition count 237
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 133 place count 284 transition count 237
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 133 place count 284 transition count 235
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 137 place count 282 transition count 235
Applied a total of 137 rules in 72 ms. Remains 282 /351 variables (removed 69) and now considering 235/298 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 282/351 places, 235/298 transitions.
RANDOM walk for 40000 steps (8 resets) in 232 ms. (171 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 818049 steps, run timeout after 3001 ms. (steps per millisecond=272 ) properties seen :0 out of 1
Probabilistic random walk after 818049 steps, saw 600131 distinct states, run finished after 3008 ms. (steps per millisecond=271 ) properties seen :0
// Phase 1: matrix 235 rows 282 cols
[2025-06-07 13:48:03] [INFO ] Computed 110 invariants in 4 ms
[2025-06-07 13:48:03] [INFO ] State equation strengthened by 18 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/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/107 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/139 variables, 14/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 158/297 variables, 139/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 12/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 130/427 variables, 81/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 30/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/427 variables, 6/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/427 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/435 variables, 8/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/435 variables, 8/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/435 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 15/450 variables, 8/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/450 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/450 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 54/504 variables, 43/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/504 variables, 13/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/504 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/505 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/505 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/505 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/507 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/507 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 10/517 variables, 9/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/517 variables, 3/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/517 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/517 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 517/517 variables, and 410 constraints, problems are : Problem set: 0 solved, 1 unsolved in 257 ms.
Refiners :[Positive P Invariants (semi-flows): 110/110 constraints, State Equation: 282/282 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/107 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:48:03] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 32/139 variables, 14/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 158/297 variables, 139/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 12/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 130/427 variables, 81/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/427 variables, 30/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/427 variables, 6/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/427 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:48:04] [INFO ] Deduced a trap composed of 5 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-07 13:48:04] [INFO ] Deduced a trap composed of 7 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-07 13:48:04] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:48:04] [INFO ] Deduced a trap composed of 5 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-07 13:48:04] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:48:04] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/427 variables, 6/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:48:04] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/427 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:48:04] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/427 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/427 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/435 variables, 8/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/435 variables, 8/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/435 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 15/450 variables, 8/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/450 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/450 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 54/504 variables, 43/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/504 variables, 13/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:48:04] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:48:04] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/504 variables, 2/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/504 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/505 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/505 variables, 1/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/505 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 2/507 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/507 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 10/517 variables, 9/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/517 variables, 3/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:48:05] [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-07 13:48:05] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:48:05] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:48:05] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:48:05] [INFO ] Deduced a trap along path composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/517 variables, 5/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/517 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 0/517 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 517/517 variables, and 427 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1599 ms.
Refiners :[Positive P Invariants (semi-flows): 110/110 constraints, State Equation: 282/282 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 1870ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 61 ms.
Support contains 24 out of 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 235/235 transitions.
Applied a total of 0 rules in 45 ms. Remains 282 /282 variables (removed 0) and now considering 235/235 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 282/282 places, 235/235 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 235/235 transitions.
Applied a total of 0 rules in 7 ms. Remains 282 /282 variables (removed 0) and now considering 235/235 (removed 0) transitions.
[2025-06-07 13:48:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 13:48:05] [INFO ] Implicit Places using invariants in 207 ms returned [261, 265]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 219 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 280/282 places, 235/235 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 278 transition count 233
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 278 transition count 233
Applied a total of 4 rules in 11 ms. Remains 278 /280 variables (removed 2) and now considering 233/235 (removed 2) transitions.
// Phase 1: matrix 233 rows 278 cols
[2025-06-07 13:48:05] [INFO ] Computed 108 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 13:48:05] [INFO ] Implicit Places using invariants in 151 ms returned []
[2025-06-07 13:48:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 13:48:06] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-07 13:48:06] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 278/282 places, 233/235 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 690 ms. Remains : 278/282 places, 233/235 transitions.
RANDOM walk for 40000 steps (8 resets) in 230 ms. (173 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 839000 steps, run timeout after 3001 ms. (steps per millisecond=279 ) properties seen :0 out of 1
Probabilistic random walk after 839000 steps, saw 613183 distinct states, run finished after 3001 ms. (steps per millisecond=279 ) properties seen :0
[2025-06-07 13:48:09] [INFO ] Invariant cache hit.
[2025-06-07 13:48:09] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/107 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/139 variables, 14/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 157/296 variables, 139/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 11/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 127/423 variables, 79/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 30/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 5/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/430 variables, 7/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/430 variables, 7/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/430 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 14/444 variables, 7/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/444 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 54/498 variables, 43/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/498 variables, 13/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/498 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/499 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/499 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/499 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/501 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/501 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 10/511 variables, 9/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/511 variables, 3/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/511 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/511 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 511/511 variables, and 402 constraints, problems are : Problem set: 0 solved, 1 unsolved in 222 ms.
Refiners :[Positive P Invariants (semi-flows): 108/108 constraints, State Equation: 278/278 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/107 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:48:09] [INFO ] Deduced a trap composed of 6 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-07 13:48:09] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 32/139 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 157/296 variables, 139/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 11/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 127/423 variables, 79/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 30/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 5/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:48:09] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:48:09] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:48:10] [INFO ] Deduced a trap composed of 3 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-07 13:48:10] [INFO ] Deduced a trap composed of 4 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-07 13:48:10] [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-07 13:48:10] [INFO ] Deduced a trap composed of 4 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-07 13:48:10] [INFO ] Deduced a trap composed of 5 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-07 13:48:10] [INFO ] Deduced a trap composed of 5 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-07 13:48:10] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 9/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 7/430 variables, 7/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/430 variables, 7/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/430 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/444 variables, 7/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/444 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 54/498 variables, 43/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/498 variables, 13/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:48:10] [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-07 13:48:10] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:48:10] [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-07 13:48:10] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/498 variables, 4/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/498 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 1/499 variables, 1/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/499 variables, 1/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/499 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/501 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/501 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 10/511 variables, 9/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/511 variables, 3/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:48:11] [INFO ] Deduced a trap along path composed of 2 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-07 13:48:11] [INFO ] Deduced a trap along path composed of 2 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-07 13:48:11] [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-07 13:48:11] [INFO ] Deduced a trap along path composed of 3 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-07 13:48:11] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/511 variables, 5/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/511 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/511 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 511/511 variables, and 423 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1760 ms.
Refiners :[Positive P Invariants (semi-flows): 108/108 constraints, State Equation: 278/278 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 9/9 constraints]
After SMT, in 1993ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 46 ms.
Support contains 24 out of 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 233/233 transitions.
Applied a total of 0 rules in 7 ms. Remains 278 /278 variables (removed 0) and now considering 233/233 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 278/278 places, 233/233 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 233/233 transitions.
Applied a total of 0 rules in 7 ms. Remains 278 /278 variables (removed 0) and now considering 233/233 (removed 0) transitions.
[2025-06-07 13:48:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 13:48:11] [INFO ] Implicit Places using invariants in 144 ms returned []
[2025-06-07 13:48:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 13:48:11] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-07 13:48:11] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 13:48:11] [INFO ] Redundant transitions in 7 ms returned []
Running 225 sub problems to find dead transitions.
[2025-06-07 13:48:11] [INFO ] Invariant cache hit.
[2025-06-07 13:48:11] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:48:13] [INFO ] Deduced a trap composed of 6 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-07 13:48:13] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:48:13] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:48:14] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (OVERLAPS) 7/278 variables, 33/112 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:48:18] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:48:18] [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-07 13:48:18] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:48:18] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:48:18] [INFO ] Deduced a trap composed of 4 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-07 13:48:18] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:48:18] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:48:18] [INFO ] Deduced a trap composed of 6 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-07 13:48:18] [INFO ] Deduced a trap composed of 3 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-07 13:48:18] [INFO ] Deduced a trap composed of 11 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-07 13:48:18] [INFO ] Deduced a trap composed of 3 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-07 13:48:18] [INFO ] Deduced a trap composed of 6 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-07 13:48:19] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 13/125 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (OVERLAPS) 233/511 variables, 278/403 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/511 variables, 16/419 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:48:23] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/511 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/511 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:48:26] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:48:27] [INFO ] Deduced a trap composed of 5 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-07 13:48:27] [INFO ] Deduced a trap composed of 5 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-07 13:48:27] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/511 variables, 4/424 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/511 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 13 (OVERLAPS) 0/511 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 511/511 variables, and 424 constraints, problems are : Problem set: 0 solved, 225 unsolved in 21482 ms.
Refiners :[Positive P Invariants (semi-flows): 108/108 constraints, State Equation: 278/278 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 17/92 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 7/278 variables, 33/125 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 5/130 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 233/511 variables, 278/408 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/511 variables, 16/424 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/511 variables, 225/649 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:48:37] [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-07 13:48:37] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:48:38] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:48:38] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/511 variables, 4/653 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:48:41] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/511 variables, 1/654 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:48:46] [INFO ] Deduced a trap composed of 4 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-07 13:48:46] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:48:46] [INFO ] Deduced a trap composed of 3 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-07 13:48:46] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/511 variables, 4/658 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:48:53] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/511 variables, 1/659 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:48:58] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/511 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 511/511 variables, and 660 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 108/108 constraints, State Equation: 278/278 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51561ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 51563ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52020 ms. Remains : 278/278 places, 233/233 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 40 times.
Drop transitions (Partial Free agglomeration) removed 40 transitions
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 278 transition count 233
Applied a total of 40 rules in 27 ms. Remains 278 /278 variables (removed 0) and now considering 233/233 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 233 rows 278 cols
[2025-06-07 13:49:03] [INFO ] Computed 108 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-07 13:49:03] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-07 13:49:03] [INFO ] [Nat]Absence check using 108 positive place invariants in 34 ms returned sat
[2025-06-07 13:49:03] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-07 13:49:03] [INFO ] State equation strengthened by 34 read => feed constraints.
[2025-06-07 13:49:03] [INFO ] After 58ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:49:04] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:49:04] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:49:04] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 3 ms to minimize.
[2025-06-07 13:49:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 332 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:49:04] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:49:04] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:49:04] [INFO ] Deduced a trap composed of 5 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-07 13:49:04] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:49:04] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 2 ms to minimize.
[2025-06-07 13:49:04] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 309 ms
TRAPS : Iteration 2
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:49:04] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:49:04] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 2 ms to minimize.
[2025-06-07 13:49:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 139 ms
TRAPS : Iteration 3
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:49:04] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:49:04] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:49:05] [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-07 13:49:05] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:49:05] [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-07 13:49:05] [INFO ] Deduced a trap composed of 6 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-07 13:49:05] [INFO ] Deduced a trap composed of 6 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-07 13:49:05] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:49:05] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:49:05] [INFO ] Deduced a trap composed of 7 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-07 13:49:05] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 3 ms to minimize.
[2025-06-07 13:49:05] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 916 ms
TRAPS : Iteration 4
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:49:05] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:49:05] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 2 ms to minimize.
[2025-06-07 13:49:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 131 ms
TRAPS : Iteration 5
[2025-06-07 13:49:05] [INFO ] After 2081ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-07 13:49:05] [INFO ] After 2385ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-07 13:49:06] [INFO ] Flatten gal took : 17 ms
[2025-06-07 13:49:06] [INFO ] Flatten gal took : 15 ms
[2025-06-07 13:49:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9562547994159216788.gal : 3 ms
[2025-06-07 13:49:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10724430038345993304.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/ReachabilityCardinality9562547994159216788.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10724430038345993304.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/ReachabilityCardinality10724430038345993304.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 12
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :12 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 108
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :108 after 432
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :432 after 3750
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3750 after 4300
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4300 after 17007
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :17007 after 279296
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :279296 after 7.19292e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7.19292e+06 after 1.2412e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.2412e+10 after 2.64313e+11
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.64313e+11 after 4.89336e+14
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :4.89336e+14 after 5.9782e+17
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :5.9782e+17 after 7.97513e+23
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :7.97513e+23 after 2.61321e+29
Detected timeout of ITS tools.
[2025-06-07 13:49:21] [INFO ] Flatten gal took : 15 ms
[2025-06-07 13:49:21] [INFO ] Applying decomposition
[2025-06-07 13:49:21] [INFO ] Flatten gal took : 13 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/graph10925061728147558625.txt' '-o' '/tmp/graph10925061728147558625.bin' '-w' '/tmp/graph10925061728147558625.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10925061728147558625.bin' '-l' '-1' '-v' '-w' '/tmp/graph10925061728147558625.weights' '-q' '0' '-e' '0.001'
[2025-06-07 13:49:21] [INFO ] Decomposing Gal with order
[2025-06-07 13:49:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 13:49:21] [INFO ] Removed a total of 54 redundant transitions.
[2025-06-07 13:49:21] [INFO ] Flatten gal took : 55 ms
[2025-06-07 13:49:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 10 ms.
[2025-06-07 13:49:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality901176610427820139.gal : 4 ms
[2025-06-07 13:49:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5155151106094074969.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/ReachabilityCardinality901176610427820139.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5155151106094074969.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/ReachabilityCardinality5155151106094074969.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3 after 2160
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :655776 after 7.37125e+08
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :7.37125e+08 after 3.59702e+15
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 32995 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-07 13:49:36] [INFO ] Flatten gal took : 28 ms
[2025-06-07 13:49:36] [INFO ] Applying decomposition
[2025-06-07 13:49:36] [INFO ] Flatten gal took : 31 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/graph18382019220357010976.txt' '-o' '/tmp/graph18382019220357010976.bin' '-w' '/tmp/graph18382019220357010976.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18382019220357010976.bin' '-l' '-1' '-v' '-w' '/tmp/graph18382019220357010976.weights' '-q' '0' '-e' '0.001'
[2025-06-07 13:49:36] [INFO ] Decomposing Gal with order
[2025-06-07 13:49:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 13:49:36] [INFO ] Removed a total of 60 redundant transitions.
[2025-06-07 13:49:36] [INFO ] Flatten gal took : 52 ms
[2025-06-07 13:49:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-07 13:49:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11777229244912154931.gal : 9 ms
[2025-06-07 13:49:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality997622694815636677.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/ReachabilityCardinality11777229244912154931.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality997622694815636677.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/ReachabilityCardinality997622694815636677.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 8566
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :8566 after 2.39591e+12
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1.81761e+30 after 1.82509e+30
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.82509e+30 after 1.85577e+30
Detected timeout of ITS tools.
[2025-06-07 14:19:39] [INFO ] Flatten gal took : 230 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6927982093344877681
[2025-06-07 14:19:40] [INFO ] Applying decomposition
[2025-06-07 14:19:40] [INFO ] Flatten gal took : 110 ms
[2025-06-07 14:19:40] [INFO ] Computing symmetric may disable matrix : 233 transitions.
[2025-06-07 14:19:40] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 14:19:40] [INFO ] Computing symmetric may enable matrix : 233 transitions.
[2025-06-07 14:19:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 14:19:41] [INFO ] Computing Do-Not-Accords matrix : 233 transitions.
[2025-06-07 14:19:41] [INFO ] Computation of Completed DNA matrix. took 3 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/graph18122515894987870305.txt' '-o' '/tmp/graph18122515894987870305.bin' '-w' '/tmp/graph18122515894987870305.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18122515894987870305.bin' '-l' '-1' '-v' '-w' '/tmp/graph18122515894987870305.weights' '-q' '0' '-e' '0.001'
[2025-06-07 14:19:41] [INFO ] Decomposing Gal with order
[2025-06-07 14:19:41] [INFO ] Built C files in 840ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6927982093344877681
[2025-06-07 14:19:41] [INFO ] Rewriting arrays to variables to allow decomposition.
Running compilation step : cd /tmp/ltsmin6927982093344877681;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' '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-07 14:19:41] [INFO ] Removed a total of 111 redundant transitions.
[2025-06-07 14:19:41] [INFO ] Flatten gal took : 72 ms
[2025-06-07 14:19:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 4 ms.
[2025-06-07 14:19:41] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability13601022267226286000.gal : 4 ms
[2025-06-07 14:19:41] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability5144593452385344371.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/ReachabilityFireability13601022267226286000.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability5144593452385344371.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/ReachabilityFireability5144593452385344371.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 3
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :669600 after 1.83366e+12
Compilation finished in 685 ms.
Running link step : cd /tmp/ltsmin6927982093344877681;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin6927982093344877681;'/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' 'ShieldPPPtPT010BReachabilityFireability202514==true'
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1.83366e+12 after 3.64511e+27

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="ShieldPPPt-PT-010B"
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 ShieldPPPt-PT-010B, 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-174894533500871"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-010B.tgz
mv ShieldPPPt-PT-010B 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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;