Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 728K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K 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 56K 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.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K 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 167K 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-010B-ReachabilityCardinality-2025-00
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-2025-01
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-2025-02
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-2025-03
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-2025-04
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-2025-05
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-2025-06
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-2025-07
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-2025-08
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-2025-09
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-2025-10
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-2025-11
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-2025-12
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-2025-13
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-2025-14
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749130954458

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-010B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-05 13:42:35] [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 13:42:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 13:42:35] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2025-06-05 13:42:35] [INFO ] Transformed 703 places.
[2025-06-05 13:42:35] [INFO ] Transformed 653 transitions.
[2025-06-05 13:42:35] [INFO ] Found NUPN structural information;
[2025-06-05 13:42:35] [INFO ] Parsed PT model containing 703 places and 653 transitions and 1626 arcs in 196 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 1467 ms. (27 steps per ms) remains 6/16 properties
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-2025-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-05 13:42:36] [INFO ] Flatten gal took : 135 ms
[2025-06-05 13:42:36] [INFO ] Flatten gal took : 91 ms
BEST_FIRST walk for 40004 steps (8 resets) in 376 ms. (106 steps per ms) remains 6/6 properties
[2025-06-05 13:42:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12559586041461444980.gal : 29 ms
BEST_FIRST walk for 40004 steps (8 resets) in 290 ms. (137 steps per ms) remains 6/6 properties
[2025-06-05 13:42:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4973026348266493748.prop : 10 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/ReachabilityCardinality12559586041461444980.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4973026348266493748.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

BEST_FIRST walk for 40003 steps (8 resets) in 221 ms. (180 steps per ms) remains 6/6 properties
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality4973026348266493748.prop.
BEST_FIRST walk for 40002 steps (8 resets) in 237 ms. (168 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 367 ms. (108 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 190 ms. (209 steps per ms) remains 6/6 properties
// Phase 1: matrix 653 rows 703 cols
[2025-06-05 13:42:36] [INFO ] Computed 91 invariants in 21 ms
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 12
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :12 after 19
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :19 after 289
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :289 after 17523
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :17523 after 1.15741e+09
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :1.15741e+09 after 6.68993e+17
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :2.72419e+29 after 4.58868e+29
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/161 variables, 161/161 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 536/697 variables, 89/250 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/697 variables, 536/786 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/697 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 6/703 variables, 2/788 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/703 variables, 6/794 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/703 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 653/1356 variables, 703/1497 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1356 variables, 0/1497 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/1356 variables, 0/1497 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1356/1356 variables, and 1497 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1427 ms.
Refiners :[Domain max(s): 703/703 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 703/703 constraints, PredecessorRefiner: 6/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 161/161 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 536/697 variables, 89/250 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/697 variables, 536/786 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 13:42:39] [INFO ] Deduced a trap composed of 12 places in 360 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:39] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:39] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:39] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:39] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:39] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:40] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:40] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:40] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:40] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:40] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:40] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:40] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:41] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:41] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:41] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:41] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:41] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:41] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:41] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 21 ms to minimize.
Problem ShieldIIPt-PT-010B-ReachabilityCardinality-2025-11 is UNSAT
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-2025-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/697 variables, 20/806 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:41] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:42] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:42] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:42] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:42] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:42] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:42] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:42] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:42] [INFO ] Deduced a trap composed of 28 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 13:42:43] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:43] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/697 variables, 11/817 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:43] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:43] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 11 ms to minimize.
SMT process timed out in 6648ms, After SMT, problems are : Problem set: 1 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 137 out of 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 653/653 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 703 transition count 569
Reduce places removed 84 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 86 rules applied. Total rules applied 170 place count 619 transition count 567
Reduce places removed 1 places and 0 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Iterating post reduction 2 with 26 rules applied. Total rules applied 196 place count 618 transition count 542
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 221 place count 593 transition count 542
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 43 Pre rules applied. Total rules applied 221 place count 593 transition count 499
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 307 place count 550 transition count 499
Discarding 41 places :
Symmetric choice reduction at 4 with 41 rule applications. Total rules 348 place count 509 transition count 458
Iterating global reduction 4 with 41 rules applied. Total rules applied 389 place count 509 transition count 458
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 389 place count 509 transition count 444
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 417 place count 495 transition count 444
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 1 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 4 with 218 rules applied. Total rules applied 635 place count 386 transition count 335
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 657 place count 375 transition count 337
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 658 place count 375 transition count 336
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 659 place count 374 transition count 336
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 669 place count 374 transition count 336
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 670 place count 373 transition count 335
Applied a total of 670 rules in 210 ms. Remains 373 /703 variables (removed 330) and now considering 335/653 (removed 318) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 373/703 places, 335/653 transitions.
RANDOM walk for 40000 steps (8 resets) in 516 ms. (77 steps per ms) remains 3/5 properties
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 193 ms. (206 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 230 ms. (173 steps per ms) remains 3/3 properties
// Phase 1: matrix 335 rows 373 cols
[2025-06-05 13:42:44] [INFO ] Computed 91 invariants in 3 ms
[2025-06-05 13:42:44] [INFO ] State equation strengthened by 26 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/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 261/357 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 16/373 variables, 6/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 335/708 variables, 373/464 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/708 variables, 26/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/708 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/708 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 708/708 variables, and 490 constraints, problems are : Problem set: 0 solved, 3 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 373/373 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 261/357 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:44] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:44] [INFO ] Deduced a trap composed of 6 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 13:42:44] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:44] [INFO ] Deduced a trap composed of 7 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 13:42:45] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:45] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:45] [INFO ] Deduced a trap composed of 9 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 13:42:45] [INFO ] Deduced a trap composed of 10 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 13:42:45] [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 13:42:45] [INFO ] Deduced a trap composed of 11 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 13:42:45] [INFO ] Deduced a trap composed of 12 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 13:42:45] [INFO ] Deduced a trap composed of 12 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 13:42:45] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:45] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:45] [INFO ] Deduced a trap composed of 16 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 13:42:45] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:45] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:45] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:45] [INFO ] Deduced a trap composed of 3 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 13:42:46] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:46] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:46] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:46] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:46] [INFO ] Deduced a trap composed of 10 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 13:42:46] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:46] [INFO ] Deduced a trap composed of 11 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 13:42:46] [INFO ] Deduced a trap composed of 11 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 13:42:46] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:46] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:46] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 10/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:46] [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 13:42:46] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:47] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:47] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:47] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 5/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:47] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 16/373 variables, 6/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:47] [INFO ] Deduced a trap composed of 7 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 13:42:47] [INFO ] Deduced a trap composed of 10 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 13:42:47] [INFO ] Deduced a trap composed of 9 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 13:42:47] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:47] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 335/708 variables, 373/505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/708 variables, 26/531 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/708 variables, 2/533 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:48] [INFO ] Deduced a trap composed of 10 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 13:42:48] [INFO ] Deduced a trap composed of 10 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 13:42:48] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:48] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/708 variables, 4/537 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:48] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:48] [INFO ] Deduced a trap along path composed of 4 places in 31 ms of which 1 ms to minimize.
Problem ShieldIIPt-PT-010B-ReachabilityCardinality-2025-00 is UNSAT
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-2025-00 FALSE TECHNIQUES SMT_REFINEMENT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:49] [INFO ] Deduced a trap along path composed of 4 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:49] [INFO ] Deduced a trap along path composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/708 variables, 4/541 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/708 variables, 0/541 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/708 variables, 0/541 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 708/708 variables, and 541 constraints, problems are : Problem set: 1 solved, 2 unsolved in 5479 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 373/373 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 5847ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 830 ms.
Support contains 71 out of 373 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 373/373 places, 335/335 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 373 transition count 325
Reduce places removed 10 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 15 rules applied. Total rules applied 25 place count 363 transition count 320
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 30 place count 358 transition count 320
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 30 place count 358 transition count 313
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 44 place count 351 transition count 313
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 47 place count 348 transition count 310
Iterating global reduction 3 with 3 rules applied. Total rules applied 50 place count 348 transition count 310
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 132 place count 307 transition count 269
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 142 place count 302 transition count 271
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 146 place count 302 transition count 267
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 150 place count 298 transition count 267
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 156 place count 298 transition count 267
Applied a total of 156 rules in 58 ms. Remains 298 /373 variables (removed 75) and now considering 267/335 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 298/373 places, 267/335 transitions.
RANDOM walk for 40000 steps (8 resets) in 318 ms. (125 steps per ms) remains 1/2 properties
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 223 ms. (178 steps per ms) remains 1/1 properties
// Phase 1: matrix 267 rows 298 cols
[2025-06-05 13:42:51] [INFO ] Computed 91 invariants in 2 ms
[2025-06-05 13:42:51] [INFO ] State equation strengthened by 40 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/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 153/197 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 99/296 variables, 39/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 267/563 variables, 296/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 40/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/565 variables, 2/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/565 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/565 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 429 constraints, problems are : Problem set: 0 solved, 1 unsolved in 181 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 298/298 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 153/197 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:51] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:51] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:51] [INFO ] Deduced a trap composed of 7 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 13:42:51] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:51] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:51] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:51] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 99/296 variables, 39/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:51] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:51] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:51] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 267/563 variables, 296/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 40/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:52] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:52] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:52] [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 13:42:52] [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 13:42:52] [INFO ] Deduced a trap along path composed of 4 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 13:42:52] [INFO ] Deduced a trap along path composed of 2 places in 16 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:52] [INFO ] Deduced a trap along path composed of 6 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:52] [INFO ] Deduced a trap along path composed of 2 places in 17 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:52] [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 13:42:52] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/563 variables, 9/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:53] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/563 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:53] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/563 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/563 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/565 variables, 2/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/565 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/565 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/565 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 451 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2516 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 298/298 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 10/10 constraints]
After SMT, in 2706ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 44 out of 298 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 267/267 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 298 transition count 256
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 287 transition count 255
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 286 transition count 255
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 24 place count 286 transition count 253
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 28 place count 284 transition count 253
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 66 place count 265 transition count 234
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 74 place count 261 transition count 238
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 75 place count 261 transition count 237
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 76 place count 261 transition count 237
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 78 place count 259 transition count 235
Applied a total of 78 rules in 40 ms. Remains 259 /298 variables (removed 39) and now considering 235/267 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 259/298 places, 235/267 transitions.
RANDOM walk for 40000 steps (8 resets) in 232 ms. (171 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 230 ms. (173 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 879919 steps, run timeout after 3001 ms. (steps per millisecond=293 ) properties seen :0 out of 1
Probabilistic random walk after 879919 steps, saw 662072 distinct states, run finished after 3006 ms. (steps per millisecond=292 ) properties seen :0
// Phase 1: matrix 235 rows 259 cols
[2025-06-05 13:42:57] [INFO ] Computed 91 invariants in 5 ms
[2025-06-05 13:42:57] [INFO ] State equation strengthened by 31 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/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 130/174 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/196 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 222/418 variables, 196/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 27/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 73/491 variables, 60/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/491 variables, 27/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/491 variables, 4/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/491 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/492 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/492 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/492 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/494 variables, 2/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/494 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/494 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/494 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 494/494 variables, and 381 constraints, problems are : Problem set: 0 solved, 1 unsolved in 210 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 259/259 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 130/174 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:57] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:57] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:57] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:57] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:57] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:57] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/196 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 222/418 variables, 196/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 27/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 73/491 variables, 60/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/491 variables, 27/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/491 variables, 4/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:57] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/491 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:57] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/491 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/491 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/492 variables, 2/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/492 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/492 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/494 variables, 2/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/494 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:57] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/494 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:42:58] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/494 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/494 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/494 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 494/494 variables, and 391 constraints, problems are : Problem set: 0 solved, 1 unsolved in 937 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 259/259 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1161ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 66 ms.
Support contains 44 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 235/235 transitions.
Applied a total of 0 rules in 7 ms. Remains 259 /259 variables (removed 0) and now considering 235/235 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 259/259 places, 235/235 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 235/235 transitions.
Applied a total of 0 rules in 6 ms. Remains 259 /259 variables (removed 0) and now considering 235/235 (removed 0) transitions.
[2025-06-05 13:42:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:42:58] [INFO ] Implicit Places using invariants in 132 ms returned [250]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 143 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 258/259 places, 235/235 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 258 transition count 234
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 2 place count 257 transition count 234
Applied a total of 2 rules in 18 ms. Remains 257 /258 variables (removed 1) and now considering 234/235 (removed 1) transitions.
// Phase 1: matrix 234 rows 257 cols
[2025-06-05 13:42:58] [INFO ] Computed 90 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:42:58] [INFO ] Implicit Places using invariants in 126 ms returned [243]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 129 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 256/259 places, 234/235 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 255 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 255 transition count 233
Applied a total of 2 rules in 23 ms. Remains 255 /256 variables (removed 1) and now considering 233/234 (removed 1) transitions.
// Phase 1: matrix 233 rows 255 cols
[2025-06-05 13:42:58] [INFO ] Computed 89 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:42:58] [INFO ] Implicit Places using invariants in 134 ms returned []
[2025-06-05 13:42:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:42:58] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-05 13:42:58] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 255/259 places, 233/235 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 724 ms. Remains : 255/259 places, 233/235 transitions.
RANDOM walk for 40000 steps (8 resets) in 263 ms. (151 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 976492 steps, run timeout after 3001 ms. (steps per millisecond=325 ) properties seen :0 out of 1
Probabilistic random walk after 976492 steps, saw 733357 distinct states, run finished after 3001 ms. (steps per millisecond=325 ) properties seen :0
[2025-06-05 13:43:02] [INFO ] Invariant cache hit.
[2025-06-05 13:43:02] [INFO ] State equation strengthened by 28 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/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 126/170 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/192 variables, 10/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 220/412 variables, 192/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 24/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 73/485 variables, 60/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 27/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/485 variables, 4/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/485 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/486 variables, 2/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/486 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/486 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/488 variables, 2/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/488 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/488 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/488 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 372 constraints, problems are : Problem set: 0 solved, 1 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, State Equation: 255/255 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 126/170 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:02] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:02] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:02] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:02] [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 13:43:02] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 22/192 variables, 10/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:02] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 220/412 variables, 192/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 24/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 73/485 variables, 60/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/485 variables, 27/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/485 variables, 4/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:02] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/485 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:02] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:02] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/485 variables, 2/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:02] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/485 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:03] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/485 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/485 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/486 variables, 2/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/486 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/486 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/488 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/488 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/488 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:03] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 3 ms to minimize.
At refinement iteration 24 (OVERLAPS) 0/488 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/488 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/488 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 488/488 variables, and 384 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1021 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, State Equation: 255/255 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 1220ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 51 ms.
Support contains 44 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 233/233 transitions.
Applied a total of 0 rules in 5 ms. Remains 255 /255 variables (removed 0) and now considering 233/233 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 255/255 places, 233/233 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 233/233 transitions.
Applied a total of 0 rules in 5 ms. Remains 255 /255 variables (removed 0) and now considering 233/233 (removed 0) transitions.
[2025-06-05 13:43:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:43:03] [INFO ] Implicit Places using invariants in 115 ms returned []
[2025-06-05 13:43:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:43:03] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-05 13:43:03] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 13:43:03] [INFO ] Redundant transitions in 9 ms returned []
Running 221 sub problems to find dead transitions.
[2025-06-05 13:43:03] [INFO ] Invariant cache hit.
[2025-06-05 13:43:03] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 12/255 variables, 49/89 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:06] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:06] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:06] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:06] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:06] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:06] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:06] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:06] [INFO ] Deduced a trap composed of 11 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 13:43:06] [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 13:43:06] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:07] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:07] [INFO ] Deduced a trap composed of 8 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 13:43:07] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:07] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:07] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:07] [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 13:43:07] [INFO ] Deduced a trap composed of 6 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 13:43:07] [INFO ] Deduced a trap composed of 7 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 13:43:07] [INFO ] Deduced a trap composed of 7 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 13:43:07] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:08] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:08] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:09] [INFO ] Deduced a trap composed of 7 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 13:43:09] [INFO ] Deduced a trap composed of 6 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 13:43:09] [INFO ] Deduced a trap composed of 8 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 13:43:09] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:09] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 7/116 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:10] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:10] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 233/488 variables, 255/373 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 28/401 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:16] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/488 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/488 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 12 (OVERLAPS) 0/488 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 402 constraints, problems are : Problem set: 0 solved, 221 unsolved in 18452 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, State Equation: 255/255 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 12/255 variables, 49/99 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:23] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:24] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:24] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 233/488 variables, 255/377 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 28/405 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 221/626 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:28] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/488 variables, 1/627 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:31] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:32] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/488 variables, 2/629 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:34] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:34] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/488 variables, 2/631 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:38] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/488 variables, 1/632 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:42] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:45] [INFO ] Deduced a trap composed of 6 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 13:43:45] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/488 variables, 3/635 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:50] [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 13:43:50] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:50] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:50] [INFO ] Deduced a trap along path composed of 3 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 13:43:50] [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 13:43:51] [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 13:43:51] [INFO ] Deduced a trap along path composed of 2 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 13:43:51] [INFO ] Deduced a trap along path composed of 5 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 13:43:51] [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 13:43:51] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:52] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/488 variables, and 646 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, State Equation: 255/255 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 11/11 constraints]
After SMT, in 48505ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 48507ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48924 ms. Remains : 255/255 places, 233/233 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 609 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 24 times.
Drop transitions (Partial Free agglomeration) removed 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 25 place count 254 transition count 233
Applied a total of 25 rules in 14 ms. Remains 254 /255 variables (removed 1) and now considering 233/233 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 233 rows 254 cols
[2025-06-05 13:43:52] [INFO ] Computed 88 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 13:43:52] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 13:43:52] [INFO ] [Nat]Absence check using 88 positive place invariants in 12 ms returned sat
[2025-06-05 13:43:52] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-05 13:43:52] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-05 13:43:52] [INFO ] After 36ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:52] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:52] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:52] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 2 ms to minimize.
[2025-06-05 13:43:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 190 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:43:52] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 3 ms to minimize.
[2025-06-05 13:43:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
TRAPS : Iteration 2
[2025-06-05 13:43:52] [INFO ] After 364ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-05 13:43:52] [INFO ] After 539ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-05 13:43:52] [INFO ] Flatten gal took : 37 ms
[2025-06-05 13:43:52] [INFO ] Flatten gal took : 17 ms
[2025-06-05 13:43:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7574689299601565743.gal : 4 ms
[2025-06-05 13:43:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17717931755848357621.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/ReachabilityCardinality7574689299601565743.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17717931755848357621.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality17717931755848357621.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 31
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :31 after 93
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :93 after 2232
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2232 after 703080
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.96862e+07 after 2.64242e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.64242e+07 after 2.64345e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.64345e+07 after 2.6483e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.6483e+07 after 3.26708e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3.26708e+07 after 8.17955e+09
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :8.17955e+09 after 2.40138e+13
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.40138e+13 after 3.08698e+17
Detected timeout of ITS tools.
[2025-06-05 13:44:08] [INFO ] Flatten gal took : 21 ms
[2025-06-05 13:44:08] [INFO ] Applying decomposition
[2025-06-05 13:44:08] [INFO ] Flatten gal took : 19 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/graph348714648130313147.txt' '-o' '/tmp/graph348714648130313147.bin' '-w' '/tmp/graph348714648130313147.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph348714648130313147.bin' '-l' '-1' '-v' '-w' '/tmp/graph348714648130313147.weights' '-q' '0' '-e' '0.001'
[2025-06-05 13:44:08] [INFO ] Decomposing Gal with order
[2025-06-05 13:44:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 13:44:08] [INFO ] Removed a total of 90 redundant transitions.
[2025-06-05 13:44:08] [INFO ] Flatten gal took : 57 ms
[2025-06-05 13:44:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 12 ms.
[2025-06-05 13:44:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16681582393867125802.gal : 5 ms
[2025-06-05 13:44:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15262871114653706046.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/ReachabilityCardinality16681582393867125802.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15262871114653706046.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 ...309
Loading property file /tmp/ReachabilityCardinality15262871114653706046.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 31
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :31 after 31
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :31 after 93
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :93 after 100440
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.91238e+07 after 1.4616e+08
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.4616e+08 after 1.82232e+10
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.82232e+10 after 4.16525e+11
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 31083 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-05 13:44:23] [INFO ] Flatten gal took : 22 ms
[2025-06-05 13:44:23] [INFO ] Applying decomposition
[2025-06-05 13:44:23] [INFO ] Flatten gal took : 21 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/graph6647108492231222115.txt' '-o' '/tmp/graph6647108492231222115.bin' '-w' '/tmp/graph6647108492231222115.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6647108492231222115.bin' '-l' '-1' '-v' '-w' '/tmp/graph6647108492231222115.weights' '-q' '0' '-e' '0.001'
[2025-06-05 13:44:23] [INFO ] Decomposing Gal with order
[2025-06-05 13:44:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 13:44:23] [INFO ] Removed a total of 60 redundant transitions.
[2025-06-05 13:44:23] [INFO ] Flatten gal took : 42 ms
[2025-06-05 13:44:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-05 13:44:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15603506894962008576.gal : 8 ms
[2025-06-05 13:44:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17254163257250527179.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/ReachabilityCardinality15603506894962008576.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17254163257250527179.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 ...309
Loading property file /tmp/ReachabilityCardinality17254163257250527179.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1778
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1778 after 9.96818e+15
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1.23562e+32 after 1.38422e+33
Detected timeout of ITS tools.
[2025-06-05 14:14:24] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9182093792982845296
[2025-06-05 14:14:24] [INFO ] Applying decomposition
[2025-06-05 14:14:24] [INFO ] Flatten gal took : 23 ms
[2025-06-05 14:14:24] [INFO ] Computing symmetric may disable matrix : 233 transitions.
[2025-06-05 14:14:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 14:14:24] [INFO ] Computing symmetric may enable matrix : 233 transitions.
[2025-06-05 14:14:24] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 14:14:24] [INFO ] Computing Do-Not-Accords matrix : 233 transitions.
[2025-06-05 14:14:24] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11799233785322117274.txt' '-o' '/tmp/graph11799233785322117274.bin' '-w' '/tmp/graph11799233785322117274.weights'
[2025-06-05 14:14:24] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9182093792982845296
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11799233785322117274.bin' '-l' '-1' '-v' '-w' '/tmp/graph11799233785322117274.weights' '-q' '0' '-e' '0.001'
[2025-06-05 14:14:24] [INFO ] Decomposing Gal with order
[2025-06-05 14:14:24] [INFO ] Rewriting arrays to variables to allow decomposition.
Running compilation step : cd /tmp/ltsmin9182093792982845296;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-05 14:14:24] [INFO ] Removed a total of 117 redundant transitions.
[2025-06-05 14:14:24] [INFO ] Flatten gal took : 24 ms
[2025-06-05 14:14:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 19 ms.
[2025-06-05 14:14:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13140648198949941759.gal : 3 ms
[2025-06-05 14:14:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8277484679572637728.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/ReachabilityCardinality13140648198949941759.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8277484679572637728.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/ReachabilityCardinality8277484679572637728.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 13
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :13 after 93
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :93 after 186
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :186 after 2232
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :4.90147e+07 after 2.27396e+08
Compilation finished in 759 ms.
Running link step : cd /tmp/ltsmin9182093792982845296;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin9182093792982845296;'/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' 'ShieldIIPtPT010BReachabilityCardinality202507==true'
Reachability property ShieldIIPt-PT-010B-ReachabilityCardinality-2025-07 is true.
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.07709e+22,1.02798,32736,1112,93,45967,513,653,178309,106,4204,0
Total reachable state count : 10770896277419377818624

Verifying 1 reachability properties.
Reachability property ShieldIIPt-PT-010B-ReachabilityCardinality-2025-07 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldIIPt-PT-010B-ReachabilityCardinality-2025-07,13824,1.27467,32992,144,29,45967,513,847,178309,121,4204,0
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1910118 ms.

BK_STOP 1749132865800

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

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-010B.tgz
mv ShieldIIPt-PT-010B 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 ;