fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r528-tall-171683762000863
Last Updated
July 7, 2024

About the Execution of LTSMin+red for ShieldRVs-PT-050B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
807.659 117992.00 166415.00 329.80 FTTFTF??FTFTF?TF normal

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-171683762000863.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-050B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683762000863
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 29K 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.5K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 12 17:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 17:19 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 625K 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-050B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717271956171

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-050B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:59:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 19:59:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:59:17] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2024-06-01 19:59:17] [INFO ] Transformed 2003 places.
[2024-06-01 19:59:17] [INFO ] Transformed 2253 transitions.
[2024-06-01 19:59:17] [INFO ] Found NUPN structural information;
[2024-06-01 19:59:17] [INFO ] Parsed PT model containing 2003 places and 2253 transitions and 7200 arcs in 358 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (16 resets) in 1588 ms. (25 steps per ms) remains 5/16 properties
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 749 ms. (53 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 5/5 properties
// Phase 1: matrix 2253 rows 2003 cols
[2024-06-01 19:59:18] [INFO ] Computed 201 invariants in 36 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem ShieldRVs-PT-050B-ReachabilityFireability-2024-03 is UNSAT
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1840/1950 variables, 195/305 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1950 variables, 1840/2145 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1950 variables, 0/2145 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 53/2003 variables, 6/2151 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2003 variables, 53/2204 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2003 variables, 0/2204 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2253/4256 variables, 2003/4207 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4256 variables, 0/4207 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/4256 variables, 0/4207 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4256/4256 variables, and 4207 constraints, problems are : Problem set: 1 solved, 4 unsolved in 2068 ms.
Refiners :[Domain max(s): 2003/2003 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 2003/2003 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 93/93 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/93 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1845/1938 variables, 194/287 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1938 variables, 1845/2132 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-06-01 19:59:22] [INFO ] Deduced a trap composed of 34 places in 753 ms of which 78 ms to minimize.
[2024-06-01 19:59:22] [INFO ] Deduced a trap composed of 27 places in 687 ms of which 9 ms to minimize.
[2024-06-01 19:59:23] [INFO ] Deduced a trap composed of 17 places in 619 ms of which 9 ms to minimize.
[2024-06-01 19:59:24] [INFO ] Deduced a trap composed of 26 places in 525 ms of which 8 ms to minimize.
[2024-06-01 19:59:24] [INFO ] Deduced a trap composed of 46 places in 584 ms of which 9 ms to minimize.
[2024-06-01 19:59:25] [INFO ] Deduced a trap composed of 28 places in 548 ms of which 9 ms to minimize.
[2024-06-01 19:59:26] [INFO ] Deduced a trap composed of 34 places in 561 ms of which 9 ms to minimize.
SMT process timed out in 7226ms, After SMT, problems are : Problem set: 1 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 93 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2253/2253 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 179 transitions
Trivial Post-agglo rules discarded 179 transitions
Performed 179 trivial Post agglomeration. Transition count delta: 179
Iterating post reduction 0 with 179 rules applied. Total rules applied 179 place count 2003 transition count 2074
Reduce places removed 179 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 185 rules applied. Total rules applied 364 place count 1824 transition count 2068
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 370 place count 1818 transition count 2068
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 248 Pre rules applied. Total rules applied 370 place count 1818 transition count 1820
Deduced a syphon composed of 248 places in 4 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 3 with 496 rules applied. Total rules applied 866 place count 1570 transition count 1820
Discarding 327 places :
Symmetric choice reduction at 3 with 327 rule applications. Total rules 1193 place count 1243 transition count 1493
Iterating global reduction 3 with 327 rules applied. Total rules applied 1520 place count 1243 transition count 1493
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 121 Pre rules applied. Total rules applied 1520 place count 1243 transition count 1372
Deduced a syphon composed of 121 places in 7 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 242 rules applied. Total rules applied 1762 place count 1122 transition count 1372
Performed 332 Post agglomeration using F-continuation condition.Transition count delta: 332
Deduced a syphon composed of 332 places in 4 ms
Reduce places removed 332 places and 0 transitions.
Iterating global reduction 3 with 664 rules applied. Total rules applied 2426 place count 790 transition count 1040
Partial Free-agglomeration rule applied 92 times.
Drop transitions (Partial Free agglomeration) removed 92 transitions
Iterating global reduction 3 with 92 rules applied. Total rules applied 2518 place count 790 transition count 1040
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2519 place count 789 transition count 1039
Applied a total of 2519 rules in 689 ms. Remains 789 /2003 variables (removed 1214) and now considering 1039/2253 (removed 1214) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 699 ms. Remains : 789/2003 places, 1039/2253 transitions.
RANDOM walk for 40000 steps (54 resets) in 868 ms. (46 steps per ms) remains 3/4 properties
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 294 ms. (135 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 241 ms. (165 steps per ms) remains 3/3 properties
// Phase 1: matrix 1039 rows 789 cols
[2024-06-01 19:59:27] [INFO ] Computed 201 invariants in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 674/766 variables, 194/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 14/780 variables, 4/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/780 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1031/1811 variables, 780/978 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1811 variables, 0/978 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 17/1828 variables, 9/987 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1828 variables, 3/990 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1828 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1828 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1828/1828 variables, and 990 constraints, problems are : Problem set: 0 solved, 3 unsolved in 768 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 789/789 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/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 674/766 variables, 194/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:59:28] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 3 ms to minimize.
[2024-06-01 19:59:28] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 3 ms to minimize.
[2024-06-01 19:59:28] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 2 ms to minimize.
[2024-06-01 19:59:28] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 3 ms to minimize.
[2024-06-01 19:59:29] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 2 ms to minimize.
[2024-06-01 19:59:29] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 3 ms to minimize.
[2024-06-01 19:59:29] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 2 ms to minimize.
[2024-06-01 19:59:29] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 3 ms to minimize.
[2024-06-01 19:59:29] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 2 ms to minimize.
[2024-06-01 19:59:29] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 3 ms to minimize.
[2024-06-01 19:59:29] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:59:30] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 3 ms to minimize.
[2024-06-01 19:59:30] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 5 ms to minimize.
[2024-06-01 19:59:30] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 3 ms to minimize.
[2024-06-01 19:59:30] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:59:30] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 2 ms to minimize.
[2024-06-01 19:59:30] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
[2024-06-01 19:59:30] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:59:31] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 1 ms to minimize.
[2024-06-01 19:59:31] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:59:31] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 2 ms to minimize.
[2024-06-01 19:59:31] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:59:31] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 3 ms to minimize.
[2024-06-01 19:59:31] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:59:32] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 3 ms to minimize.
[2024-06-01 19:59:32] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 2 ms to minimize.
[2024-06-01 19:59:32] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 4 ms to minimize.
[2024-06-01 19:59:32] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:59:32] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:59:32] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:59:32] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:59:32] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:59:33] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 3 ms to minimize.
[2024-06-01 19:59:33] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 2 ms to minimize.
[2024-06-01 19:59:33] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 2 ms to minimize.
[2024-06-01 19:59:33] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2024-06-01 19:59:33] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 2 ms to minimize.
[2024-06-01 19:59:33] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 2 ms to minimize.
[2024-06-01 19:59:33] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 1 ms to minimize.
[2024-06-01 19:59:33] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/766 variables, 20/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:59:33] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
[2024-06-01 19:59:34] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 2 ms to minimize.
[2024-06-01 19:59:34] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 2 ms to minimize.
[2024-06-01 19:59:34] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 2 ms to minimize.
[2024-06-01 19:59:34] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 2 ms to minimize.
[2024-06-01 19:59:34] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 2 ms to minimize.
[2024-06-01 19:59:34] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 2 ms to minimize.
[2024-06-01 19:59:34] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-06-01 19:59:34] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 4 ms to minimize.
[2024-06-01 19:59:35] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 1 ms to minimize.
[2024-06-01 19:59:35] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 2 ms to minimize.
[2024-06-01 19:59:35] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2024-06-01 19:59:35] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 2 ms to minimize.
[2024-06-01 19:59:35] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-06-01 19:59:35] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-06-01 19:59:35] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2024-06-01 19:59:35] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-06-01 19:59:35] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
[2024-06-01 19:59:35] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2024-06-01 19:59:35] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/766 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:59:36] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 2 ms to minimize.
[2024-06-01 19:59:36] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 2 ms to minimize.
[2024-06-01 19:59:36] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 2 ms to minimize.
[2024-06-01 19:59:36] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-06-01 19:59:36] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 2 ms to minimize.
[2024-06-01 19:59:36] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 2 ms to minimize.
[2024-06-01 19:59:36] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 ms to minimize.
[2024-06-01 19:59:36] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
[2024-06-01 19:59:36] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:59:36] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:59:37] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:59:37] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:59:37] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:59:37] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2024-06-01 19:59:37] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:59:37] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/766 variables, 16/270 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:59:37] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-06-01 19:59:37] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 2 ms to minimize.
[2024-06-01 19:59:37] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:59:37] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:59:37] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:59:38] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:59:38] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:59:38] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:59:38] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 2 ms to minimize.
[2024-06-01 19:59:38] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:59:38] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:59:38] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:59:38] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:59:38] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:59:38] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:59:38] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:59:39] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/766 variables, 17/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:59:39] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:59:39] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/766 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:59:39] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:59:39] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/766 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:59:39] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-06-01 19:59:39] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/766 variables, 2/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:59:39] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/766 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/766 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 14/780 variables, 4/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/780 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1031/1811 variables, 780/1078 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1811 variables, 2/1080 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:59:40] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:59:40] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:59:40] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:59:40] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 4 ms to minimize.
[2024-06-01 19:59:40] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:59:41] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:59:41] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 2 ms to minimize.
[2024-06-01 19:59:41] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:59:41] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:59:41] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:59:41] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:59:41] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 0 ms to minimize.
[2024-06-01 19:59:41] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 2 ms to minimize.
[2024-06-01 19:59:41] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:59:42] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
[2024-06-01 19:59:42] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 2 ms to minimize.
[2024-06-01 19:59:42] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:59:42] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1811 variables, 18/1098 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:59:42] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:59:42] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:59:42] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:59:42] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1811 variables, 4/1102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:59:43] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:59:43] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:59:43] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1811 variables, 3/1105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:59:43] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1811 variables, 1/1106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1811 variables, 0/1106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 17/1828 variables, 9/1115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1828 variables, 3/1118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1828 variables, 1/1119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:59:44] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 2 ms to minimize.
[2024-06-01 19:59:44] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-06-01 19:59:44] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:59:44] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:59:44] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:59:45] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:59:45] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:59:45] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:59:45] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 2 ms to minimize.
[2024-06-01 19:59:45] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1828 variables, 10/1129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1828 variables, 0/1129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 0/1828 variables, 0/1129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1828/1828 variables, and 1129 constraints, problems are : Problem set: 0 solved, 3 unsolved in 18306 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 789/789 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 136/136 constraints]
After SMT, in 19123ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1571 ms.
Support contains 92 out of 789 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 789/789 places, 1039/1039 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 788 transition count 1038
Applied a total of 2 rules in 86 ms. Remains 788 /789 variables (removed 1) and now considering 1038/1039 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 788/789 places, 1038/1039 transitions.
RANDOM walk for 40000 steps (55 resets) in 365 ms. (109 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 178 ms. (223 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 187253 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 3
Probabilistic random walk after 187253 steps, saw 47107 distinct states, run finished after 3005 ms. (steps per millisecond=62 ) properties seen :0
// Phase 1: matrix 1038 rows 788 cols
[2024-06-01 19:59:51] [INFO ] Computed 201 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 673/765 variables, 194/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 14/779 variables, 4/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/779 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1030/1809 variables, 779/977 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1809 variables, 0/977 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 17/1826 variables, 9/986 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1826 variables, 3/989 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1826 variables, 0/989 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1826 variables, 0/989 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1826/1826 variables, and 989 constraints, problems are : Problem set: 0 solved, 3 unsolved in 697 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 788/788 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/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 673/765 variables, 194/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:59:52] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 2 ms to minimize.
[2024-06-01 19:59:52] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 2 ms to minimize.
[2024-06-01 19:59:52] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 3 ms to minimize.
[2024-06-01 19:59:52] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 2 ms to minimize.
[2024-06-01 19:59:53] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 3 ms to minimize.
[2024-06-01 19:59:53] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:59:53] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 2 ms to minimize.
[2024-06-01 19:59:53] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 2 ms to minimize.
[2024-06-01 19:59:53] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 2 ms to minimize.
[2024-06-01 19:59:53] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:59:53] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 2 ms to minimize.
[2024-06-01 19:59:53] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 2 ms to minimize.
[2024-06-01 19:59:54] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 2 ms to minimize.
[2024-06-01 19:59:54] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 2 ms to minimize.
[2024-06-01 19:59:54] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 2 ms to minimize.
[2024-06-01 19:59:54] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 2 ms to minimize.
[2024-06-01 19:59:54] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 1 ms to minimize.
[2024-06-01 19:59:54] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-06-01 19:59:54] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 2 ms to minimize.
[2024-06-01 19:59:54] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:59:55] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:59:55] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 2 ms to minimize.
[2024-06-01 19:59:55] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:59:55] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:59:55] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 2 ms to minimize.
[2024-06-01 19:59:55] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
[2024-06-01 19:59:55] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-06-01 19:59:55] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 2 ms to minimize.
[2024-06-01 19:59:55] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 2 ms to minimize.
[2024-06-01 19:59:56] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2024-06-01 19:59:56] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 1 ms to minimize.
[2024-06-01 19:59:56] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 2 ms to minimize.
[2024-06-01 19:59:56] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2024-06-01 19:59:56] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2024-06-01 19:59:56] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2024-06-01 19:59:56] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2024-06-01 19:59:56] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 2 ms to minimize.
[2024-06-01 19:59:56] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 2 ms to minimize.
[2024-06-01 19:59:56] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:59:57] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:59:57] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:59:57] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 2 ms to minimize.
[2024-06-01 19:59:57] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 2 ms to minimize.
[2024-06-01 19:59:57] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:59:57] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:59:57] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 2 ms to minimize.
[2024-06-01 19:59:57] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 2 ms to minimize.
[2024-06-01 19:59:58] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 1 ms to minimize.
[2024-06-01 19:59:58] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 2 ms to minimize.
[2024-06-01 19:59:58] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-06-01 19:59:58] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 1 ms to minimize.
[2024-06-01 19:59:58] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 2 ms to minimize.
[2024-06-01 19:59:58] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 2 ms to minimize.
[2024-06-01 19:59:58] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2024-06-01 19:59:58] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
[2024-06-01 19:59:58] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 2 ms to minimize.
[2024-06-01 19:59:59] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-06-01 19:59:59] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
[2024-06-01 19:59:59] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 1 ms to minimize.
[2024-06-01 19:59:59] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:59:59] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 1 ms to minimize.
[2024-06-01 19:59:59] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 1 ms to minimize.
[2024-06-01 19:59:59] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 2 ms to minimize.
[2024-06-01 19:59:59] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:59:59] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-06-01 20:00:00] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 1 ms to minimize.
[2024-06-01 20:00:00] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-06-01 20:00:00] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
[2024-06-01 20:00:00] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-06-01 20:00:00] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 2 ms to minimize.
[2024-06-01 20:00:00] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/765 variables, 11/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:00:00] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 2 ms to minimize.
[2024-06-01 20:00:00] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 2 ms to minimize.
[2024-06-01 20:00:00] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 2 ms to minimize.
[2024-06-01 20:00:01] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 1 ms to minimize.
[2024-06-01 20:00:01] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-06-01 20:00:01] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/765 variables, 6/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:00:01] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/765 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/765 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 14/779 variables, 4/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:00:01] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 1 ms to minimize.
[2024-06-01 20:00:01] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 2 ms to minimize.
[2024-06-01 20:00:01] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2024-06-01 20:00:01] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 2 ms to minimize.
[2024-06-01 20:00:01] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 2 ms to minimize.
[2024-06-01 20:00:02] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2024-06-01 20:00:02] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 2 ms to minimize.
[2024-06-01 20:00:02] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 2 ms to minimize.
[2024-06-01 20:00:02] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/779 variables, 9/285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/779 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1030/1809 variables, 779/1064 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1809 variables, 2/1066 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:00:03] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 2 ms to minimize.
[2024-06-01 20:00:03] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 3 ms to minimize.
[2024-06-01 20:00:03] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 2 ms to minimize.
[2024-06-01 20:00:03] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2024-06-01 20:00:03] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 2 ms to minimize.
[2024-06-01 20:00:03] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-06-01 20:00:03] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-06-01 20:00:04] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 2 ms to minimize.
[2024-06-01 20:00:04] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 1 ms to minimize.
[2024-06-01 20:00:04] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2024-06-01 20:00:04] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-06-01 20:00:04] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 2 ms to minimize.
[2024-06-01 20:00:04] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 2 ms to minimize.
[2024-06-01 20:00:04] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 2 ms to minimize.
[2024-06-01 20:00:05] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 2 ms to minimize.
[2024-06-01 20:00:05] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 1 ms to minimize.
[2024-06-01 20:00:05] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 2 ms to minimize.
[2024-06-01 20:00:05] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 1 ms to minimize.
[2024-06-01 20:00:05] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 3 ms to minimize.
[2024-06-01 20:00:05] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1809 variables, 20/1086 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:00:05] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-06-01 20:00:06] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-06-01 20:00:06] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1809 variables, 3/1089 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:00:06] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-06-01 20:00:06] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2024-06-01 20:00:06] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2024-06-01 20:00:06] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1809 variables, 4/1093 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1809 variables, 0/1093 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 17/1826 variables, 9/1102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1826 variables, 3/1105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1826 variables, 1/1106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:00:07] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2024-06-01 20:00:07] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2024-06-01 20:00:07] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
[2024-06-01 20:00:08] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 2 ms to minimize.
[2024-06-01 20:00:08] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1826 variables, 5/1111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:00:08] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 1 ms to minimize.
[2024-06-01 20:00:08] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2024-06-01 20:00:08] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1826 variables, 3/1114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1826 variables, 0/1114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 0/1826 variables, 0/1114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1826/1826 variables, and 1114 constraints, problems are : Problem set: 0 solved, 3 unsolved in 17478 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 788/788 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 122/122 constraints]
After SMT, in 18209ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2052 ms.
Support contains 92 out of 788 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 788/788 places, 1038/1038 transitions.
Applied a total of 0 rules in 35 ms. Remains 788 /788 variables (removed 0) and now considering 1038/1038 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 788/788 places, 1038/1038 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 788/788 places, 1038/1038 transitions.
Applied a total of 0 rules in 25 ms. Remains 788 /788 variables (removed 0) and now considering 1038/1038 (removed 0) transitions.
[2024-06-01 20:00:11] [INFO ] Invariant cache hit.
[2024-06-01 20:00:12] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-06-01 20:00:12] [INFO ] Invariant cache hit.
[2024-06-01 20:00:12] [INFO ] Implicit Places using invariants and state equation in 799 ms returned []
Implicit Place search using SMT with State Equation took 1139 ms to find 0 implicit places.
[2024-06-01 20:00:12] [INFO ] Redundant transitions in 139 ms returned []
Running 1036 sub problems to find dead transitions.
[2024-06-01 20:00:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/787 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
[2024-06-01 20:00:27] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-06-01 20:00:27] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
[2024-06-01 20:00:35] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-06-01 20:00:36] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/787 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 787/1826 variables, and 8 constraints, problems are : Problem set: 0 solved, 1036 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/201 constraints, State Equation: 0/788 constraints, PredecessorRefiner: 1036/1036 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1036 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/787 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/787 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/787 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 3 (OVERLAPS) 1/788 variables, 197/205 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
[2024-06-01 20:00:56] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 2 ms to minimize.
[2024-06-01 20:00:56] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-01 20:00:56] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-06-01 20:00:56] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-06-01 20:00:56] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2024-06-01 20:00:56] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-01 20:00:56] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 2 ms to minimize.
[2024-06-01 20:00:56] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 1 ms to minimize.
[2024-06-01 20:00:56] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-06-01 20:00:56] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 20:00:56] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-06-01 20:00:56] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
[2024-06-01 20:00:57] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
[2024-06-01 20:00:57] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 2 ms to minimize.
[2024-06-01 20:00:57] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 2 ms to minimize.
[2024-06-01 20:00:57] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 2 ms to minimize.
[2024-06-01 20:00:57] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-06-01 20:00:57] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 20:00:57] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-06-01 20:00:57] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/788 variables, 20/225 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
[2024-06-01 20:00:57] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 20:00:58] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 20:00:58] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 2 ms to minimize.
[2024-06-01 20:00:58] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-06-01 20:00:58] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
[2024-06-01 20:00:58] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 1 ms to minimize.
[2024-06-01 20:00:58] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-06-01 20:00:58] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 2 ms to minimize.
[2024-06-01 20:00:58] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-06-01 20:00:59] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:00:59] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 20:00:59] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 1 ms to minimize.
[2024-06-01 20:00:59] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 1 ms to minimize.
[2024-06-01 20:00:59] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-06-01 20:00:59] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2024-06-01 20:00:59] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-06-01 20:00:59] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-06-01 20:00:59] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-06-01 20:00:59] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2024-06-01 20:00:59] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/788 variables, 20/245 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
[2024-06-01 20:01:00] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-06-01 20:01:00] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 20:01:00] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 20:01:00] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-01 20:01:00] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-06-01 20:01:00] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 1 ms to minimize.
[2024-06-01 20:01:01] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 2 ms to minimize.
[2024-06-01 20:01:01] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 2 ms to minimize.
[2024-06-01 20:01:01] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 20:01:01] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 1 ms to minimize.
[2024-06-01 20:01:01] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 2 ms to minimize.
[2024-06-01 20:01:01] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-06-01 20:01:01] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-06-01 20:01:01] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 2 ms to minimize.
[2024-06-01 20:01:01] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-06-01 20:01:02] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-06-01 20:01:02] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-06-01 20:01:02] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 2 ms to minimize.
[2024-06-01 20:01:02] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-06-01 20:01:02] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/788 variables, 20/265 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
[2024-06-01 20:01:02] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-06-01 20:01:03] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 2 ms to minimize.
[2024-06-01 20:01:03] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 2 ms to minimize.
[2024-06-01 20:01:03] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 2 ms to minimize.
[2024-06-01 20:01:03] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-06-01 20:01:03] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-06-01 20:01:04] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-06-01 20:01:04] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 2 ms to minimize.
[2024-06-01 20:01:04] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 2 ms to minimize.
[2024-06-01 20:01:04] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-06-01 20:01:04] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 2 ms to minimize.
[2024-06-01 20:01:04] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-06-01 20:01:04] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2024-06-01 20:01:05] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 2 ms to minimize.
[2024-06-01 20:01:05] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 2 ms to minimize.
[2024-06-01 20:01:05] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2024-06-01 20:01:05] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2024-06-01 20:01:05] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 2 ms to minimize.
[2024-06-01 20:01:05] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 2 ms to minimize.
[2024-06-01 20:01:06] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/788 variables, 20/285 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
[2024-06-01 20:01:06] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-06-01 20:01:06] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
[2024-06-01 20:01:06] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-06-01 20:01:07] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-06-01 20:01:07] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-01 20:01:07] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-06-01 20:01:07] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-06-01 20:01:07] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-06-01 20:01:07] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 2 ms to minimize.
[2024-06-01 20:01:07] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-06-01 20:01:08] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-06-01 20:01:08] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 2 ms to minimize.
[2024-06-01 20:01:08] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2024-06-01 20:01:08] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 2 ms to minimize.
[2024-06-01 20:01:08] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-06-01 20:01:08] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2024-06-01 20:01:08] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 2 ms to minimize.
[2024-06-01 20:01:08] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 20:01:09] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 2 ms to minimize.
[2024-06-01 20:01:09] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/788 variables, 20/305 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
[2024-06-01 20:01:10] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
[2024-06-01 20:01:10] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 1 ms to minimize.
[2024-06-01 20:01:10] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 2 ms to minimize.
[2024-06-01 20:01:10] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 2 ms to minimize.
[2024-06-01 20:01:11] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 2 ms to minimize.
[2024-06-01 20:01:11] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 2 ms to minimize.
[2024-06-01 20:01:11] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2024-06-01 20:01:11] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2024-06-01 20:01:11] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 2 ms to minimize.
[2024-06-01 20:01:11] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 2 ms to minimize.
[2024-06-01 20:01:12] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 3 ms to minimize.
[2024-06-01 20:01:12] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 3 ms to minimize.
[2024-06-01 20:01:12] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 2 ms to minimize.
[2024-06-01 20:01:12] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2024-06-01 20:01:12] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 2 ms to minimize.
[2024-06-01 20:01:12] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-06-01 20:01:12] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-06-01 20:01:12] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 2 ms to minimize.
[2024-06-01 20:01:13] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 2 ms to minimize.
[2024-06-01 20:01:13] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/788 variables, 20/325 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 788/1826 variables, and 325 constraints, problems are : Problem set: 0 solved, 1036 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 0/788 constraints, PredecessorRefiner: 0/1036 constraints, Known Traps: 124/124 constraints]
After SMT, in 60515ms problems are : Problem set: 0 solved, 1036 unsolved
Search for dead transitions found 0 dead transitions in 60542ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61859 ms. Remains : 788/788 places, 1038/1038 transitions.
[2024-06-01 20:01:13] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-06-01 20:01:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 788 places, 1038 transitions and 4948 arcs took 10 ms.
[2024-06-01 20:01:13] [INFO ] Flatten gal took : 143 ms
Total runtime 116608 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-050B-ReachabilityFireability-2024-06
Could not compute solution for formula : ShieldRVs-PT-050B-ReachabilityFireability-2024-07
Could not compute solution for formula : ShieldRVs-PT-050B-ReachabilityFireability-2024-13

BK_STOP 1717272074163

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name ShieldRVs-PT-050B-ReachabilityFireability-2024-06
rfs formula type EF
rfs formula formula --invariant=/tmp/1708/inv_0_
rfs formula name ShieldRVs-PT-050B-ReachabilityFireability-2024-07
rfs formula type AG
rfs formula formula --invariant=/tmp/1708/inv_1_
rfs formula name ShieldRVs-PT-050B-ReachabilityFireability-2024-13
rfs formula type EF
rfs formula formula --invariant=/tmp/1708/inv_2_
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-050B"
export BK_EXAMINATION="ReachabilityFireability"
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-050B, examination is ReachabilityFireability"
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-171683762000863"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-050B.tgz
mv ShieldRVs-PT-050B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;