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.r355-tall-171683759700870.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 greatspnxred
Input is ShieldRVs-PT-100A, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683759700870
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 45K 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 60K 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.3K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 21:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 12 21:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 20:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 12 20:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 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 652K 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-100A-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717068808121

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-100A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 11:33:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 11:33:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 11:33:29] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2024-05-30 11:33:29] [INFO ] Transformed 1403 places.
[2024-05-30 11:33:29] [INFO ] Transformed 1903 transitions.
[2024-05-30 11:33:29] [INFO ] Found NUPN structural information;
[2024-05-30 11:33:29] [INFO ] Parsed PT model containing 1403 places and 1903 transitions and 9200 arcs in 290 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVs-PT-100A-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-100A-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (28 resets) in 1621 ms. (24 steps per ms) remains 3/14 properties
FORMULA ShieldRVs-PT-100A-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 638 ms. (62 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 619 ms. (64 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 450 ms. (88 steps per ms) remains 3/3 properties
// Phase 1: matrix 1903 rows 1403 cols
[2024-05-30 11:33:30] [INFO ] Computed 401 invariants in 41 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 189/263 variables, 69/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 189/332 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1140/1403 variables, 332/664 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1403 variables, 1140/1804 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1403 variables, 0/1804 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1903/3306 variables, 1403/3207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3306 variables, 0/3207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/3306 variables, 0/3207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3306/3306 variables, and 3207 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1412 ms.
Refiners :[Domain max(s): 1403/1403 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1403/1403 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 189/263 variables, 69/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 189/332 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1140/1403 variables, 332/664 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1403 variables, 1140/1804 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 11:33:33] [INFO ] Deduced a trap composed of 8 places in 304 ms of which 30 ms to minimize.
[2024-05-30 11:33:33] [INFO ] Deduced a trap composed of 11 places in 252 ms of which 4 ms to minimize.
[2024-05-30 11:33:33] [INFO ] Deduced a trap composed of 11 places in 224 ms of which 3 ms to minimize.
[2024-05-30 11:33:33] [INFO ] Deduced a trap composed of 8 places in 198 ms of which 3 ms to minimize.
[2024-05-30 11:33:34] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 4 ms to minimize.
[2024-05-30 11:33:34] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 3 ms to minimize.
[2024-05-30 11:33:34] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 3 ms to minimize.
[2024-05-30 11:33:34] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 3 ms to minimize.
[2024-05-30 11:33:34] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 3 ms to minimize.
[2024-05-30 11:33:35] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 4 ms to minimize.
[2024-05-30 11:33:35] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 2 ms to minimize.
[2024-05-30 11:33:35] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 3 ms to minimize.
[2024-05-30 11:33:35] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 2 ms to minimize.
[2024-05-30 11:33:35] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 3 ms to minimize.
[2024-05-30 11:33:35] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 2 ms to minimize.
[2024-05-30 11:33:36] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 3 ms to minimize.
[2024-05-30 11:33:36] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 2 ms to minimize.
[2024-05-30 11:33:36] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 2 ms to minimize.
[2024-05-30 11:33:36] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 2 ms to minimize.
[2024-05-30 11:33:36] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1403 variables, 20/1824 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 11:33:36] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 2 ms to minimize.
[2024-05-30 11:33:36] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 2 ms to minimize.
[2024-05-30 11:33:37] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 2 ms to minimize.
[2024-05-30 11:33:37] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 1 ms to minimize.
[2024-05-30 11:33:37] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1403/3306 variables, and 1829 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5006 ms.
Refiners :[Domain max(s): 1403/1403 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 25/25 constraints]
After SMT, in 6577ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 74 out of 1403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1402 transition count 1902
Partial Free-agglomeration rule applied 181 times.
Drop transitions (Partial Free agglomeration) removed 181 transitions
Iterating global reduction 0 with 181 rules applied. Total rules applied 183 place count 1402 transition count 1902
Applied a total of 183 rules in 451 ms. Remains 1402 /1403 variables (removed 1) and now considering 1902/1903 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 460 ms. Remains : 1402/1403 places, 1902/1903 transitions.
RANDOM walk for 40000 steps (32 resets) in 553 ms. (72 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 363 ms. (109 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 329 ms. (121 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 295 ms. (135 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 93375 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :0 out of 3
Probabilistic random walk after 93375 steps, saw 37484 distinct states, run finished after 3004 ms. (steps per millisecond=31 ) properties seen :0
// Phase 1: matrix 1902 rows 1402 cols
[2024-05-30 11:33:41] [INFO ] Computed 401 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 189/263 variables, 69/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 189/332 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1139/1402 variables, 332/664 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1402 variables, 1139/1803 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1402 variables, 0/1803 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1902/3304 variables, 1402/3205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3304 variables, 0/3205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/3304 variables, 0/3205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3304/3304 variables, and 3205 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1077 ms.
Refiners :[Domain max(s): 1402/1402 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1402/1402 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 189/263 variables, 69/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 189/332 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1139/1402 variables, 332/664 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1402 variables, 1139/1803 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 11:33:42] [INFO ] Deduced a trap composed of 7 places in 240 ms of which 3 ms to minimize.
[2024-05-30 11:33:43] [INFO ] Deduced a trap composed of 7 places in 219 ms of which 3 ms to minimize.
[2024-05-30 11:33:43] [INFO ] Deduced a trap composed of 7 places in 225 ms of which 3 ms to minimize.
[2024-05-30 11:33:43] [INFO ] Deduced a trap composed of 7 places in 230 ms of which 3 ms to minimize.
[2024-05-30 11:33:43] [INFO ] Deduced a trap composed of 7 places in 233 ms of which 3 ms to minimize.
[2024-05-30 11:33:44] [INFO ] Deduced a trap composed of 7 places in 225 ms of which 3 ms to minimize.
[2024-05-30 11:33:44] [INFO ] Deduced a trap composed of 7 places in 223 ms of which 4 ms to minimize.
[2024-05-30 11:33:44] [INFO ] Deduced a trap composed of 11 places in 212 ms of which 3 ms to minimize.
[2024-05-30 11:33:44] [INFO ] Deduced a trap composed of 7 places in 208 ms of which 3 ms to minimize.
[2024-05-30 11:33:45] [INFO ] Deduced a trap composed of 7 places in 195 ms of which 3 ms to minimize.
[2024-05-30 11:33:45] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 2 ms to minimize.
[2024-05-30 11:33:45] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 3 ms to minimize.
[2024-05-30 11:33:45] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 2 ms to minimize.
[2024-05-30 11:33:45] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 3 ms to minimize.
[2024-05-30 11:33:46] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 3 ms to minimize.
[2024-05-30 11:33:46] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 3 ms to minimize.
[2024-05-30 11:33:46] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 2 ms to minimize.
[2024-05-30 11:33:46] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 2 ms to minimize.
[2024-05-30 11:33:46] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 2 ms to minimize.
[2024-05-30 11:33:47] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1402 variables, 20/1823 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 11:33:47] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 3 ms to minimize.
[2024-05-30 11:33:47] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 3 ms to minimize.
[2024-05-30 11:33:47] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 3 ms to minimize.
[2024-05-30 11:33:47] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 2 ms to minimize.
[2024-05-30 11:33:47] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 2 ms to minimize.
[2024-05-30 11:33:48] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 3 ms to minimize.
[2024-05-30 11:33:48] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 2 ms to minimize.
[2024-05-30 11:33:48] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 2 ms to minimize.
[2024-05-30 11:33:48] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 2 ms to minimize.
[2024-05-30 11:33:48] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 1 ms to minimize.
[2024-05-30 11:33:48] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 4 ms to minimize.
[2024-05-30 11:33:48] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 2 ms to minimize.
[2024-05-30 11:33:48] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
[2024-05-30 11:33:48] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-05-30 11:33:49] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-30 11:33:49] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-05-30 11:33:49] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-30 11:33:49] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-30 11:33:49] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-30 11:33:49] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1402 variables, 20/1843 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1402 variables, 0/1843 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1902/3304 variables, 1402/3245 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3304 variables, 3/3248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 11:33:51] [INFO ] Deduced a trap composed of 7 places in 263 ms of which 3 ms to minimize.
[2024-05-30 11:33:51] [INFO ] Deduced a trap composed of 7 places in 264 ms of which 4 ms to minimize.
[2024-05-30 11:33:51] [INFO ] Deduced a trap composed of 7 places in 225 ms of which 4 ms to minimize.
[2024-05-30 11:33:52] [INFO ] Deduced a trap composed of 12 places in 232 ms of which 4 ms to minimize.
[2024-05-30 11:33:52] [INFO ] Deduced a trap composed of 11 places in 241 ms of which 3 ms to minimize.
[2024-05-30 11:33:52] [INFO ] Deduced a trap composed of 7 places in 229 ms of which 3 ms to minimize.
[2024-05-30 11:33:53] [INFO ] Deduced a trap composed of 7 places in 233 ms of which 3 ms to minimize.
[2024-05-30 11:33:53] [INFO ] Deduced a trap composed of 7 places in 230 ms of which 4 ms to minimize.
[2024-05-30 11:33:53] [INFO ] Deduced a trap composed of 16 places in 239 ms of which 4 ms to minimize.
[2024-05-30 11:33:54] [INFO ] Deduced a trap composed of 7 places in 210 ms of which 4 ms to minimize.
[2024-05-30 11:33:54] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 3 ms to minimize.
[2024-05-30 11:33:54] [INFO ] Deduced a trap composed of 12 places in 212 ms of which 3 ms to minimize.
[2024-05-30 11:33:54] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 3 ms to minimize.
[2024-05-30 11:33:55] [INFO ] Deduced a trap composed of 7 places in 233 ms of which 4 ms to minimize.
[2024-05-30 11:33:55] [INFO ] Deduced a trap composed of 7 places in 225 ms of which 3 ms to minimize.
[2024-05-30 11:33:55] [INFO ] Deduced a trap composed of 7 places in 191 ms of which 3 ms to minimize.
[2024-05-30 11:33:56] [INFO ] Deduced a trap composed of 13 places in 209 ms of which 9 ms to minimize.
[2024-05-30 11:33:56] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 2 ms to minimize.
[2024-05-30 11:33:56] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 3 ms to minimize.
[2024-05-30 11:33:56] [INFO ] Deduced a trap composed of 12 places in 195 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/3304 variables, 20/3268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 11:33:57] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 3 ms to minimize.
[2024-05-30 11:33:58] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 2 ms to minimize.
[2024-05-30 11:33:58] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 3 ms to minimize.
[2024-05-30 11:33:58] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 2 ms to minimize.
[2024-05-30 11:33:58] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 2 ms to minimize.
[2024-05-30 11:33:59] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 2 ms to minimize.
[2024-05-30 11:33:59] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 2 ms to minimize.
[2024-05-30 11:33:59] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 2 ms to minimize.
[2024-05-30 11:33:59] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 2 ms to minimize.
[2024-05-30 11:33:59] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 2 ms to minimize.
[2024-05-30 11:34:00] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 2 ms to minimize.
[2024-05-30 11:34:00] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
[2024-05-30 11:34:00] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 2 ms to minimize.
[2024-05-30 11:34:00] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 2 ms to minimize.
[2024-05-30 11:34:00] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2024-05-30 11:34:01] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2024-05-30 11:34:01] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-05-30 11:34:01] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:34:01] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-05-30 11:34:01] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/3304 variables, 20/3288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 11:34:02] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 2 ms to minimize.
[2024-05-30 11:34:02] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 1 ms to minimize.
[2024-05-30 11:34:02] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:34:02] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-30 11:34:03] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-30 11:34:03] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 1 ms to minimize.
[2024-05-30 11:34:03] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-05-30 11:34:03] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-05-30 11:34:03] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-30 11:34:03] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-30 11:34:04] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-30 11:34:04] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-30 11:34:04] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-30 11:34:04] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-30 11:34:04] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-30 11:34:04] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-30 11:34:05] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-30 11:34:05] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-05-30 11:34:05] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-30 11:34:05] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/3304 variables, 20/3308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3304 variables, 0/3308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/3304 variables, 0/3308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3304/3304 variables, and 3308 constraints, problems are : Problem set: 0 solved, 3 unsolved in 24635 ms.
Refiners :[Domain max(s): 1402/1402 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1402/1402 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 100/100 constraints]
After SMT, in 25771ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA ShieldRVs-PT-100A-ReachabilityCardinality-2024-14 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 8075 ms.
Support contains 55 out of 1402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1402/1402 places, 1902/1902 transitions.
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1402 transition count 1902
Applied a total of 3 rules in 129 ms. Remains 1402 /1402 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 1402/1402 places, 1902/1902 transitions.
RANDOM walk for 40000 steps (32 resets) in 475 ms. (84 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 305 ms. (130 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 304 ms. (131 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 98312 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :0 out of 2
Probabilistic random walk after 98312 steps, saw 38643 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
// Phase 1: matrix 1902 rows 1402 cols
[2024-05-30 11:34:18] [INFO ] Computed 401 invariants in 17 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 142/197 variables, 52/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 142/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1205/1402 variables, 349/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1402 variables, 1205/1803 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1402 variables, 0/1803 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1902/3304 variables, 1402/3205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3304 variables, 0/3205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/3304 variables, 0/3205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3304/3304 variables, and 3205 constraints, problems are : Problem set: 0 solved, 2 unsolved in 852 ms.
Refiners :[Domain max(s): 1402/1402 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1402/1402 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/55 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 142/197 variables, 52/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 142/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1205/1402 variables, 349/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1402 variables, 1205/1803 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 11:34:19] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 2 ms to minimize.
[2024-05-30 11:34:20] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 3 ms to minimize.
[2024-05-30 11:34:20] [INFO ] Deduced a trap composed of 7 places in 197 ms of which 3 ms to minimize.
[2024-05-30 11:34:20] [INFO ] Deduced a trap composed of 20 places in 172 ms of which 3 ms to minimize.
[2024-05-30 11:34:20] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 3 ms to minimize.
[2024-05-30 11:34:20] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 3 ms to minimize.
[2024-05-30 11:34:21] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 2 ms to minimize.
[2024-05-30 11:34:21] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 3 ms to minimize.
[2024-05-30 11:34:21] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 3 ms to minimize.
[2024-05-30 11:34:21] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 3 ms to minimize.
[2024-05-30 11:34:21] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 2 ms to minimize.
[2024-05-30 11:34:22] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 2 ms to minimize.
[2024-05-30 11:34:22] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 2 ms to minimize.
[2024-05-30 11:34:22] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 2 ms to minimize.
[2024-05-30 11:34:22] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 2 ms to minimize.
[2024-05-30 11:34:22] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 3 ms to minimize.
[2024-05-30 11:34:22] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 3 ms to minimize.
[2024-05-30 11:34:22] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 2 ms to minimize.
[2024-05-30 11:34:23] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 2 ms to minimize.
[2024-05-30 11:34:23] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1402 variables, 20/1823 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 11:34:23] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 2 ms to minimize.
[2024-05-30 11:34:23] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 2 ms to minimize.
[2024-05-30 11:34:23] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 1 ms to minimize.
[2024-05-30 11:34:23] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 2 ms to minimize.
[2024-05-30 11:34:23] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 1 ms to minimize.
[2024-05-30 11:34:23] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2024-05-30 11:34:24] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 2 ms to minimize.
[2024-05-30 11:34:24] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-05-30 11:34:24] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-30 11:34:24] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1402 variables, 10/1833 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1402 variables, 0/1833 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1902/3304 variables, 1402/3235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3304 variables, 2/3237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 11:34:26] [INFO ] Deduced a trap composed of 7 places in 242 ms of which 3 ms to minimize.
[2024-05-30 11:34:26] [INFO ] Deduced a trap composed of 7 places in 227 ms of which 3 ms to minimize.
[2024-05-30 11:34:26] [INFO ] Deduced a trap composed of 16 places in 240 ms of which 4 ms to minimize.
[2024-05-30 11:34:27] [INFO ] Deduced a trap composed of 10 places in 202 ms of which 3 ms to minimize.
[2024-05-30 11:34:27] [INFO ] Deduced a trap composed of 11 places in 222 ms of which 3 ms to minimize.
[2024-05-30 11:34:27] [INFO ] Deduced a trap composed of 15 places in 252 ms of which 4 ms to minimize.
[2024-05-30 11:34:28] [INFO ] Deduced a trap composed of 12 places in 233 ms of which 4 ms to minimize.
[2024-05-30 11:34:28] [INFO ] Deduced a trap composed of 12 places in 250 ms of which 4 ms to minimize.
[2024-05-30 11:34:28] [INFO ] Deduced a trap composed of 7 places in 208 ms of which 4 ms to minimize.
[2024-05-30 11:34:29] [INFO ] Deduced a trap composed of 12 places in 188 ms of which 3 ms to minimize.
[2024-05-30 11:34:29] [INFO ] Deduced a trap composed of 13 places in 210 ms of which 4 ms to minimize.
[2024-05-30 11:34:29] [INFO ] Deduced a trap composed of 7 places in 198 ms of which 3 ms to minimize.
[2024-05-30 11:34:29] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 3 ms to minimize.
[2024-05-30 11:34:30] [INFO ] Deduced a trap composed of 19 places in 191 ms of which 3 ms to minimize.
[2024-05-30 11:34:30] [INFO ] Deduced a trap composed of 14 places in 196 ms of which 3 ms to minimize.
[2024-05-30 11:34:30] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 2 ms to minimize.
[2024-05-30 11:34:30] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 2 ms to minimize.
[2024-05-30 11:34:31] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 2 ms to minimize.
[2024-05-30 11:34:31] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 2 ms to minimize.
[2024-05-30 11:34:31] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/3304 variables, 20/3257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 11:34:32] [INFO ] Deduced a trap composed of 9 places in 200 ms of which 2 ms to minimize.
[2024-05-30 11:34:32] [INFO ] Deduced a trap composed of 7 places in 215 ms of which 3 ms to minimize.
[2024-05-30 11:34:32] [INFO ] Deduced a trap composed of 7 places in 223 ms of which 3 ms to minimize.
[2024-05-30 11:34:33] [INFO ] Deduced a trap composed of 7 places in 200 ms of which 3 ms to minimize.
[2024-05-30 11:34:33] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 2 ms to minimize.
[2024-05-30 11:34:33] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 2 ms to minimize.
[2024-05-30 11:34:34] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 2 ms to minimize.
[2024-05-30 11:34:34] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 3 ms to minimize.
[2024-05-30 11:34:34] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 3 ms to minimize.
[2024-05-30 11:34:34] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 2 ms to minimize.
[2024-05-30 11:34:35] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 3 ms to minimize.
[2024-05-30 11:34:35] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 3 ms to minimize.
[2024-05-30 11:34:35] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 2 ms to minimize.
[2024-05-30 11:34:35] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 3 ms to minimize.
[2024-05-30 11:34:36] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 2 ms to minimize.
[2024-05-30 11:34:36] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 2 ms to minimize.
[2024-05-30 11:34:36] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 3 ms to minimize.
[2024-05-30 11:34:36] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 3 ms to minimize.
[2024-05-30 11:34:37] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 2 ms to minimize.
[2024-05-30 11:34:37] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/3304 variables, 20/3277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 11:34:37] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 2 ms to minimize.
[2024-05-30 11:34:37] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 2 ms to minimize.
[2024-05-30 11:34:38] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 1 ms to minimize.
[2024-05-30 11:34:38] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 1 ms to minimize.
[2024-05-30 11:34:38] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2024-05-30 11:34:38] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 2 ms to minimize.
[2024-05-30 11:34:38] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 3 ms to minimize.
[2024-05-30 11:34:39] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 2 ms to minimize.
[2024-05-30 11:34:39] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 2 ms to minimize.
[2024-05-30 11:34:39] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 2 ms to minimize.
[2024-05-30 11:34:39] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 1 ms to minimize.
[2024-05-30 11:34:39] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2024-05-30 11:34:40] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-30 11:34:40] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-30 11:34:40] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-30 11:34:40] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-30 11:34:40] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-30 11:34:40] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-30 11:34:41] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 4 ms to minimize.
[2024-05-30 11:34:41] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/3304 variables, 20/3297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 11:34:41] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 1 ms to minimize.
[2024-05-30 11:34:41] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-30 11:34:42] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-30 11:34:42] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-05-30 11:34:42] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-05-30 11:34:42] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:34:42] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2024-05-30 11:34:42] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-30 11:34:43] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-30 11:34:43] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-30 11:34:43] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-05-30 11:34:43] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-30 11:34:43] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-30 11:34:43] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-05-30 11:34:43] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-30 11:34:43] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-30 11:34:44] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-30 11:34:44] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-30 11:34:44] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
[2024-05-30 11:34:44] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/3304 variables, 20/3317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 11:34:45] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 2 ms to minimize.
[2024-05-30 11:34:45] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-30 11:34:45] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-30 11:34:45] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/3304 variables, 4/3321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3304 variables, 0/3321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/3304 variables, 0/3321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3304/3304 variables, and 3321 constraints, problems are : Problem set: 0 solved, 2 unsolved in 26953 ms.
Refiners :[Domain max(s): 1402/1402 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1402/1402 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 114/114 constraints]
After SMT, in 27860ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA ShieldRVs-PT-100A-ReachabilityCardinality-2024-04 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 3267 ms.
Support contains 36 out of 1402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1402/1402 places, 1902/1902 transitions.
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 1402 transition count 1902
Applied a total of 6 rules in 119 ms. Remains 1402 /1402 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 1402/1402 places, 1902/1902 transitions.
RANDOM walk for 40000 steps (32 resets) in 678 ms. (58 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 332 ms. (120 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 108606 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :0 out of 1
Probabilistic random walk after 108606 steps, saw 41617 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
// Phase 1: matrix 1902 rows 1402 cols
[2024-05-30 11:34:53] [INFO ] Computed 401 invariants in 16 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 99/135 variables, 35/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 99/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1267/1402 variables, 366/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1402 variables, 1267/1803 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1402 variables, 0/1803 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1902/3304 variables, 1402/3205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3304 variables, 0/3205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/3304 variables, 0/3205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3304/3304 variables, and 3205 constraints, problems are : Problem set: 0 solved, 1 unsolved in 745 ms.
Refiners :[Domain max(s): 1402/1402 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1402/1402 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 99/135 variables, 35/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 99/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1267/1402 variables, 366/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1402 variables, 1267/1803 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 11:34:54] [INFO ] Deduced a trap composed of 7 places in 221 ms of which 3 ms to minimize.
[2024-05-30 11:34:54] [INFO ] Deduced a trap composed of 7 places in 219 ms of which 3 ms to minimize.
[2024-05-30 11:34:54] [INFO ] Deduced a trap composed of 15 places in 210 ms of which 3 ms to minimize.
[2024-05-30 11:34:55] [INFO ] Deduced a trap composed of 11 places in 196 ms of which 3 ms to minimize.
[2024-05-30 11:34:55] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 3 ms to minimize.
[2024-05-30 11:34:55] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 3 ms to minimize.
[2024-05-30 11:34:55] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 2 ms to minimize.
[2024-05-30 11:34:55] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 2 ms to minimize.
[2024-05-30 11:34:56] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 2 ms to minimize.
[2024-05-30 11:34:56] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 3 ms to minimize.
[2024-05-30 11:34:56] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 2 ms to minimize.
[2024-05-30 11:34:56] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 2 ms to minimize.
[2024-05-30 11:34:56] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 2 ms to minimize.
[2024-05-30 11:34:56] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 3 ms to minimize.
[2024-05-30 11:34:56] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 2 ms to minimize.
[2024-05-30 11:34:57] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 2 ms to minimize.
[2024-05-30 11:34:57] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 4 ms to minimize.
[2024-05-30 11:34:57] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 2 ms to minimize.
[2024-05-30 11:34:57] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 2 ms to minimize.
[2024-05-30 11:34:57] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1402 variables, 20/1823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 11:34:57] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 2 ms to minimize.
[2024-05-30 11:34:57] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 2 ms to minimize.
[2024-05-30 11:34:58] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 2 ms to minimize.
[2024-05-30 11:34:58] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 2 ms to minimize.
[2024-05-30 11:34:58] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
[2024-05-30 11:34:58] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 2 ms to minimize.
[2024-05-30 11:34:58] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 2 ms to minimize.
[2024-05-30 11:34:58] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 2 ms to minimize.
[2024-05-30 11:34:58] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:34:58] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-05-30 11:34:58] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2024-05-30 11:34:59] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 0 ms to minimize.
[2024-05-30 11:34:59] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-30 11:34:59] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-30 11:34:59] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2024-05-30 11:34:59] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-30 11:34:59] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-30 11:34:59] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-30 11:34:59] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1402 variables, 19/1842 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1402 variables, 0/1842 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1902/3304 variables, 1402/3244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3304 variables, 1/3245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 11:35:00] [INFO ] Deduced a trap composed of 7 places in 240 ms of which 3 ms to minimize.
[2024-05-30 11:35:01] [INFO ] Deduced a trap composed of 7 places in 252 ms of which 4 ms to minimize.
[2024-05-30 11:35:01] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 2 ms to minimize.
[2024-05-30 11:35:01] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 2 ms to minimize.
[2024-05-30 11:35:01] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 3 ms to minimize.
[2024-05-30 11:35:02] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 2 ms to minimize.
[2024-05-30 11:35:02] [INFO ] Deduced a trap composed of 7 places in 227 ms of which 3 ms to minimize.
[2024-05-30 11:35:02] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 2 ms to minimize.
[2024-05-30 11:35:02] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 3 ms to minimize.
[2024-05-30 11:35:03] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 3 ms to minimize.
[2024-05-30 11:35:03] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 2 ms to minimize.
[2024-05-30 11:35:03] [INFO ] Deduced a trap composed of 8 places in 178 ms of which 3 ms to minimize.
[2024-05-30 11:35:04] [INFO ] Deduced a trap composed of 6 places in 224 ms of which 6 ms to minimize.
[2024-05-30 11:35:04] [INFO ] Deduced a trap composed of 8 places in 211 ms of which 3 ms to minimize.
[2024-05-30 11:35:04] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 2 ms to minimize.
[2024-05-30 11:35:04] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 3 ms to minimize.
[2024-05-30 11:35:05] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 2 ms to minimize.
[2024-05-30 11:35:05] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 3 ms to minimize.
[2024-05-30 11:35:05] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 2 ms to minimize.
[2024-05-30 11:35:05] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/3304 variables, 20/3265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 11:35:06] [INFO ] Deduced a trap composed of 7 places in 199 ms of which 3 ms to minimize.
[2024-05-30 11:35:06] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 3 ms to minimize.
[2024-05-30 11:35:06] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 2 ms to minimize.
[2024-05-30 11:35:07] [INFO ] Deduced a trap composed of 15 places in 212 ms of which 3 ms to minimize.
[2024-05-30 11:35:07] [INFO ] Deduced a trap composed of 7 places in 210 ms of which 3 ms to minimize.
[2024-05-30 11:35:07] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 2 ms to minimize.
[2024-05-30 11:35:08] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 2 ms to minimize.
[2024-05-30 11:35:08] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 3 ms to minimize.
[2024-05-30 11:35:08] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 3 ms to minimize.
[2024-05-30 11:35:08] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 2 ms to minimize.
[2024-05-30 11:35:09] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 3 ms to minimize.
[2024-05-30 11:35:09] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 2 ms to minimize.
[2024-05-30 11:35:09] [INFO ] Deduced a trap composed of 13 places in 207 ms of which 4 ms to minimize.
[2024-05-30 11:35:09] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 2 ms to minimize.
[2024-05-30 11:35:10] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 2 ms to minimize.
[2024-05-30 11:35:10] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 2 ms to minimize.
[2024-05-30 11:35:10] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 2 ms to minimize.
[2024-05-30 11:35:10] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 2 ms to minimize.
[2024-05-30 11:35:11] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 2 ms to minimize.
[2024-05-30 11:35:11] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/3304 variables, 20/3285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 11:35:11] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 2 ms to minimize.
[2024-05-30 11:35:11] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 3 ms to minimize.
[2024-05-30 11:35:12] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 2 ms to minimize.
[2024-05-30 11:35:12] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 2 ms to minimize.
[2024-05-30 11:35:12] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 2 ms to minimize.
[2024-05-30 11:35:12] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 2 ms to minimize.
[2024-05-30 11:35:13] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 2 ms to minimize.
[2024-05-30 11:35:13] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 1 ms to minimize.
[2024-05-30 11:35:13] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 1 ms to minimize.
[2024-05-30 11:35:13] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 2 ms to minimize.
[2024-05-30 11:35:13] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-05-30 11:35:13] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2024-05-30 11:35:14] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2024-05-30 11:35:14] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 1 ms to minimize.
[2024-05-30 11:35:14] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 1 ms to minimize.
[2024-05-30 11:35:14] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-05-30 11:35:14] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2024-05-30 11:35:15] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 1 ms to minimize.
[2024-05-30 11:35:15] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2024-05-30 11:35:15] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/3304 variables, 20/3305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 11:35:15] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 1 ms to minimize.
[2024-05-30 11:35:15] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 2 ms to minimize.
[2024-05-30 11:35:16] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 1 ms to minimize.
[2024-05-30 11:35:16] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2024-05-30 11:35:16] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-05-30 11:35:16] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
[2024-05-30 11:35:16] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 1 ms to minimize.
[2024-05-30 11:35:16] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-30 11:35:17] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-05-30 11:35:17] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2024-05-30 11:35:17] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2024-05-30 11:35:17] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 1 ms to minimize.
[2024-05-30 11:35:17] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 1 ms to minimize.
[2024-05-30 11:35:17] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 1 ms to minimize.
[2024-05-30 11:35:18] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-05-30 11:35:18] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
[2024-05-30 11:35:18] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-30 11:35:18] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 2 ms to minimize.
[2024-05-30 11:35:18] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
[2024-05-30 11:35:19] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/3304 variables, 20/3325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 11:35:19] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-05-30 11:35:19] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2024-05-30 11:35:19] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 2 ms to minimize.
[2024-05-30 11:35:19] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
[2024-05-30 11:35:20] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-05-30 11:35:20] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-30 11:35:20] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2024-05-30 11:35:20] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:35:20] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
[2024-05-30 11:35:20] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 1 ms to minimize.
[2024-05-30 11:35:21] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
[2024-05-30 11:35:21] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
[2024-05-30 11:35:21] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2024-05-30 11:35:21] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
[2024-05-30 11:35:21] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:35:21] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:35:22] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/3304 variables, 17/3342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3304 variables, 0/3342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/3304 variables, 0/3342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3304/3304 variables, and 3342 constraints, problems are : Problem set: 0 solved, 1 unsolved in 28619 ms.
Refiners :[Domain max(s): 1402/1402 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1402/1402 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 136/136 constraints]
After SMT, in 29406ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1685 ms.
Support contains 36 out of 1402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1402/1402 places, 1902/1902 transitions.
Applied a total of 0 rules in 63 ms. Remains 1402 /1402 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 1402/1402 places, 1902/1902 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1402/1402 places, 1902/1902 transitions.
Applied a total of 0 rules in 65 ms. Remains 1402 /1402 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
[2024-05-30 11:35:24] [INFO ] Invariant cache hit.
[2024-05-30 11:35:25] [INFO ] Implicit Places using invariants in 761 ms returned []
[2024-05-30 11:35:25] [INFO ] Invariant cache hit.
[2024-05-30 11:35:26] [INFO ] Implicit Places using invariants and state equation in 1853 ms returned []
Implicit Place search using SMT with State Equation took 2621 ms to find 0 implicit places.
[2024-05-30 11:35:27] [INFO ] Redundant transitions in 613 ms returned []
Running 1901 sub problems to find dead transitions.
[2024-05-30 11:35:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1901 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1401/3304 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1901 unsolved in 30051 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 1901/1901 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1901 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1901 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1401/3304 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1901 unsolved in 30033 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 0/1901 constraints, Known Traps: 0/0 constraints]
After SMT, in 61238ms problems are : Problem set: 0 solved, 1901 unsolved
Search for dead transitions found 0 dead transitions in 61258ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64584 ms. Remains : 1402/1402 places, 1902/1902 transitions.
[2024-05-30 11:36:28] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-30 11:36:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1402 places, 1902 transitions and 9578 arcs took 14 ms.
[2024-05-30 11:36:29] [INFO ] Flatten gal took : 281 ms
Total runtime 180119 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldRVs-PT-100A

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1402
TRANSITIONS: 1902
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.044s, Sys 0.008s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.006s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1718
MODEL NAME: /home/mcc/execution/411/model
1402 places, 1902 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ShieldRVs-PT-100A-ReachabilityCardinality-2024-03 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717070668362

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

+ 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

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-100A"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is ShieldRVs-PT-100A, 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 r355-tall-171683759700870"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-100A.tgz
mv ShieldRVs-PT-100A 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 ;