Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r198-tall-174894532900534.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is ShieldIIPt-PT-020B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894532900534
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 338K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-2024-15
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-2025-00
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-2025-01
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-2025-02
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-2025-03
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-2025-04
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-2025-05
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-2025-06
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-2025-07
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-2025-08
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-2025-09
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-2025-10
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-2025-11
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-2025-12
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-2025-13
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-2025-14

=== Now, execution of the tool begins

BK_START 1749139895847

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-020B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-05 16:11:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 16:11:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 16:11:37] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2025-06-05 16:11:37] [INFO ] Transformed 1403 places.
[2025-06-05 16:11:37] [INFO ] Transformed 1303 transitions.
[2025-06-05 16:11:37] [INFO ] Found NUPN structural information;
[2025-06-05 16:11:37] [INFO ] Parsed PT model containing 1403 places and 1303 transitions and 3246 arcs in 252 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-2025-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1585 ms. (25 steps per ms) remains 6/10 properties
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-05 16:11:37] [INFO ] Flatten gal took : 183 ms
BEST_FIRST walk for 40004 steps (8 resets) in 639 ms. (62 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 6/6 properties
[2025-06-05 16:11:38] [INFO ] Flatten gal took : 164 ms
[2025-06-05 16:11:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9752272720209937434.gal : 94 ms
BEST_FIRST walk for 40004 steps (8 resets) in 539 ms. (74 steps per ms) remains 6/6 properties
[2025-06-05 16:11:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8833477212787905563.prop : 7 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/ReachabilityCardinality9752272720209937434.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8833477212787905563.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 6/6 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 6/6 properties
Loading property file /tmp/ReachabilityCardinality8833477212787905563.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 6/6 properties
// Phase 1: matrix 1303 rows 1403 cols
[2025-06-05 16:11:38] [INFO ] Computed 181 invariants in 28 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 114/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1202/1316 variables, 169/283 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1316 variables, 1202/1485 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :19 after 28
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :28 after 277
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :277 after 733
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :733 after 88423
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :88423 after 5.78704e+08
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :5.78704e+08 after 6.90677e+16
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :6.90677e+16 after 2.30752e+34
At refinement iteration 4 (INCLUDED_ONLY) 0/1316 variables, 0/1485 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 87/1403 variables, 12/1497 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1403 variables, 87/1584 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :2.30752e+34 after 2.38107e+58
At refinement iteration 7 (INCLUDED_ONLY) 0/1403 variables, 0/1584 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :2.38107e+58 after 2.38107e+58
At refinement iteration 8 (OVERLAPS) 1303/2706 variables, 1403/2987 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :2.38107e+58 after 2.38107e+58
At refinement iteration 9 (INCLUDED_ONLY) 0/2706 variables, 0/2987 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/2706 variables, 0/2987 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :2.38107e+58 after 2.38107e+58
After SMT solving in domain Real declared 2706/2706 variables, and 2987 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3293 ms.
Refiners :[Domain max(s): 1403/1403 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 1403/1403 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 114/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1202/1316 variables, 169/283 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1316 variables, 1202/1485 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:42] [INFO ] Deduced a trap composed of 15 places in 295 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:43] [INFO ] Deduced a trap composed of 16 places in 248 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:43] [INFO ] Deduced a trap composed of 16 places in 239 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:43] [INFO ] Deduced a trap composed of 18 places in 250 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:43] [INFO ] Deduced a trap composed of 19 places in 279 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:44] [INFO ] Deduced a trap composed of 20 places in 253 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :2.38107e+58 after 2.38107e+58
[2025-06-05 16:11:44] [INFO ] Deduced a trap composed of 21 places in 259 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:44] [INFO ] Deduced a trap composed of 21 places in 242 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:45] [INFO ] Deduced a trap composed of 21 places in 303 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:45] [INFO ] Deduced a trap composed of 22 places in 226 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:45] [INFO ] Deduced a trap composed of 23 places in 362 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:46] [INFO ] Deduced a trap composed of 24 places in 224 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:46] [INFO ] Deduced a trap composed of 24 places in 229 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:46] [INFO ] Deduced a trap composed of 25 places in 303 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:47] [INFO ] Deduced a trap composed of 27 places in 294 ms of which 44 ms to minimize.
SMT process timed out in 8555ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 114 out of 1403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1403/1403 places, 1303/1303 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 267 transitions
Trivial Post-agglo rules discarded 267 transitions
Performed 267 trivial Post agglomeration. Transition count delta: 267
Iterating post reduction 0 with 267 rules applied. Total rules applied 267 place count 1403 transition count 1036
Reduce places removed 267 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 269 rules applied. Total rules applied 536 place count 1136 transition count 1034
Reduce places removed 1 places and 0 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Iterating post reduction 2 with 27 rules applied. Total rules applied 563 place count 1135 transition count 1008
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 3 with 26 rules applied. Total rules applied 589 place count 1109 transition count 1008
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 84 Pre rules applied. Total rules applied 589 place count 1109 transition count 924
Deduced a syphon composed of 84 places in 4 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 4 with 168 rules applied. Total rules applied 757 place count 1025 transition count 924
Discarding 113 places :
Symmetric choice reduction at 4 with 113 rule applications. Total rules 870 place count 912 transition count 811
Iterating global reduction 4 with 113 rules applied. Total rules applied 983 place count 912 transition count 811
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 39 Pre rules applied. Total rules applied 983 place count 912 transition count 772
Deduced a syphon composed of 39 places in 19 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 1061 place count 873 transition count 772
Performed 291 Post agglomeration using F-continuation condition.Transition count delta: 291
Deduced a syphon composed of 291 places in 1 ms
Reduce places removed 291 places and 0 transitions.
Iterating global reduction 4 with 582 rules applied. Total rules applied 1643 place count 582 transition count 481
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 1739 place count 534 transition count 499
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 1742 place count 534 transition count 496
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1745 place count 531 transition count 496
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 1757 place count 531 transition count 496
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1758 place count 530 transition count 495
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1760 place count 528 transition count 495
Applied a total of 1760 rules in 779 ms. Remains 528 /1403 variables (removed 875) and now considering 495/1303 (removed 808) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 798 ms. Remains : 528/1403 places, 495/1303 transitions.
RANDOM walk for 40000 steps (8 resets) in 843 ms. (47 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 343 ms. (116 steps per ms) remains 5/6 properties
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 484 ms. (82 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 569 ms. (70 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 260 ms. (153 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 239 ms. (166 steps per ms) remains 5/5 properties
// Phase 1: matrix 495 rows 528 cols
[2025-06-05 16:11:48] [INFO ] Computed 179 invariants in 7 ms
[2025-06-05 16:11:48] [INFO ] State equation strengthened by 106 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/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 402/493 variables, 162/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/493 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 31/524 variables, 15/177 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/524 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 495/1019 variables, 524/701 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1019 variables, 106/807 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1019 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 4/1023 variables, 4/811 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1023 variables, 2/813 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1023 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/1023 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1023/1023 variables, and 813 constraints, problems are : Problem set: 0 solved, 5 unsolved in 972 ms.
Refiners :[Positive P Invariants (semi-flows): 179/179 constraints, State Equation: 528/528 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 402/493 variables, 162/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:50] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:50] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:50] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:50] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:50] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:50] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:50] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:50] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:51] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:51] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:51] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:51] [INFO ] Deduced a trap composed of 11 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-05 16:11:51] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:51] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:51] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:51] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:51] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:51] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:52] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:52] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/493 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:52] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:52] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:52] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:52] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:52] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:52] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:52] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:52] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:52] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:52] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:52] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/493 variables, 11/193 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:52] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/493 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 31/524 variables, 15/209 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:53] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:53] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:53] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/524 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/524 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 495/1019 variables, 524/736 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1019 variables, 106/842 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1019 variables, 3/845 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:54] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:54] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:54] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:54] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:54] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:54] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:54] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:54] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:55] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1019 variables, 9/854 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:55] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 6 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1019 variables, 1/855 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:56] [INFO ] Deduced a trap along path composed of 2 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:56] [INFO ] Deduced a trap along path composed of 2 places in 65 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:56] [INFO ] Deduced a trap along path composed of 2 places in 45 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:56] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:56] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:56] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:57] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:57] [INFO ] Deduced a trap along path composed of 2 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:57] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1019 variables, 9/864 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:58] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:59] [INFO ] Deduced a trap along path composed of 5 places in 39 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:59] [INFO ] Deduced a trap along path composed of 4 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:59] [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-05 16:11:59] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:11:59] [INFO ] Deduced a trap along path composed of 2 places in 17 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1019 variables, 6/870 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1019 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 4/1023 variables, 4/874 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1023 variables, 2/876 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1023 variables, 1/877 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:01] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:01] [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/1023 variables, 2/879 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1023 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 0/1023 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1023/1023 variables, and 879 constraints, problems are : Problem set: 0 solved, 5 unsolved in 13198 ms.
Refiners :[Positive P Invariants (semi-flows): 179/179 constraints, State Equation: 528/528 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 17/17 constraints]
After SMT, in 14200ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2061 ms.
Support contains 91 out of 528 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 528/528 places, 495/495 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 528 transition count 490
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 12 place count 523 transition count 488
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 521 transition count 488
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 14 place count 521 transition count 485
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 20 place count 518 transition count 485
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 22 place count 516 transition count 483
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 516 transition count 483
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 60 place count 498 transition count 465
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 66 place count 495 transition count 466
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 69 place count 495 transition count 466
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 494 transition count 465
Applied a total of 70 rules in 96 ms. Remains 494 /528 variables (removed 34) and now considering 465/495 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 494/528 places, 465/495 transitions.
RANDOM walk for 40000 steps (8 resets) in 397 ms. (100 steps per ms) remains 4/5 properties
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 366 ms. (108 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 223 ms. (178 steps per ms) remains 4/4 properties
// Phase 1: matrix 465 rows 494 cols
[2025-06-05 16:12:05] [INFO ] Computed 179 invariants in 2 ms
[2025-06-05 16:12:05] [INFO ] State equation strengthened by 110 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/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 369/459 variables, 162/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 19/478 variables, 9/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/478 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 457/935 variables, 478/649 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/935 variables, 110/759 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/935 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 21/956 variables, 14/773 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/956 variables, 7/780 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/956 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 3/959 variables, 2/782 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/959 variables, 1/783 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/959 variables, 0/783 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/959 variables, 0/783 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 959/959 variables, and 783 constraints, problems are : Problem set: 0 solved, 4 unsolved in 805 ms.
Refiners :[Positive P Invariants (semi-flows): 179/179 constraints, State Equation: 494/494 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 4/3 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 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 369/459 variables, 162/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:06] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:06] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:06] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:06] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:06] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:06] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:06] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:07] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:07] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:07] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:07] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:07] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:07] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:07] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:07] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:07] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:07] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:07] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 18/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:07] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 19/478 variables, 9/190 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:08] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 457/935 variables, 478/669 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/935 variables, 110/779 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/935 variables, 2/781 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:08] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:08] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:08] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/935 variables, 3/784 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:09] [INFO ] Deduced a trap along path composed of 2 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:09] [INFO ] Deduced a trap along path composed of 2 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:09] [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-05 16:12:09] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:09] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:09] [INFO ] Deduced a trap along path composed of 2 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-05 16:12:09] [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-05 16:12:09] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:09] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/935 variables, 9/793 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/935 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 21/956 variables, 14/807 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/956 variables, 7/814 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/956 variables, 1/815 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/956 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 3/959 variables, 2/817 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/959 variables, 1/818 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:10] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/959 variables, 1/819 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/959 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/959 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 959/959 variables, and 819 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5184 ms.
Refiners :[Positive P Invariants (semi-flows): 179/179 constraints, State Equation: 494/494 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 10/10 constraints]
After SMT, in 6007ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2061 ms.
Support contains 90 out of 494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 494/494 places, 465/465 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 494 transition count 464
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 493 transition count 464
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 492 transition count 463
Applied a total of 4 rules in 30 ms. Remains 492 /494 variables (removed 2) and now considering 463/465 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 492/494 places, 463/465 transitions.
RANDOM walk for 40000 steps (8 resets) in 328 ms. (121 steps per ms) remains 2/4 properties
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 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 463 rows 492 cols
[2025-06-05 16:12:14] [INFO ] Computed 179 invariants in 2 ms
[2025-06-05 16:12:14] [INFO ] State equation strengthened by 111 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/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 412/443 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 24/467 variables, 10/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 445/912 variables, 467/635 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/912 variables, 111/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/912 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 21/933 variables, 10/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/933 variables, 4/760 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/933 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/935 variables, 1/761 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/935 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/948 variables, 10/771 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/948 variables, 2/773 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/948 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/949 variables, 2/775 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/949 variables, 1/776 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/949 variables, 0/776 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 6/955 variables, 4/780 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/955 variables, 2/782 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/955 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/955 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 955/955 variables, and 782 constraints, problems are : Problem set: 0 solved, 2 unsolved in 654 ms.
Refiners :[Positive P Invariants (semi-flows): 179/179 constraints, State Equation: 492/492 constraints, ReadFeed: 111/111 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 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 412/443 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:14] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:14] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:15] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:15] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:15] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:15] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:15] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:15] [INFO ] Deduced a trap composed of 8 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-05 16:12:15] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:15] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:15] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:15] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:15] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:15] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 14/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:15] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/443 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/443 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 24/467 variables, 10/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 445/912 variables, 467/650 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/912 variables, 111/761 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/912 variables, 1/762 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:16] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:16] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/912 variables, 2/764 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:16] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:16] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:16] [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-05 16:12:16] [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-05 16:12:16] [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-05 16:12:16] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:16] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:16] [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-05 16:12:16] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:17] [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-05 16:12:17] [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-05 16:12:17] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/912 variables, 12/776 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/912 variables, 0/776 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 21/933 variables, 10/786 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/933 variables, 4/790 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/933 variables, 1/791 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:17] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/933 variables, 1/792 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:17] [INFO ] Deduced a trap along path composed of 2 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-05 16:12:17] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/933 variables, 2/794 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/933 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/935 variables, 1/795 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/935 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 13/948 variables, 10/805 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/948 variables, 2/807 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/948 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 1/949 variables, 2/809 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/949 variables, 1/810 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/949 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 6/955 variables, 4/814 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/955 variables, 2/816 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/955 variables, 0/816 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/955 variables, 0/816 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 955/955 variables, and 816 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4057 ms.
Refiners :[Positive P Invariants (semi-flows): 179/179 constraints, State Equation: 492/492 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 14/14 constraints]
After SMT, in 4725ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 753 ms.
Support contains 31 out of 492 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 492/492 places, 463/463 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 492 transition count 454
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 483 transition count 454
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 18 place count 483 transition count 441
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 44 place count 470 transition count 441
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 130 place count 427 transition count 398
Renaming transitions due to excessive name length > 1024 char.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 148 place count 418 transition count 406
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 149 place count 418 transition count 405
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 153 place count 418 transition count 405
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 154 place count 417 transition count 404
Applied a total of 154 rules in 47 ms. Remains 417 /492 variables (removed 75) and now considering 404/463 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 417/492 places, 404/463 transitions.
RANDOM walk for 40000 steps (8 resets) in 326 ms. (122 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 228 ms. (174 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 325878 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 2
Probabilistic random walk after 325878 steps, saw 207926 distinct states, run finished after 3006 ms. (steps per millisecond=108 ) properties seen :0
// Phase 1: matrix 404 rows 417 cols
[2025-06-05 16:12:22] [INFO ] Computed 179 invariants in 2 ms
[2025-06-05 16:12:22] [INFO ] State equation strengthened by 141 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 342/373 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/392 variables, 9/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 383/775 variables, 392/559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/775 variables, 141/700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/775 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 21/796 variables, 10/710 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/796 variables, 5/715 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/796 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 15/811 variables, 8/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/811 variables, 3/726 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/811 variables, 0/726 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/812 variables, 1/727 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/812 variables, 1/728 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/812 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/814 variables, 1/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/814 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 7/821 variables, 6/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/821 variables, 2/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/821 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/821 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 821/821 variables, and 737 constraints, problems are : Problem set: 0 solved, 2 unsolved in 553 ms.
Refiners :[Positive P Invariants (semi-flows): 179/179 constraints, State Equation: 417/417 constraints, ReadFeed: 141/141 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 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 342/373 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:23] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:23] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:23] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:23] [INFO ] Deduced a trap composed of 5 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-05 16:12:23] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:23] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:23] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 7/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 19/392 variables, 9/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 383/775 variables, 392/566 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/775 variables, 141/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/775 variables, 1/708 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:24] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/775 variables, 1/709 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:24] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:24] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:24] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:24] [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-05 16:12:24] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:24] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:24] [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-05 16:12:24] [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-05 16:12:24] [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-05 16:12:24] [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-05 16:12:24] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/775 variables, 11/720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/775 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 21/796 variables, 10/730 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/796 variables, 5/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/796 variables, 1/736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/796 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 15/811 variables, 8/744 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/811 variables, 3/747 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/811 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/812 variables, 1/748 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/812 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/812 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/814 variables, 1/750 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/814 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 7/821 variables, 6/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/821 variables, 2/758 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/821 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/821 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 821/821 variables, and 758 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6338 ms.
Refiners :[Positive P Invariants (semi-flows): 179/179 constraints, State Equation: 417/417 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 11/11 constraints]
After SMT, in 6902ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 827 ms.
Support contains 31 out of 417 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 404/404 transitions.
Applied a total of 0 rules in 9 ms. Remains 417 /417 variables (removed 0) and now considering 404/404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 417/417 places, 404/404 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 404/404 transitions.
Applied a total of 0 rules in 7 ms. Remains 417 /417 variables (removed 0) and now considering 404/404 (removed 0) transitions.
[2025-06-05 16:12:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:12:30] [INFO ] Implicit Places using invariants in 213 ms returned []
[2025-06-05 16:12:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:12:30] [INFO ] State equation strengthened by 141 read => feed constraints.
[2025-06-05 16:12:31] [INFO ] Implicit Places using invariants and state equation in 934 ms returned []
Implicit Place search using SMT with State Equation took 1159 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 16:12:31] [INFO ] Redundant transitions in 26 ms returned []
Running 400 sub problems to find dead transitions.
[2025-06-05 16:12:31] [INFO ] Invariant cache hit.
[2025-06-05 16:12:31] [INFO ] State equation strengthened by 141 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 1/417 variables, 163/179 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:38] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:39] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:39] [INFO ] Deduced a trap composed of 7 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-05 16:12:39] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:39] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:39] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:39] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:39] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:39] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:39] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:12:39] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/417 variables, 11/190 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/417 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 404/821 variables, 417/607 constraints. Problems are: Problem set: 0 solved, 400 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/821 variables, 141/748 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/821 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/821 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 821/821 variables, and 748 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 179/179 constraints, State Equation: 417/417 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 1/417 variables, 163/179 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/417 variables, 11/190 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/417 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 404/821 variables, 417/607 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/821 variables, 141/748 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/821 variables, 400/1148 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 821/821 variables, and 1148 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 179/179 constraints, State Equation: 417/417 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60159ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60162ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61367 ms. Remains : 417/417 places, 404/404 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 75 times.
Drop transitions (Partial Free agglomeration) removed 75 transitions
Iterating global reduction 0 with 75 rules applied. Total rules applied 75 place count 417 transition count 404
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 417 transition count 403
Applied a total of 76 rules in 23 ms. Remains 417 /417 variables (removed 0) and now considering 403/404 (removed 1) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 403 rows 417 cols
[2025-06-05 16:13:31] [INFO ] Computed 179 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 16:13:31] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 16:13:32] [INFO ] [Nat]Absence check using 179 positive place invariants in 21 ms returned sat
[2025-06-05 16:13:32] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2025-06-05 16:13:32] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-06-05 16:13:32] [INFO ] After 125ms SMT Verify possible using 66 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:13:32] [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-05 16:13:32] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 2 ms to minimize.
[2025-06-05 16:13:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 135 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:13:32] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:13:32] [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-05 16:13:32] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 2 ms to minimize.
[2025-06-05 16:13:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 201 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:13:32] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 3 ms to minimize.
[2025-06-05 16:13:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
TRAPS : Iteration 2
[2025-06-05 16:13:33] [INFO ] After 940ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-05 16:13:33] [INFO ] After 1311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-06-05 16:13:33] [INFO ] Flatten gal took : 47 ms
[2025-06-05 16:13:33] [INFO ] Flatten gal took : 27 ms
[2025-06-05 16:13:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10460832687564390266.gal : 5 ms
[2025-06-05 16:13:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18278639369674218000.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/ReachabilityCardinality10460832687564390266.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18278639369674218000.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality18278639369674218000.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 20
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :20 after 56
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :56 after 326
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :326 after 95588
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :95588 after 101330
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :101330 after 144903
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :144903 after 208677
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :208677 after 1.91799e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.91799e+06 after 3.51153e+08
Detected timeout of ITS tools.
[2025-06-05 16:13:48] [INFO ] Flatten gal took : 32 ms
[2025-06-05 16:13:48] [INFO ] Applying decomposition
[2025-06-05 16:13:48] [INFO ] Flatten gal took : 24 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/graph9047087298803703104.txt' '-o' '/tmp/graph9047087298803703104.bin' '-w' '/tmp/graph9047087298803703104.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9047087298803703104.bin' '-l' '-1' '-v' '-w' '/tmp/graph9047087298803703104.weights' '-q' '0' '-e' '0.001'
[2025-06-05 16:13:48] [INFO ] Decomposing Gal with order
[2025-06-05 16:13:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 16:13:48] [INFO ] Removed a total of 232 redundant transitions.
[2025-06-05 16:13:49] [INFO ] Flatten gal took : 253 ms
[2025-06-05 16:13:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 39 ms.
[2025-06-05 16:13:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2711153945185521627.gal : 24 ms
[2025-06-05 16:13:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3574874853146824960.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/ReachabilityCardinality2711153945185521627.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3574874853146824960.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/ReachabilityCardinality3574874853146824960.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :3 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 164
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :164 after 326
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :326 after 974
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2.01588e+07 after 3.83416e+10
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3.83416e+10 after 3.94971e+20
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 32338 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-05 16:14:04] [INFO ] Flatten gal took : 39 ms
[2025-06-05 16:14:04] [INFO ] Applying decomposition
[2025-06-05 16:14:04] [INFO ] Flatten gal took : 32 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/graph17917981035154679385.txt' '-o' '/tmp/graph17917981035154679385.bin' '-w' '/tmp/graph17917981035154679385.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17917981035154679385.bin' '-l' '-1' '-v' '-w' '/tmp/graph17917981035154679385.weights' '-q' '0' '-e' '0.001'
[2025-06-05 16:14:04] [INFO ] Decomposing Gal with order
[2025-06-05 16:14:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 16:14:04] [INFO ] Removed a total of 120 redundant transitions.
[2025-06-05 16:14:04] [INFO ] Flatten gal took : 64 ms
[2025-06-05 16:14:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2025-06-05 16:14:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18184406694479642756.gal : 13 ms
[2025-06-05 16:14:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7791962389541720099.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/ReachabilityCardinality18184406694479642756.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7791962389541720099.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/ReachabilityCardinality7791962389541720099.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1810
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1810 after 2.512e+09
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :2.512e+09 after 1.52263e+61
Reachability property ShieldIIPt-PT-020B-ReachabilityCardinality-2025-03 is true.
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1.52263e+61 after 5.30082e+73
Detected timeout of ITS tools.
[2025-06-05 16:44:07] [INFO ] Flatten gal took : 286 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10257046004121077705
[2025-06-05 16:44:08] [INFO ] Applying decomposition
[2025-06-05 16:44:08] [INFO ] Computing symmetric may disable matrix : 404 transitions.
[2025-06-05 16:44:08] [INFO ] Flatten gal took : 143 ms
[2025-06-05 16:44:08] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 16:44:08] [INFO ] Computing symmetric may enable matrix : 404 transitions.
[2025-06-05 16:44:08] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 16:44:08] [INFO ] Computing Do-Not-Accords matrix : 404 transitions.
[2025-06-05 16:44:08] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 16:44:09] [INFO ] Built C files in 1274ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10257046004121077705
Running compilation step : cd /tmp/ltsmin10257046004121077705;'/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'
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/graph10711199128903357748.txt' '-o' '/tmp/graph10711199128903357748.bin' '-w' '/tmp/graph10711199128903357748.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10711199128903357748.bin' '-l' '-1' '-v' '-w' '/tmp/graph10711199128903357748.weights' '-q' '0' '-e' '0.001'
[2025-06-05 16:44:09] [INFO ] Decomposing Gal with order
[2025-06-05 16:44:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 16:44:09] [INFO ] Removed a total of 352 redundant transitions.
[2025-06-05 16:44:09] [INFO ] Flatten gal took : 118 ms
[2025-06-05 16:44:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 176 labels/synchronizations in 36 ms.
[2025-06-05 16:44:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality585443412198922051.gal : 5 ms
[2025-06-05 16:44:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3918792551254934825.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/ReachabilityCardinality585443412198922051.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3918792551254934825.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/ReachabilityCardinality3918792551254934825.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 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 20
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :20 after 164
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :5.03971e+06 after 1.26392e+14
Compilation finished in 1244 ms.
Running link step : cd /tmp/ltsmin10257046004121077705;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin10257046004121077705;'/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' 'ShieldIIPtPT020BReachabilityCardinality202415==true'
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.26392e+14 after 8.26763e+35
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.14981e+59,65.9133,862424,647,100,1.278e+06,799,1059,4.86555e+06,141,9993,0
Total reachable state count : 2.149811109614048082745748714020992105688e+59

Verifying 1 reachability properties.
Invariant property ShieldIIPt-PT-020B-ReachabilityCardinality-2024-15 is true.
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldIIPt-PT-020B-ReachabilityCardinality-2024-15,0,66.617,862680,1,0,1.278e+06,799,1088,4.86555e+06,149,9993,594
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 2100824 ms.

BK_STOP 1749141998074

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-020B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is ShieldIIPt-PT-020B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r198-tall-174894532900534"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-020B.tgz
mv ShieldIIPt-PT-020B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;