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.r528-tall-171683762000870.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 ltsminxred
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 r528-tall-171683762000870
=====================================================================

--------------------
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 1717273048067

Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:17:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 20:17:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:17:29] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2024-06-01 20:17:29] [INFO ] Transformed 1403 places.
[2024-06-01 20:17:29] [INFO ] Transformed 1903 transitions.
[2024-06-01 20:17:29] [INFO ] Found NUPN structural information;
[2024-06-01 20:17:29] [INFO ] Parsed PT model containing 1403 places and 1903 transitions and 9200 arcs in 281 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 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 1579 ms. (25 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 40002 steps (8 resets) in 544 ms. (73 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 763 ms. (52 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 578 ms. (69 steps per ms) remains 3/3 properties
// Phase 1: matrix 1903 rows 1403 cols
[2024-06-01 20:17:30] [INFO ] Computed 401 invariants in 38 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 1484 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-06-01 20:17:33] [INFO ] Deduced a trap composed of 8 places in 333 ms of which 36 ms to minimize.
[2024-06-01 20:17:33] [INFO ] Deduced a trap composed of 11 places in 276 ms of which 4 ms to minimize.
[2024-06-01 20:17:33] [INFO ] Deduced a trap composed of 11 places in 251 ms of which 4 ms to minimize.
[2024-06-01 20:17:33] [INFO ] Deduced a trap composed of 8 places in 223 ms of which 4 ms to minimize.
[2024-06-01 20:17:34] [INFO ] Deduced a trap composed of 10 places in 210 ms of which 3 ms to minimize.
[2024-06-01 20:17:34] [INFO ] Deduced a trap composed of 7 places in 207 ms of which 3 ms to minimize.
[2024-06-01 20:17:34] [INFO ] Deduced a trap composed of 7 places in 206 ms of which 3 ms to minimize.
[2024-06-01 20:17:34] [INFO ] Deduced a trap composed of 7 places in 202 ms of which 3 ms to minimize.
[2024-06-01 20:17:35] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 3 ms to minimize.
[2024-06-01 20:17:35] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 3 ms to minimize.
[2024-06-01 20:17:35] [INFO ] Deduced a trap composed of 7 places in 187 ms of which 3 ms to minimize.
[2024-06-01 20:17:35] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 2 ms to minimize.
[2024-06-01 20:17:35] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 3 ms to minimize.
[2024-06-01 20:17:36] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 2 ms to minimize.
[2024-06-01 20:17:36] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 2 ms to minimize.
[2024-06-01 20:17:36] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 2 ms to minimize.
[2024-06-01 20:17:36] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 3 ms to minimize.
[2024-06-01 20:17:36] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 2 ms to minimize.
[2024-06-01 20:17:36] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 3 ms to minimize.
[2024-06-01 20:17:37] [INFO ] Deduced a trap composed of 12 places in 129 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-06-01 20:17:37] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 2 ms to minimize.
[2024-06-01 20:17:37] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 1 ms to minimize.
[2024-06-01 20:17:37] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 2 ms to minimize.
SMT process timed out in 6800ms, After SMT, 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 452 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 463 ms. Remains : 1402/1403 places, 1902/1903 transitions.
RANDOM walk for 40000 steps (32 resets) in 639 ms. (62 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 400 ms. (99 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 357 ms. (111 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 309 ms. (129 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 92401 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :0 out of 3
Probabilistic random walk after 92401 steps, saw 37251 distinct states, run finished after 3004 ms. (steps per millisecond=30 ) properties seen :0
// Phase 1: matrix 1902 rows 1402 cols
[2024-06-01 20:17:41] [INFO ] Computed 401 invariants in 16 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 1075 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-06-01 20:17:43] [INFO ] Deduced a trap composed of 7 places in 233 ms of which 4 ms to minimize.
[2024-06-01 20:17:43] [INFO ] Deduced a trap composed of 7 places in 259 ms of which 4 ms to minimize.
[2024-06-01 20:17:43] [INFO ] Deduced a trap composed of 7 places in 226 ms of which 3 ms to minimize.
[2024-06-01 20:17:44] [INFO ] Deduced a trap composed of 7 places in 237 ms of which 3 ms to minimize.
[2024-06-01 20:17:44] [INFO ] Deduced a trap composed of 7 places in 234 ms of which 4 ms to minimize.
[2024-06-01 20:17:44] [INFO ] Deduced a trap composed of 7 places in 248 ms of which 4 ms to minimize.
[2024-06-01 20:17:44] [INFO ] Deduced a trap composed of 7 places in 245 ms of which 3 ms to minimize.
[2024-06-01 20:17:45] [INFO ] Deduced a trap composed of 11 places in 233 ms of which 3 ms to minimize.
[2024-06-01 20:17:45] [INFO ] Deduced a trap composed of 7 places in 224 ms of which 3 ms to minimize.
[2024-06-01 20:17:45] [INFO ] Deduced a trap composed of 7 places in 210 ms of which 3 ms to minimize.
[2024-06-01 20:17:45] [INFO ] Deduced a trap composed of 11 places in 202 ms of which 4 ms to minimize.
[2024-06-01 20:17:46] [INFO ] Deduced a trap composed of 7 places in 202 ms of which 3 ms to minimize.
[2024-06-01 20:17:46] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 3 ms to minimize.
[2024-06-01 20:17:46] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 3 ms to minimize.
[2024-06-01 20:17:46] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 3 ms to minimize.
[2024-06-01 20:17:46] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 3 ms to minimize.
[2024-06-01 20:17:47] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 4 ms to minimize.
[2024-06-01 20:17:47] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 3 ms to minimize.
[2024-06-01 20:17:47] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 3 ms to minimize.
[2024-06-01 20:17:47] [INFO ] Deduced a trap composed of 7 places in 167 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-06-01 20:17:47] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 3 ms to minimize.
[2024-06-01 20:17:47] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 2 ms to minimize.
[2024-06-01 20:17:48] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 2 ms to minimize.
[2024-06-01 20:17:48] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 2 ms to minimize.
[2024-06-01 20:17:48] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 2 ms to minimize.
[2024-06-01 20:17:48] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 2 ms to minimize.
[2024-06-01 20:17:48] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 1 ms to minimize.
[2024-06-01 20:17:48] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 3 ms to minimize.
[2024-06-01 20:17:48] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 1 ms to minimize.
[2024-06-01 20:17:49] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 1 ms to minimize.
[2024-06-01 20:17:49] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 1 ms to minimize.
[2024-06-01 20:17:49] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 2 ms to minimize.
[2024-06-01 20:17:49] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 7 ms to minimize.
[2024-06-01 20:17:49] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 2 ms to minimize.
[2024-06-01 20:17:49] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-06-01 20:17:49] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-06-01 20:17:49] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2024-06-01 20:17:49] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-06-01 20:17:49] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-06-01 20:17:49] [INFO ] Deduced a trap composed of 7 places in 28 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-06-01 20:17:51] [INFO ] Deduced a trap composed of 7 places in 299 ms of which 5 ms to minimize.
[2024-06-01 20:17:52] [INFO ] Deduced a trap composed of 7 places in 290 ms of which 4 ms to minimize.
[2024-06-01 20:17:52] [INFO ] Deduced a trap composed of 7 places in 251 ms of which 3 ms to minimize.
[2024-06-01 20:17:52] [INFO ] Deduced a trap composed of 12 places in 255 ms of which 4 ms to minimize.
[2024-06-01 20:17:53] [INFO ] Deduced a trap composed of 11 places in 276 ms of which 3 ms to minimize.
[2024-06-01 20:17:53] [INFO ] Deduced a trap composed of 7 places in 257 ms of which 4 ms to minimize.
[2024-06-01 20:17:53] [INFO ] Deduced a trap composed of 7 places in 236 ms of which 4 ms to minimize.
[2024-06-01 20:17:54] [INFO ] Deduced a trap composed of 7 places in 257 ms of which 4 ms to minimize.
[2024-06-01 20:17:54] [INFO ] Deduced a trap composed of 16 places in 264 ms of which 5 ms to minimize.
[2024-06-01 20:17:54] [INFO ] Deduced a trap composed of 7 places in 227 ms of which 6 ms to minimize.
[2024-06-01 20:17:55] [INFO ] Deduced a trap composed of 11 places in 224 ms of which 3 ms to minimize.
[2024-06-01 20:17:55] [INFO ] Deduced a trap composed of 12 places in 220 ms of which 3 ms to minimize.
[2024-06-01 20:17:55] [INFO ] Deduced a trap composed of 6 places in 256 ms of which 3 ms to minimize.
[2024-06-01 20:17:56] [INFO ] Deduced a trap composed of 7 places in 252 ms of which 4 ms to minimize.
[2024-06-01 20:17:56] [INFO ] Deduced a trap composed of 7 places in 230 ms of which 4 ms to minimize.
[2024-06-01 20:17:56] [INFO ] Deduced a trap composed of 7 places in 197 ms of which 3 ms to minimize.
[2024-06-01 20:17:57] [INFO ] Deduced a trap composed of 13 places in 216 ms of which 3 ms to minimize.
[2024-06-01 20:17:57] [INFO ] Deduced a trap composed of 11 places in 179 ms of which 3 ms to minimize.
[2024-06-01 20:17:57] [INFO ] Deduced a trap composed of 7 places in 198 ms of which 2 ms to minimize.
[2024-06-01 20:17:57] [INFO ] Deduced a trap composed of 12 places in 208 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-06-01 20:17:58] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 2 ms to minimize.
[2024-06-01 20:17:59] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 3 ms to minimize.
[2024-06-01 20:17:59] [INFO ] Deduced a trap composed of 12 places in 199 ms of which 3 ms to minimize.
[2024-06-01 20:17:59] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 3 ms to minimize.
[2024-06-01 20:17:59] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 2 ms to minimize.
[2024-06-01 20:18:00] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 3 ms to minimize.
[2024-06-01 20:18:00] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 2 ms to minimize.
[2024-06-01 20:18:00] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 2 ms to minimize.
[2024-06-01 20:18:00] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 1 ms to minimize.
[2024-06-01 20:18:00] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 2 ms to minimize.
[2024-06-01 20:18:01] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 2 ms to minimize.
[2024-06-01 20:18:01] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 2 ms to minimize.
[2024-06-01 20:18:01] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 1 ms to minimize.
[2024-06-01 20:18:01] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 2 ms to minimize.
[2024-06-01 20:18:02] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-06-01 20:18:02] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-06-01 20:18:02] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-06-01 20:18:02] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-06-01 20:18:02] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-06-01 20:18:02] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/3304 variables, 20/3288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:18:03] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 2 ms to minimize.
[2024-06-01 20:18:03] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 1 ms to minimize.
[2024-06-01 20:18:03] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2024-06-01 20:18:04] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-06-01 20:18:04] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2024-06-01 20:18:04] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
[2024-06-01 20:18:04] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-06-01 20:18:04] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-06-01 20:18:04] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-06-01 20:18:05] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-01 20:18:05] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-06-01 20:18:05] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 0 ms to minimize.
[2024-06-01 20:18:05] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2024-06-01 20:18:05] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-06-01 20:18:05] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 20:18:06] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-06-01 20:18:06] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-06-01 20:18:06] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2024-06-01 20:18:06] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-06-01 20:18:06] [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 25958 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 27094ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA ShieldRVs-PT-100A-ReachabilityCardinality-2024-14 FALSE TECHNIQUES PARIKH_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityCardinality-2024-04 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 5603 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 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 1402 transition count 1902
Applied a total of 9 rules in 217 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 217 ms. Remains : 1402/1402 places, 1902/1902 transitions.
RANDOM walk for 40000 steps (32 resets) in 627 ms. (63 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 305 ms. (130 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 104758 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :0 out of 1
Probabilistic random walk after 104758 steps, saw 40849 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
// Phase 1: matrix 1902 rows 1402 cols
[2024-06-01 20:18:17] [INFO ] Computed 401 invariants in 15 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 809 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-06-01 20:18:19] [INFO ] Deduced a trap composed of 7 places in 232 ms of which 4 ms to minimize.
[2024-06-01 20:18:19] [INFO ] Deduced a trap composed of 7 places in 227 ms of which 3 ms to minimize.
[2024-06-01 20:18:19] [INFO ] Deduced a trap composed of 15 places in 219 ms of which 3 ms to minimize.
[2024-06-01 20:18:19] [INFO ] Deduced a trap composed of 11 places in 205 ms of which 3 ms to minimize.
[2024-06-01 20:18:20] [INFO ] Deduced a trap composed of 11 places in 196 ms of which 3 ms to minimize.
[2024-06-01 20:18:20] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 3 ms to minimize.
[2024-06-01 20:18:20] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 3 ms to minimize.
[2024-06-01 20:18:20] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 3 ms to minimize.
[2024-06-01 20:18:20] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 2 ms to minimize.
[2024-06-01 20:18:21] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 2 ms to minimize.
[2024-06-01 20:18:21] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 2 ms to minimize.
[2024-06-01 20:18:21] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 2 ms to minimize.
[2024-06-01 20:18:21] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 2 ms to minimize.
[2024-06-01 20:18:21] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 3 ms to minimize.
[2024-06-01 20:18:21] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 2 ms to minimize.
[2024-06-01 20:18:22] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 2 ms to minimize.
[2024-06-01 20:18:22] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 2 ms to minimize.
[2024-06-01 20:18:22] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 2 ms to minimize.
[2024-06-01 20:18:22] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 2 ms to minimize.
[2024-06-01 20:18:22] [INFO ] Deduced a trap composed of 7 places in 122 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-06-01 20:18:22] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 2 ms to minimize.
[2024-06-01 20:18:22] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 2 ms to minimize.
[2024-06-01 20:18:23] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 1 ms to minimize.
[2024-06-01 20:18:23] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 1 ms to minimize.
[2024-06-01 20:18:23] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 1 ms to minimize.
[2024-06-01 20:18:23] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 2 ms to minimize.
[2024-06-01 20:18:23] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 1 ms to minimize.
[2024-06-01 20:18:23] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 2 ms to minimize.
[2024-06-01 20:18:23] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2024-06-01 20:18:23] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2024-06-01 20:18:23] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-06-01 20:18:24] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 2 ms to minimize.
[2024-06-01 20:18:24] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-06-01 20:18:24] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-06-01 20:18:24] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 0 ms to minimize.
[2024-06-01 20:18:24] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2024-06-01 20:18:24] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-01 20:18:24] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-06-01 20:18:24] [INFO ] Deduced a trap composed of 7 places in 40 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-06-01 20:18:25] [INFO ] Deduced a trap composed of 7 places in 252 ms of which 4 ms to minimize.
[2024-06-01 20:18:26] [INFO ] Deduced a trap composed of 7 places in 249 ms of which 4 ms to minimize.
[2024-06-01 20:18:26] [INFO ] Deduced a trap composed of 11 places in 244 ms of which 4 ms to minimize.
[2024-06-01 20:18:26] [INFO ] Deduced a trap composed of 7 places in 241 ms of which 3 ms to minimize.
[2024-06-01 20:18:27] [INFO ] Deduced a trap composed of 7 places in 245 ms of which 3 ms to minimize.
[2024-06-01 20:18:27] [INFO ] Deduced a trap composed of 11 places in 261 ms of which 4 ms to minimize.
[2024-06-01 20:18:27] [INFO ] Deduced a trap composed of 7 places in 243 ms of which 3 ms to minimize.
[2024-06-01 20:18:28] [INFO ] Deduced a trap composed of 7 places in 239 ms of which 3 ms to minimize.
[2024-06-01 20:18:28] [INFO ] Deduced a trap composed of 7 places in 235 ms of which 4 ms to minimize.
[2024-06-01 20:18:28] [INFO ] Deduced a trap composed of 12 places in 231 ms of which 3 ms to minimize.
[2024-06-01 20:18:29] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 4 ms to minimize.
[2024-06-01 20:18:29] [INFO ] Deduced a trap composed of 7 places in 230 ms of which 4 ms to minimize.
[2024-06-01 20:18:29] [INFO ] Deduced a trap composed of 11 places in 233 ms of which 3 ms to minimize.
[2024-06-01 20:18:30] [INFO ] Deduced a trap composed of 7 places in 237 ms of which 4 ms to minimize.
[2024-06-01 20:18:30] [INFO ] Deduced a trap composed of 7 places in 232 ms of which 4 ms to minimize.
[2024-06-01 20:18:30] [INFO ] Deduced a trap composed of 12 places in 224 ms of which 3 ms to minimize.
[2024-06-01 20:18:31] [INFO ] Deduced a trap composed of 11 places in 214 ms of which 3 ms to minimize.
[2024-06-01 20:18:31] [INFO ] Deduced a trap composed of 12 places in 230 ms of which 4 ms to minimize.
[2024-06-01 20:18:31] [INFO ] Deduced a trap composed of 12 places in 222 ms of which 4 ms to minimize.
[2024-06-01 20:18:32] [INFO ] Deduced a trap composed of 13 places in 232 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/3304 variables, 20/3265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:18:32] [INFO ] Deduced a trap composed of 11 places in 229 ms of which 3 ms to minimize.
[2024-06-01 20:18:32] [INFO ] Deduced a trap composed of 13 places in 222 ms of which 3 ms to minimize.
[2024-06-01 20:18:33] [INFO ] Deduced a trap composed of 11 places in 243 ms of which 4 ms to minimize.
[2024-06-01 20:18:33] [INFO ] Deduced a trap composed of 15 places in 230 ms of which 4 ms to minimize.
[2024-06-01 20:18:33] [INFO ] Deduced a trap composed of 11 places in 230 ms of which 3 ms to minimize.
[2024-06-01 20:18:34] [INFO ] Deduced a trap composed of 21 places in 236 ms of which 3 ms to minimize.
[2024-06-01 20:18:34] [INFO ] Deduced a trap composed of 15 places in 230 ms of which 3 ms to minimize.
[2024-06-01 20:18:34] [INFO ] Deduced a trap composed of 7 places in 240 ms of which 4 ms to minimize.
[2024-06-01 20:18:35] [INFO ] Deduced a trap composed of 8 places in 226 ms of which 4 ms to minimize.
[2024-06-01 20:18:35] [INFO ] Deduced a trap composed of 20 places in 222 ms of which 4 ms to minimize.
[2024-06-01 20:18:35] [INFO ] Deduced a trap composed of 10 places in 222 ms of which 4 ms to minimize.
[2024-06-01 20:18:35] [INFO ] Deduced a trap composed of 11 places in 220 ms of which 3 ms to minimize.
[2024-06-01 20:18:36] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 3 ms to minimize.
[2024-06-01 20:18:36] [INFO ] Deduced a trap composed of 11 places in 216 ms of which 4 ms to minimize.
[2024-06-01 20:18:36] [INFO ] Deduced a trap composed of 11 places in 207 ms of which 3 ms to minimize.
[2024-06-01 20:18:37] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 3 ms to minimize.
[2024-06-01 20:18:37] [INFO ] Deduced a trap composed of 15 places in 226 ms of which 3 ms to minimize.
[2024-06-01 20:18:37] [INFO ] Deduced a trap composed of 12 places in 206 ms of which 3 ms to minimize.
[2024-06-01 20:18:38] [INFO ] Deduced a trap composed of 8 places in 222 ms of which 3 ms to minimize.
[2024-06-01 20:18:38] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/3304 variables, 20/3285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:18:38] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 2 ms to minimize.
[2024-06-01 20:18:38] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 3 ms to minimize.
[2024-06-01 20:18:39] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 3 ms to minimize.
[2024-06-01 20:18:39] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 3 ms to minimize.
[2024-06-01 20:18:39] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 3 ms to minimize.
[2024-06-01 20:18:40] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 2 ms to minimize.
[2024-06-01 20:18:40] [INFO ] Deduced a trap composed of 20 places in 195 ms of which 3 ms to minimize.
[2024-06-01 20:18:40] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 3 ms to minimize.
[2024-06-01 20:18:40] [INFO ] Deduced a trap composed of 16 places in 181 ms of which 3 ms to minimize.
[2024-06-01 20:18:41] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 2 ms to minimize.
[2024-06-01 20:18:41] [INFO ] Deduced a trap composed of 15 places in 188 ms of which 3 ms to minimize.
[2024-06-01 20:18:41] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 2 ms to minimize.
[2024-06-01 20:18:41] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 2 ms to minimize.
[2024-06-01 20:18:42] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 2 ms to minimize.
[2024-06-01 20:18:42] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 3 ms to minimize.
[2024-06-01 20:18:42] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 2 ms to minimize.
[2024-06-01 20:18:42] [INFO ] Deduced a trap composed of 20 places in 167 ms of which 3 ms to minimize.
[2024-06-01 20:18:43] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 2 ms to minimize.
[2024-06-01 20:18:43] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 2 ms to minimize.
[2024-06-01 20:18:43] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/3304 variables, 20/3305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:18:44] [INFO ] Deduced a trap composed of 19 places in 202 ms of which 3 ms to minimize.
[2024-06-01 20:18:44] [INFO ] Deduced a trap composed of 19 places in 197 ms of which 3 ms to minimize.
[2024-06-01 20:18:44] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 3 ms to minimize.
[2024-06-01 20:18:44] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 3 ms to minimize.
[2024-06-01 20:18:45] [INFO ] Deduced a trap composed of 28 places in 170 ms of which 2 ms to minimize.
[2024-06-01 20:18:45] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 3 ms to minimize.
[2024-06-01 20:18:45] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 2 ms to minimize.
[2024-06-01 20:18:45] [INFO ] Deduced a trap composed of 29 places in 170 ms of which 3 ms to minimize.
[2024-06-01 20:18:46] [INFO ] Deduced a trap composed of 24 places in 185 ms of which 3 ms to minimize.
[2024-06-01 20:18:46] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 4 ms to minimize.
[2024-06-01 20:18:46] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 3 ms to minimize.
[2024-06-01 20:18:46] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 2 ms to minimize.
[2024-06-01 20:18:47] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 2 ms to minimize.
[2024-06-01 20:18:47] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 2 ms to minimize.
[2024-06-01 20:18:47] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 1 ms to minimize.
[2024-06-01 20:18:47] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 2 ms to minimize.
[2024-06-01 20:18:47] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2024-06-01 20:18:48] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
[2024-06-01 20:18:48] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-06-01 20:18:48] [INFO ] Deduced a trap composed of 11 places in 75 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-06-01 20:18:48] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-06-01 20:18:48] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-06-01 20:18:49] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2024-06-01 20:18:49] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-06-01 20:18:49] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-01 20:18:49] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-06-01 20:18:49] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2024-06-01 20:18:49] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-06-01 20:18:49] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-06-01 20:18:50] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-06-01 20:18:50] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-06-01 20:18:50] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-06-01 20:18:50] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2024-06-01 20:18:50] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-06-01 20:18:50] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-06-01 20:18:51] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 2 ms to minimize.
[2024-06-01 20:18:51] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2024-06-01 20:18:51] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-06-01 20:18:51] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-06-01 20:18:51] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/3304 variables, 20/3345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:18:52] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-06-01 20:18:52] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2024-06-01 20:18:52] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-06-01 20:18:52] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-06-01 20:18:52] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2024-06-01 20:18:52] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2024-06-01 20:18:53] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2024-06-01 20:18:53] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-06-01 20:18:53] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2024-06-01 20:18:53] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-06-01 20:18:53] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-06-01 20:18:53] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-06-01 20:18:53] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 1 ms to minimize.
[2024-06-01 20:18:54] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2024-06-01 20:18:54] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 0 ms to minimize.
[2024-06-01 20:18:54] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-06-01 20:18:54] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-06-01 20:18:54] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-06-01 20:18:54] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2024-06-01 20:18:55] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/3304 variables, 20/3365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:18:55] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2024-06-01 20:18:55] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 1 ms to minimize.
[2024-06-01 20:18:55] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
[2024-06-01 20:18:55] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2024-06-01 20:18:56] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2024-06-01 20:18:56] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-06-01 20:18:56] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-06-01 20:18:56] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-06-01 20:18:56] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
[2024-06-01 20:18:56] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2024-06-01 20:18:56] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
[2024-06-01 20:18:57] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2024-06-01 20:18:57] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2024-06-01 20:18:57] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-06-01 20:18:57] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 2 ms to minimize.
[2024-06-01 20:18:57] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 2 ms to minimize.
[2024-06-01 20:18:57] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-06-01 20:18:58] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-06-01 20:18:58] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-06-01 20:18:58] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/3304 variables, 20/3385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:18:58] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-06-01 20:18:58] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-06-01 20:18:58] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-06-01 20:18:59] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-06-01 20:18:59] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-06-01 20:18:59] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-06-01 20:18:59] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-06-01 20:18:59] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2024-06-01 20:18:59] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2024-06-01 20:19:00] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2024-06-01 20:19:00] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2024-06-01 20:19:00] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2024-06-01 20:19:00] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
[2024-06-01 20:19:00] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2024-06-01 20:19:00] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-06-01 20:19:01] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-06-01 20:19:01] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-06-01 20:19:01] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-06-01 20:19:01] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 1 ms to minimize.
[2024-06-01 20:19:01] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/3304 variables, 20/3405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:19:01] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2024-06-01 20:19:02] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2024-06-01 20:19:02] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
[2024-06-01 20:19:02] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2024-06-01 20:19:02] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-06-01 20:19:02] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-06-01 20:19:02] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-06-01 20:19:03] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-06-01 20:19:03] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-06-01 20:19:03] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-06-01 20:19:03] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2024-06-01 20:19:03] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2024-06-01 20:19:03] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2024-06-01 20:19:03] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 1 ms to minimize.
[2024-06-01 20:19:04] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-06-01 20:19:04] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2024-06-01 20:19:04] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 0 ms to minimize.
[2024-06-01 20:19:04] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2024-06-01 20:19:04] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
[2024-06-01 20:19:04] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/3304 variables, 20/3425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:19:05] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
[2024-06-01 20:19:05] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-06-01 20:19:05] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2024-06-01 20:19:05] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
[2024-06-01 20:19:05] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2024-06-01 20:19:06] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 1 ms to minimize.
[2024-06-01 20:19:06] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2024-06-01 20:19:06] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 1 ms to minimize.
[2024-06-01 20:19:06] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2024-06-01 20:19:06] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2024-06-01 20:19:06] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2024-06-01 20:19:06] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2024-06-01 20:19:07] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2024-06-01 20:19:07] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 1 ms to minimize.
[2024-06-01 20:19:07] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 1 ms to minimize.
[2024-06-01 20:19:07] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 1 ms to minimize.
[2024-06-01 20:19:07] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 1 ms to minimize.
[2024-06-01 20:19:07] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 1 ms to minimize.
[2024-06-01 20:19:08] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 1 ms to minimize.
[2024-06-01 20:19:08] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/3304 variables, 20/3445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:19:08] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
[2024-06-01 20:19:08] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2024-06-01 20:19:08] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2024-06-01 20:19:08] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2024-06-01 20:19:09] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2024-06-01 20:19:09] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2024-06-01 20:19:09] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2024-06-01 20:19:09] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 1 ms to minimize.
[2024-06-01 20:19:09] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 1 ms to minimize.
[2024-06-01 20:19:09] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 1 ms to minimize.
[2024-06-01 20:19:10] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
[2024-06-01 20:19:10] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 1 ms to minimize.
[2024-06-01 20:19:10] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 1 ms to minimize.
[2024-06-01 20:19:10] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 1 ms to minimize.
[2024-06-01 20:19:10] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 1 ms to minimize.
[2024-06-01 20:19:10] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 1 ms to minimize.
[2024-06-01 20:19:11] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2024-06-01 20:19:11] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 1 ms to minimize.
[2024-06-01 20:19:11] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 1 ms to minimize.
[2024-06-01 20:19:11] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/3304 variables, 20/3465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:19:11] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 1 ms to minimize.
[2024-06-01 20:19:11] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2024-06-01 20:19:12] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2024-06-01 20:19:12] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 1 ms to minimize.
[2024-06-01 20:19:12] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 1 ms to minimize.
[2024-06-01 20:19:12] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 1 ms to minimize.
[2024-06-01 20:19:12] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 1 ms to minimize.
[2024-06-01 20:19:12] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2024-06-01 20:19:13] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 1 ms to minimize.
[2024-06-01 20:19:13] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 1 ms to minimize.
[2024-06-01 20:19:13] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-06-01 20:19:13] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 1 ms to minimize.
[2024-06-01 20:19:13] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
[2024-06-01 20:19:13] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 1 ms to minimize.
[2024-06-01 20:19:13] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 0 ms to minimize.
[2024-06-01 20:19:14] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
[2024-06-01 20:19:14] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 1 ms to minimize.
[2024-06-01 20:19:14] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 1 ms to minimize.
[2024-06-01 20:19:14] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 0 ms to minimize.
[2024-06-01 20:19:14] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/3304 variables, 20/3485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:19:15] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 1 ms to minimize.
[2024-06-01 20:19:15] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
[2024-06-01 20:19:15] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2024-06-01 20:19:15] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 1 ms to minimize.
[2024-06-01 20:19:15] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 1 ms to minimize.
[2024-06-01 20:19:15] [INFO ] Deduced a trap composed of 55 places in 61 ms of which 1 ms to minimize.
[2024-06-01 20:19:16] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 1 ms to minimize.
[2024-06-01 20:19:16] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 1 ms to minimize.
[2024-06-01 20:19:16] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-01 20:19:16] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-06-01 20:19:16] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-06-01 20:19:16] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-06-01 20:19:16] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-06-01 20:19:17] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-06-01 20:19:17] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-06-01 20:19:17] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-06-01 20:19:17] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-06-01 20:19:17] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-06-01 20:19:17] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 0 ms to minimize.
[2024-06-01 20:19:18] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/3304 variables, 20/3505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:19:18] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 0 ms to minimize.
[2024-06-01 20:19:18] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-06-01 20:19:18] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-06-01 20:19:18] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
[2024-06-01 20:19:18] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 0 ms to minimize.
[2024-06-01 20:19:19] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 3 ms to minimize.
[2024-06-01 20:19:19] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-06-01 20:19:19] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-06-01 20:19:19] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-06-01 20:19:19] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2024-06-01 20:19:19] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-06-01 20:19:20] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2024-06-01 20:19:20] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2024-06-01 20:19:20] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2024-06-01 20:19:20] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2024-06-01 20:19:20] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-06-01 20:19:20] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
[2024-06-01 20:19:20] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-06-01 20:19:21] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
[2024-06-01 20:19:21] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 0 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/3304 variables, 20/3525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:19:21] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 1 ms to minimize.
[2024-06-01 20:19:21] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/3304 variables, 2/3527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3304 variables, 0/3527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/3304 variables, 0/3527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3304/3304 variables, and 3527 constraints, problems are : Problem set: 0 solved, 1 unsolved in 63648 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: 321/321 constraints]
After SMT, in 64501ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1391 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 65 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 65 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-06-01 20:19:23] [INFO ] Invariant cache hit.
[2024-06-01 20:19:24] [INFO ] Implicit Places using invariants in 872 ms returned []
[2024-06-01 20:19:24] [INFO ] Invariant cache hit.
[2024-06-01 20:19:26] [INFO ] Implicit Places using invariants and state equation in 1939 ms returned []
Implicit Place search using SMT with State Equation took 2822 ms to find 0 implicit places.
[2024-06-01 20:19:27] [INFO ] Redundant transitions in 618 ms returned []
Running 1901 sub problems to find dead transitions.
[2024-06-01 20:19:27] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30045 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
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 timeout
1)
(s472 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30036 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 61313ms problems are : Problem set: 0 solved, 1901 unsolved
Search for dead transitions found 0 dead transitions in 61348ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64886 ms. Remains : 1402/1402 places, 1902/1902 transitions.
[2024-06-01 20:20:28] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-06-01 20:20:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1402 places, 1902 transitions and 9578 arcs took 17 ms.
[2024-06-01 20:20:29] [INFO ] Flatten gal took : 292 ms
Total runtime 179917 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ShieldRVs-PT-100A-ReachabilityCardinality-2024-03

BK_STOP 1717273229376

--------------------
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
mcc2024
rfs formula name ShieldRVs-PT-100A-ReachabilityCardinality-2024-03
rfs formula type EF
rfs formula formula --invariant=/tmp/1884/inv_0_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="ltsminxred"
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 ltsminxred"
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 r528-tall-171683762000870"
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 ;