Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r356-tall-171683761800750.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is ShieldRVs-PT-003B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761800750
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 17:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Apr 12 17:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 12 17:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 12 17:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 36K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717033608141

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-003B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-30 01:46:49] [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]
[2024-05-30 01:46:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 01:46:49] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2024-05-30 01:46:49] [INFO ] Transformed 123 places.
[2024-05-30 01:46:49] [INFO ] Transformed 138 transitions.
[2024-05-30 01:46:49] [INFO ] Found NUPN structural information;
[2024-05-30 01:46:49] [INFO ] Parsed PT model containing 123 places and 138 transitions and 432 arcs in 153 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVs-PT-003B-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-003B-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 01:46:49] [INFO ] Flatten gal took : 43 ms
[2024-05-30 01:46:49] [INFO ] Flatten gal took : 24 ms
[2024-05-30 01:46:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8317815655054413545.gal : 10 ms
[2024-05-30 01:46:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14472033799754327489.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8317815655054413545.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14472033799754327489.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (268 resets) in 1509 ms. (26 steps per ms) remains 4/14 properties
FORMULA ShieldRVs-PT-003B-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-003B-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-003B-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-003B-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-003B-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-003B-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-003B-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-003B-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-003B-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-003B-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality14472033799754327489.prop.
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :10 after 15
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :15 after 153
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :153 after 1814
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :1814 after 883390
Reachability property ShieldRVs-PT-003B-ReachabilityCardinality-2024-11 is true.
Invariant property ShieldRVs-PT-003B-ReachabilityCardinality-2024-10 does not hold.
BEST_FIRST walk for 40004 steps (61 resets) in 872 ms. (45 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (50 resets) in 518 ms. (77 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (62 resets) in 284 ms. (140 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (58 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
// Phase 1: matrix 138 rows 123 cols
[2024-05-30 01:46:50] [INFO ] Computed 13 invariants in 17 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem ShieldRVs-PT-003B-ReachabilityCardinality-2024-03 is UNSAT
FORMULA ShieldRVs-PT-003B-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 39/123 variables, 12/97 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 39/136 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 138/261 variables, 123/259 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 0/259 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/261 variables, 0/259 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 261/261 variables, and 259 constraints, problems are : Problem set: 1 solved, 3 unsolved in 458 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 64/64 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 59/123 variables, 13/77 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 59/136 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-30 01:46:51] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 7 ms to minimize.
[2024-05-30 01:46:51] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 2 ms to minimize.
[2024-05-30 01:46:51] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-30 01:46:51] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:46:51] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:46:51] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:46:51] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:46:51] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:46:51] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:46:51] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-30 01:46:51] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-30 01:46:51] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 7 ms to minimize.
[2024-05-30 01:46:51] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:46:51] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:46:51] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:46:52] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2024-05-30 01:46:52] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:46:52] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 18/154 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-30 01:46:52] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:46:52] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 2/156 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-30 01:46:52] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:46:52] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-30 01:46:52] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-30 01:46:52] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:46:52] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:46:52] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 6/162 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/162 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 138/261 variables, 123/285 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 3/288 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-30 01:46:52] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
[2024-05-30 01:46:52] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:46:52] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:46:52] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 4/292 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-30 01:46:53] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 1/293 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/261 variables, 0/293 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/261 variables, 0/293 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 261/261 variables, and 293 constraints, problems are : Problem set: 1 solved, 3 unsolved in 2073 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 31/31 constraints]
After SMT, in 2645ms problems are : Problem set: 1 solved, 3 unsolved
Reachability property ShieldRVs-PT-003B-ReachabilityCardinality-2024-08 is true.
Parikh walk visited 0 properties in 949 ms.
Support contains 64 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 138/138 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 123 transition count 135
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 120 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 119 transition count 134
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 8 place count 119 transition count 127
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 22 place count 112 transition count 127
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 26 place count 108 transition count 123
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 108 transition count 123
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 30 place count 108 transition count 121
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 34 place count 106 transition count 121
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 46 place count 100 transition count 115
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 49 place count 100 transition count 115
Applied a total of 49 rules in 38 ms. Remains 100 /123 variables (removed 23) and now considering 115/138 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 100/123 places, 115/138 transitions.
RANDOM walk for 40000 steps (335 resets) in 322 ms. (123 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (67 resets) in 120 ms. (330 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (89 resets) in 104 ms. (380 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (70 resets) in 51 ms. (769 steps per ms) remains 2/3 properties
FORMULA ShieldRVs-PT-003B-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 115 rows 100 cols
[2024-05-30 01:46:54] [INFO ] Computed 13 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/100 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 115/215 variables, 100/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/215 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 113 constraints, problems are : Problem set: 0 solved, 2 unsolved in 110 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/100 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 01:46:54] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-30 01:46:54] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:46:54] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:46:54] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 0 ms to minimize.
[2024-05-30 01:46:54] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:46:54] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-30 01:46:54] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-30 01:46:54] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:46:55] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
Invariant property ShieldRVs-PT-003B-ReachabilityCardinality-2024-02 does not hold.
Reachability property ShieldRVs-PT-003B-ReachabilityCardinality-2024-01 is true.
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :2.55956e+06 after 3.81961e+06
[2024-05-30 01:46:55] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 115/215 variables, 100/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 01:46:55] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:46:55] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:46:55] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/215 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 128 constraints, problems are : Problem set: 0 solved, 2 unsolved in 929 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 13/13 constraints]
After SMT, in 1053ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 203 ms.
Support contains 61 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 115/115 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 98 transition count 113
Applied a total of 4 rules in 22 ms. Remains 98 /100 variables (removed 2) and now considering 113/115 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 98/100 places, 113/115 transitions.
RANDOM walk for 40000 steps (332 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (68 resets) in 118 ms. (336 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (91 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1698700 steps, run timeout after 3001 ms. (steps per millisecond=566 ) properties seen :0 out of 2
Probabilistic random walk after 1698700 steps, saw 260595 distinct states, run finished after 3006 ms. (steps per millisecond=565 ) properties seen :0
// Phase 1: matrix 113 rows 98 cols
[2024-05-30 01:46:58] [INFO ] Computed 13 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 37/98 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 113/211 variables, 98/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/211 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 111 constraints, problems are : Problem set: 0 solved, 2 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 37/98 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 01:46:59] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:46:59] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:46:59] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 0 ms to minimize.
[2024-05-30 01:46:59] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:46:59] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:46:59] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:46:59] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 1 ms to minimize.
[2024-05-30 01:46:59] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:46:59] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:46:59] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:46:59] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:46:59] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 01:46:59] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:46:59] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:46:59] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:46:59] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:46:59] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:46:59] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:46:59] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:46:59] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 113/211 variables, 98/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 01:46:59] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:46:59] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:46:59] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 3/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 01:46:59] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:46:59] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:47:00] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:47:00] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 01:47:00] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/211 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 141 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1366 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 28/28 constraints]
After SMT, in 1478ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 131 ms.
Support contains 61 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 113/113 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 98/98 places, 113/113 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 113/113 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2024-05-30 01:47:00] [INFO ] Invariant cache hit.
[2024-05-30 01:47:00] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-30 01:47:00] [INFO ] Invariant cache hit.
[2024-05-30 01:47:00] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2024-05-30 01:47:00] [INFO ] Redundant transitions in 2 ms returned []
Running 112 sub problems to find dead transitions.
[2024-05-30 01:47:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-30 01:47:01] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-30 01:47:01] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:47:01] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:47:01] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:47:01] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-30 01:47:01] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:47:01] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:47:01] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :3.81961e+06 after 3.8991e+06
[2024-05-30 01:47:01] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:47:01] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
Reachability property ShieldRVs-PT-003B-ReachabilityCardinality-2024-12 is true.
[2024-05-30 01:47:01] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:47:01] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:47:01] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-30 01:47:01] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:47:01] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:47:01] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:47:01] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:47:01] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:47:01] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:47:01] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-30 01:47:01] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:47:01] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:47:02] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:47:02] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:47:02] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:47:02] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:47:02] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:47:02] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:47:02] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:47:02] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:47:02] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:47:02] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:47:02] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:47:02] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:47:02] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:47:02] [INFO ] Deduced a trap composed of 14 places in 16 ms of which 1 ms to minimize.
[2024-05-30 01:47:02] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:47:02] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:47:02] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:47:02] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-30 01:47:02] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:47:02] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:47:02] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-30 01:47:02] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:47:03] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:47:03] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:47:03] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:47:03] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:47:03] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:47:03] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:47:03] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:47:03] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:47:03] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:47:03] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:47:03] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:47:03] [INFO ] Deduced a trap composed of 20 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:47:03] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:47:03] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:47:03] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:47:03] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-30 01:47:03] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:47:03] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2024-05-30 01:47:03] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:47:03] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 1 ms to minimize.
[2024-05-30 01:47:03] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:47:03] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:47:03] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:47:03] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-30 01:47:03] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:47:03] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 0 ms to minimize.
[2024-05-30 01:47:03] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:47:04] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:47:04] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:47:04] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:47:04] [INFO ] Deduced a trap composed of 23 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:47:04] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:47:04] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:47:04] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:47:04] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:47:04] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-30 01:47:04] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:47:04] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:47:04] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:47:04] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:47:04] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:47:04] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:47:04] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:47:04] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:47:04] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:47:04] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:47:04] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:47:04] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:47:04] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:47:04] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:47:04] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:47:05] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:47:05] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:47:05] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:47:05] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:47:05] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-30 01:47:05] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:47:05] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:47:05] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:47:05] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:47:05] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:47:05] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:47:05] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:47:05] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:47:05] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 9/122 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-30 01:47:06] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:47:06] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:47:06] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:47:06] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:47:06] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:47:06] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:47:06] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:47:06] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:47:06] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:47:06] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:47:06] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:47:06] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:47:06] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:47:06] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 14/136 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-30 01:47:06] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:47:06] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:47:06] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:47:06] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:47:07] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:47:07] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:47:07] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:47:07] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:47:07] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:47:07] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:47:07] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:47:07] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:47:07] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :3.8991e+06 after 3.92278e+06
[2024-05-30 01:47:07] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:47:07] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 15/151 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-30 01:47:07] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:47:07] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:47:07] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:47:07] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:47:08] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:47:08] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:47:08] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 9 ms to minimize.
[2024-05-30 01:47:08] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:47:08] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:47:08] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:47:08] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:47:08] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:47:08] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 13/164 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-30 01:47:08] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:47:08] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-30 01:47:09] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:47:09] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:47:09] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:47:09] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/98 variables, 4/170 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/98 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 14 (OVERLAPS) 113/211 variables, 98/268 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-30 01:47:10] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-05-30 01:47:10] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:47:10] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:47:10] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:47:10] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:47:10] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:47:10] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:47:10] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:47:10] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:47:10] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:47:10] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:47:10] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:47:10] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:47:10] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:47:10] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:47:10] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/211 variables, 16/284 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-30 01:47:11] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:47:11] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:47:11] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
[2024-05-30 01:47:11] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 2 ms to minimize.
[2024-05-30 01:47:11] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:47:11] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:47:11] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:47:11] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:47:12] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/211 variables, 9/293 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-30 01:47:12] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:47:12] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 4 ms to minimize.
[2024-05-30 01:47:12] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-05-30 01:47:12] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:47:12] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:47:12] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 2 ms to minimize.
[2024-05-30 01:47:12] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:47:12] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:47:12] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:47:12] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:47:12] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:47:12] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :3.92278e+06 after 3.98488e+06
At refinement iteration 17 (INCLUDED_ONLY) 0/211 variables, 12/305 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-30 01:47:13] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2024-05-30 01:47:13] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:47:13] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:47:13] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:47:13] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/211 variables, 5/310 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-30 01:47:14] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:47:14] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/211 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-30 01:47:15] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-30 01:47:15] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:47:15] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-05-30 01:47:15] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:47:15] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:47:15] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:47:15] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:47:15] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/211 variables, 8/320 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-30 01:47:16] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/211 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-30 01:47:16] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:47:16] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:47:17] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:47:17] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:47:17] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/211 variables, 5/326 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-30 01:47:17] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:47:17] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:47:17] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:47:17] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/211 variables, 4/330 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-30 01:47:18] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/211 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-30 01:47:19] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:47:19] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:47:19] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :3.98488e+06 after 3.98951e+06
[2024-05-30 01:47:19] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/211 variables, 4/335 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-30 01:47:20] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/211 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/211 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-30 01:47:21] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
At refinement iteration 28 (OVERLAPS) 0/211 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-30 01:47:22] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:47:22] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:47:22] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:47:22] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:47:22] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:47:22] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:47:22] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/211 variables, 7/344 constraints. Problems are: Problem set: 0 solved, 112 unsolved
Reachability property ShieldRVs-PT-003B-ReachabilityCardinality-2024-09 is true.
At refinement iteration 30 (INCLUDED_ONLY) 0/211 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-30 01:47:24] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 31 (OVERLAPS) 0/211 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/211 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-30 01:47:25] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:47:25] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:47:25] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:47:25] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:47:25] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:47:25] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
At refinement iteration 33 (OVERLAPS) 0/211 variables, 6/351 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-30 01:47:26] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/211 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/211 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 112 unsolved
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :3.98951e+06 after 4.70567e+06
At refinement iteration 36 (OVERLAPS) 0/211 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 352 constraints, problems are : Problem set: 0 solved, 112 unsolved in 28133 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 241/241 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 241/254 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 113/211 variables, 98/352 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 112/464 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-30 01:47:30] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:47:31] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:47:31] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:47:31] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 4/468 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-30 01:47:34] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:47:34] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:47:34] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:47:35] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 4/472 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-30 01:47:38] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:47:38] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:47:39] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:47:39] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:47:39] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:47:39] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:47:40] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 7/479 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (OVERLAPS) 0/211 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 479 constraints, problems are : Problem set: 0 solved, 112 unsolved in 23400 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 256/256 constraints]
After SMT, in 51563ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 51566ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51682 ms. Remains : 98/98 places, 113/113 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-30 01:47:52] [INFO ] Flatten gal took : 14 ms
[2024-05-30 01:47:52] [INFO ] Applying decomposition
[2024-05-30 01:47:52] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8282429570889255437.txt' '-o' '/tmp/graph8282429570889255437.bin' '-w' '/tmp/graph8282429570889255437.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8282429570889255437.bin' '-l' '-1' '-v' '-w' '/tmp/graph8282429570889255437.weights' '-q' '0' '-e' '0.001'
[2024-05-30 01:47:52] [INFO ] Decomposing Gal with order
[2024-05-30 01:47:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 01:47:52] [INFO ] Removed a total of 99 redundant transitions.
[2024-05-30 01:47:52] [INFO ] Flatten gal took : 53 ms
[2024-05-30 01:47:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-30 01:47:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13509948900031756419.gal : 12 ms
[2024-05-30 01:47:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7772226131524335011.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13509948900031756419.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7772226131524335011.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality7772226131524335011.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 351
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :351 after 135907
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :547702 after 5.20239e+06
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :4.5428e+08 after 1.21916e+09
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,5.28131e+09,0.529492,18052,1305,82,25231,330,490,54214,65,1690,0
Total reachable state count : 5281314130

Verifying 2 reachability properties.
Reachability property ShieldRVs-PT-003B-ReachabilityCardinality-2024-05 does not hold.
FORMULA ShieldRVs-PT-003B-ReachabilityCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
No reachable states exhibit your property : ShieldRVs-PT-003B-ReachabilityCardinality-2024-05

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVs-PT-003B-ReachabilityCardinality-2024-05,0,0.533274,18312,1,0,25231,330,579,54214,75,1690,471
Reachability property ShieldRVs-PT-003B-ReachabilityCardinality-2024-06 does not hold.
FORMULA ShieldRVs-PT-003B-ReachabilityCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
No reachable states exhibit your property : ShieldRVs-PT-003B-ReachabilityCardinality-2024-06

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVs-PT-003B-ReachabilityCardinality-2024-06,0,0.540374,18312,1,0,25231,330,627,54214,78,1690,2918
All properties solved without resorting to model-checking.
Total runtime 63699 ms.

BK_STOP 1717033672989

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="ShieldRVs-PT-003B"
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-5568"
echo " Executing tool itstools"
echo " Input is ShieldRVs-PT-003B, 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 r356-tall-171683761800750"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-003B.tgz
mv ShieldRVs-PT-003B 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;