Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r356-tall-171683760500159.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is ShieldIIPs-PT-050B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760500159
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 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 846K 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 ShieldIIPs-PT-050B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-2023-04
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-2023-05
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716917504251

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-050B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-28 17:31:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 17:31:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 17:31:45] [INFO ] Load time of PNML (sax parser for PT used): 194 ms
[2024-05-28 17:31:45] [INFO ] Transformed 3003 places.
[2024-05-28 17:31:45] [INFO ] Transformed 2953 transitions.
[2024-05-28 17:31:45] [INFO ] Found NUPN structural information;
[2024-05-28 17:31:45] [INFO ] Parsed PT model containing 3003 places and 2953 transitions and 8906 arcs in 417 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 2186 ms. (18 steps per ms) remains 10/16 properties
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-28 17:31:46] [INFO ] Flatten gal took : 302 ms
BEST_FIRST walk for 40003 steps (8 resets) in 512 ms. (77 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 10/10 properties
[2024-05-28 17:31:46] [INFO ] Flatten gal took : 273 ms
BEST_FIRST walk for 40003 steps (8 resets) in 283 ms. (140 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 359 ms. (111 steps per ms) remains 10/10 properties
[2024-05-28 17:31:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8522637855332393690.gal : 126 ms
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 10/10 properties
[2024-05-28 17:31:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9628438497970689495.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8522637855332393690.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9628438497970689495.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 10/10 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40004 steps (8 resets) in 947 ms. (42 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 660 ms. (60 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 10/10 properties
// Phase 1: matrix 2953 rows 3003 cols
Loading property file /tmp/ReachabilityCardinality9628438497970689495.prop.
[2024-05-28 17:31:47] [INFO ] Computed 451 invariants in 38 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 219/219 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/219 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 1666/1885 variables, 242/461 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1885 variables, 1666/2127 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1885 variables, 0/2127 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1118/3003 variables, 209/2336 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3003 variables, 1118/3454 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3003 variables, 0/3454 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 2953/5956 variables, 3003/6457 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5956 variables, 0/6457 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/5956 variables, 0/6457 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5956/5956 variables, and 6457 constraints, problems are : Problem set: 0 solved, 10 unsolved in 4496 ms.
Refiners :[Domain max(s): 3003/3003 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 3003/3003 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 219/219 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/219 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :5 after 10
At refinement iteration 2 (OVERLAPS) 1666/1885 variables, 242/461 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :36 after 73
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :73 after 432
At refinement iteration 3 (INCLUDED_ONLY) 0/1885 variables, 1666/2127 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :432 after 616
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :616 after 1.18742e+08
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :1.18742e+08 after 5.73678e+13
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :5.73678e+13 after 5.07018e+29
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :5.07018e+29 after 3.24054e+60
[2024-05-28 17:31:53] [INFO ] Deduced a trap composed of 30 places in 323 ms of which 37 ms to minimize.
[2024-05-28 17:31:53] [INFO ] Deduced a trap composed of 21 places in 265 ms of which 8 ms to minimize.
[2024-05-28 17:31:53] [INFO ] Deduced a trap composed of 32 places in 210 ms of which 4 ms to minimize.
[2024-05-28 17:31:54] [INFO ] Deduced a trap composed of 42 places in 193 ms of which 4 ms to minimize.
[2024-05-28 17:31:54] [INFO ] Deduced a trap composed of 28 places in 171 ms of which 3 ms to minimize.
[2024-05-28 17:31:54] [INFO ] Deduced a trap composed of 36 places in 173 ms of which 4 ms to minimize.
[2024-05-28 17:31:54] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 4 ms to minimize.
[2024-05-28 17:31:54] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 4 ms to minimize.
[2024-05-28 17:31:55] [INFO ] Deduced a trap composed of 33 places in 177 ms of which 3 ms to minimize.
[2024-05-28 17:31:55] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 3 ms to minimize.
[2024-05-28 17:31:55] [INFO ] Deduced a trap composed of 48 places in 177 ms of which 3 ms to minimize.
[2024-05-28 17:31:55] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 3 ms to minimize.
[2024-05-28 17:31:55] [INFO ] Deduced a trap composed of 42 places in 130 ms of which 3 ms to minimize.
[2024-05-28 17:31:55] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 2 ms to minimize.
[2024-05-28 17:31:56] [INFO ] Deduced a trap composed of 48 places in 132 ms of which 2 ms to minimize.
[2024-05-28 17:31:56] [INFO ] Deduced a trap composed of 43 places in 135 ms of which 2 ms to minimize.
[2024-05-28 17:31:56] [INFO ] Deduced a trap composed of 50 places in 139 ms of which 2 ms to minimize.
[2024-05-28 17:31:56] [INFO ] Deduced a trap composed of 57 places in 118 ms of which 2 ms to minimize.
[2024-05-28 17:31:56] [INFO ] Deduced a trap composed of 63 places in 122 ms of which 3 ms to minimize.
[2024-05-28 17:31:56] [INFO ] Deduced a trap composed of 57 places in 116 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1885 variables, 20/2147 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-28 17:31:57] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 3 ms to minimize.
[2024-05-28 17:31:57] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 3 ms to minimize.
[2024-05-28 17:31:57] [INFO ] Deduced a trap composed of 35 places in 146 ms of which 3 ms to minimize.
SMT process timed out in 9747ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 219 out of 3003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3003/3003 places, 2953/2953 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 0 with 202 rules applied. Total rules applied 202 place count 3003 transition count 2751
Reduce places removed 202 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 216 rules applied. Total rules applied 418 place count 2801 transition count 2737
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 432 place count 2787 transition count 2737
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 237 Pre rules applied. Total rules applied 432 place count 2787 transition count 2500
Deduced a syphon composed of 237 places in 10 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 3 with 474 rules applied. Total rules applied 906 place count 2550 transition count 2500
Discarding 298 places :
Symmetric choice reduction at 3 with 298 rule applications. Total rules 1204 place count 2252 transition count 2202
Iterating global reduction 3 with 298 rules applied. Total rules applied 1502 place count 2252 transition count 2202
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 92 Pre rules applied. Total rules applied 1502 place count 2252 transition count 2110
Deduced a syphon composed of 92 places in 6 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 184 rules applied. Total rules applied 1686 place count 2160 transition count 2110
Performed 697 Post agglomeration using F-continuation condition.Transition count delta: 697
Deduced a syphon composed of 697 places in 6 ms
Reduce places removed 697 places and 0 transitions.
Iterating global reduction 3 with 1394 rules applied. Total rules applied 3080 place count 1463 transition count 1413
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 294 times.
Drop transitions (Partial Free agglomeration) removed 294 transitions
Iterating global reduction 3 with 294 rules applied. Total rules applied 3374 place count 1463 transition count 1413
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3375 place count 1462 transition count 1412
Applied a total of 3375 rules in 1220 ms. Remains 1462 /3003 variables (removed 1541) and now considering 1412/2953 (removed 1541) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1234 ms. Remains : 1462/3003 places, 1412/2953 transitions.
RANDOM walk for 40000 steps (8 resets) in 1133 ms. (35 steps per ms) remains 7/10 properties
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 449 ms. (88 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 389 ms. (102 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 417 ms. (95 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 278 ms. (143 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 307 ms. (129 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 344 ms. (115 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 339 ms. (117 steps per ms) remains 7/7 properties
// Phase 1: matrix 1412 rows 1462 cols
[2024-05-28 17:31:59] [INFO ] Computed 451 invariants in 45 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 655/860 variables, 224/224 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/860 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 421/1281 variables, 157/381 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1281 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 24/1305 variables, 12/393 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1305 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1324/2629 variables, 1305/1698 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2629 variables, 0/1698 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 148/2777 variables, 91/1789 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2777 variables, 29/1818 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2777 variables, 0/1818 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 6/2783 variables, 5/1823 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2783 variables, 4/1827 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2783 variables, 0/1827 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 6/2789 variables, 3/1830 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2789 variables, 4/1834 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2789 variables, 0/1834 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 2/2791 variables, 1/1835 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2791 variables, 2/1837 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2791 variables, 0/1837 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 56/2847 variables, 36/1873 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2847 variables, 10/1883 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2847 variables, 1/1884 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2847 variables, 0/1884 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (OVERLAPS) 1/2848 variables, 1/1885 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2848 variables, 1/1886 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2848 variables, 0/1886 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (OVERLAPS) 20/2868 variables, 14/1900 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2868 variables, 4/1904 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2868 variables, 0/1904 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (OVERLAPS) 1/2869 variables, 2/1906 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2869 variables, 1/1907 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2869 variables, 0/1907 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 34 (OVERLAPS) 5/2874 variables, 4/1911 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2874 variables, 2/1913 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2874 variables, 0/1913 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 37 (OVERLAPS) 0/2874 variables, 0/1913 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2874/2874 variables, and 1913 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4865 ms.
Refiners :[Positive P Invariants (semi-flows): 437/437 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 1462/1462 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 655/860 variables, 224/224 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:32:05] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:32:05] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 2 ms to minimize.
[2024-05-28 17:32:05] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2024-05-28 17:32:05] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 2 ms to minimize.
[2024-05-28 17:32:05] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 2 ms to minimize.
[2024-05-28 17:32:05] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 1 ms to minimize.
[2024-05-28 17:32:05] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-28 17:32:05] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 2 ms to minimize.
[2024-05-28 17:32:05] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-05-28 17:32:06] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 1 ms to minimize.
[2024-05-28 17:32:06] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 5 ms to minimize.
[2024-05-28 17:32:06] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 2 ms to minimize.
[2024-05-28 17:32:06] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 2 ms to minimize.
[2024-05-28 17:32:06] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 2 ms to minimize.
[2024-05-28 17:32:06] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-05-28 17:32:06] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2024-05-28 17:32:06] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 2 ms to minimize.
[2024-05-28 17:32:06] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 2 ms to minimize.
[2024-05-28 17:32:06] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-28 17:32:06] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/860 variables, 20/244 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:32:06] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-28 17:32:06] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 2 ms to minimize.
[2024-05-28 17:32:07] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-28 17:32:07] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-28 17:32:07] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-05-28 17:32:07] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 1 ms to minimize.
[2024-05-28 17:32:07] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-28 17:32:07] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 2 ms to minimize.
[2024-05-28 17:32:07] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-28 17:32:07] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-28 17:32:07] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-28 17:32:07] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/860 variables, 12/256 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:32:08] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 8 ms to minimize.
[2024-05-28 17:32:08] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 2 ms to minimize.
[2024-05-28 17:32:08] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/860 variables, 3/259 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/860 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 421/1281 variables, 157/416 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:32:08] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 3 ms to minimize.
[2024-05-28 17:32:08] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 2 ms to minimize.
[2024-05-28 17:32:08] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 3 ms to minimize.
[2024-05-28 17:32:09] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 2 ms to minimize.
[2024-05-28 17:32:09] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 2 ms to minimize.
[2024-05-28 17:32:09] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 3 ms to minimize.
[2024-05-28 17:32:09] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 2 ms to minimize.
[2024-05-28 17:32:09] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 2 ms to minimize.
[2024-05-28 17:32:09] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 3 ms to minimize.
[2024-05-28 17:32:09] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 2 ms to minimize.
[2024-05-28 17:32:10] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 2 ms to minimize.
[2024-05-28 17:32:10] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 3 ms to minimize.
[2024-05-28 17:32:10] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 2 ms to minimize.
[2024-05-28 17:32:10] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 2 ms to minimize.
[2024-05-28 17:32:10] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 2 ms to minimize.
[2024-05-28 17:32:10] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 1 ms to minimize.
[2024-05-28 17:32:10] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 2 ms to minimize.
[2024-05-28 17:32:10] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 3 ms to minimize.
[2024-05-28 17:32:11] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 2 ms to minimize.
[2024-05-28 17:32:11] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1281 variables, 20/436 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:32:11] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-05-28 17:32:11] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2024-05-28 17:32:11] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 2 ms to minimize.
[2024-05-28 17:32:11] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
[2024-05-28 17:32:11] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-05-28 17:32:11] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-28 17:32:11] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-28 17:32:11] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-05-28 17:32:12] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-28 17:32:12] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2024-05-28 17:32:12] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2024-05-28 17:32:12] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1281 variables, 12/448 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:32:12] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 2 ms to minimize.
[2024-05-28 17:32:12] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 2 ms to minimize.
[2024-05-28 17:32:12] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1281 variables, 3/451 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:32:13] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-05-28 17:32:13] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-28 17:32:13] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1281 variables, 3/454 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:32:13] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 2 ms to minimize.
[2024-05-28 17:32:13] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1281 variables, 2/456 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1281 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 24/1305 variables, 12/468 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:32:14] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 2 ms to minimize.
[2024-05-28 17:32:14] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2024-05-28 17:32:14] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1305 variables, 3/471 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1305 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 1324/2629 variables, 1305/1776 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2629 variables, 2/1778 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:32:16] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 8 ms to minimize.
[2024-05-28 17:32:16] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 2 ms to minimize.
[2024-05-28 17:32:16] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 3 ms to minimize.
[2024-05-28 17:32:16] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 2 ms to minimize.
[2024-05-28 17:32:16] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 3 ms to minimize.
[2024-05-28 17:32:16] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 2 ms to minimize.
[2024-05-28 17:32:17] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 3 ms to minimize.
[2024-05-28 17:32:17] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 2 ms to minimize.
[2024-05-28 17:32:17] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 3 ms to minimize.
[2024-05-28 17:32:17] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 2 ms to minimize.
[2024-05-28 17:32:17] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 2 ms to minimize.
[2024-05-28 17:32:18] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 2 ms to minimize.
[2024-05-28 17:32:18] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 2 ms to minimize.
[2024-05-28 17:32:18] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 3 ms to minimize.
[2024-05-28 17:32:18] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 2 ms to minimize.
[2024-05-28 17:32:18] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 3 ms to minimize.
[2024-05-28 17:32:18] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 2 ms to minimize.
[2024-05-28 17:32:19] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 3 ms to minimize.
[2024-05-28 17:32:19] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 3 ms to minimize.
[2024-05-28 17:32:19] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2629 variables, 20/1798 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:32:20] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 2 ms to minimize.
[2024-05-28 17:32:21] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 3 ms to minimize.
[2024-05-28 17:32:21] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 3 ms to minimize.
[2024-05-28 17:32:21] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 3 ms to minimize.
[2024-05-28 17:32:21] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 2 ms to minimize.
[2024-05-28 17:32:21] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 2 ms to minimize.
[2024-05-28 17:32:22] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 2 ms to minimize.
[2024-05-28 17:32:22] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 2 ms to minimize.
[2024-05-28 17:32:22] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 3 ms to minimize.
[2024-05-28 17:32:22] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 2 ms to minimize.
[2024-05-28 17:32:22] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 3 ms to minimize.
[2024-05-28 17:32:22] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 2 ms to minimize.
[2024-05-28 17:32:23] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 2 ms to minimize.
[2024-05-28 17:32:23] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 2 ms to minimize.
[2024-05-28 17:32:23] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 2 ms to minimize.
[2024-05-28 17:32:23] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 2 ms to minimize.
[2024-05-28 17:32:23] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 2 ms to minimize.
[2024-05-28 17:32:23] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 2 ms to minimize.
[2024-05-28 17:32:24] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 2 ms to minimize.
[2024-05-28 17:32:24] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/2629 variables, 20/1818 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:32:24] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 3 ms to minimize.
[2024-05-28 17:32:24] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 3 ms to minimize.
[2024-05-28 17:32:24] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 2 ms to minimize.
[2024-05-28 17:32:25] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 2 ms to minimize.
[2024-05-28 17:32:25] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 2 ms to minimize.
[2024-05-28 17:32:25] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 2 ms to minimize.
[2024-05-28 17:32:25] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 2 ms to minimize.
[2024-05-28 17:32:25] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
[2024-05-28 17:32:25] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 2 ms to minimize.
[2024-05-28 17:32:26] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 2 ms to minimize.
[2024-05-28 17:32:26] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 1 ms to minimize.
[2024-05-28 17:32:26] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2024-05-28 17:32:26] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 2 ms to minimize.
[2024-05-28 17:32:26] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/2629 variables, 14/1832 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2629 variables, 0/1832 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (OVERLAPS) 148/2777 variables, 91/1923 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2777 variables, 29/1952 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2777 variables, 5/1957 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:32:29] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 2 ms to minimize.
[2024-05-28 17:32:30] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 3 ms to minimize.
[2024-05-28 17:32:30] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 3 ms to minimize.
[2024-05-28 17:32:30] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 2 ms to minimize.
[2024-05-28 17:32:30] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 2 ms to minimize.
[2024-05-28 17:32:31] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 2 ms to minimize.
[2024-05-28 17:32:31] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 2 ms to minimize.
[2024-05-28 17:32:31] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 3 ms to minimize.
[2024-05-28 17:32:31] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 2 ms to minimize.
[2024-05-28 17:32:31] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 2 ms to minimize.
[2024-05-28 17:32:32] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 2 ms to minimize.
[2024-05-28 17:32:32] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 2 ms to minimize.
[2024-05-28 17:32:32] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 2 ms to minimize.
[2024-05-28 17:32:33] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 2 ms to minimize.
[2024-05-28 17:32:33] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 2 ms to minimize.
[2024-05-28 17:32:33] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/2777 variables, 16/1973 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:32:34] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 1 ms to minimize.
[2024-05-28 17:32:35] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 2 ms to minimize.
[2024-05-28 17:32:35] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 1 ms to minimize.
[2024-05-28 17:32:35] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 2 ms to minimize.
[2024-05-28 17:32:36] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/2777 variables, 5/1978 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2777 variables, 0/1978 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (OVERLAPS) 6/2783 variables, 5/1983 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2783 variables, 4/1987 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2783 variables, 0/1987 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (OVERLAPS) 6/2789 variables, 3/1990 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2789 variables, 4/1994 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:32:39] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 3 ms to minimize.
[2024-05-28 17:32:40] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 2 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/2789 variables, 2/1996 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2789 variables, 0/1996 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (OVERLAPS) 2/2791 variables, 1/1997 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2791 variables, 2/1999 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2791 variables, 0/1999 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 38 (OVERLAPS) 56/2847 variables, 36/2035 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2847 variables, 10/2045 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2847 variables, 1/2046 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:32:44] [INFO ] Deduced a trap composed of 10 places in 199 ms of which 3 ms to minimize.
[2024-05-28 17:32:45] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 3 ms to minimize.
[2024-05-28 17:32:45] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 4 ms to minimize.
[2024-05-28 17:32:45] [INFO ] Deduced a trap composed of 13 places in 207 ms of which 4 ms to minimize.
[2024-05-28 17:32:46] [INFO ] Deduced a trap composed of 16 places in 215 ms of which 4 ms to minimize.
[2024-05-28 17:32:46] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 3 ms to minimize.
[2024-05-28 17:32:46] [INFO ] Deduced a trap composed of 10 places in 201 ms of which 4 ms to minimize.
[2024-05-28 17:32:46] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 3 ms to minimize.
[2024-05-28 17:32:47] [INFO ] Deduced a trap composed of 6 places in 175 ms of which 3 ms to minimize.
[2024-05-28 17:32:47] [INFO ] Deduced a trap composed of 10 places in 185 ms of which 4 ms to minimize.
[2024-05-28 17:32:47] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 3 ms to minimize.
[2024-05-28 17:32:47] [INFO ] Deduced a trap composed of 6 places in 171 ms of which 3 ms to minimize.
[2024-05-28 17:32:48] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 3 ms to minimize.
[2024-05-28 17:32:48] [INFO ] Deduced a trap composed of 5 places in 189 ms of which 3 ms to minimize.
[2024-05-28 17:32:48] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 3 ms to minimize.
[2024-05-28 17:32:48] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 3 ms to minimize.
[2024-05-28 17:32:49] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 3 ms to minimize.
[2024-05-28 17:32:49] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 3 ms to minimize.
[2024-05-28 17:32:49] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 2 ms to minimize.
[2024-05-28 17:32:49] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 6 ms to minimize.
SMT process timed out in 49994ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 205 out of 1462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1462/1462 places, 1412/1412 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1462 transition count 1407
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 1457 transition count 1407
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 10 place count 1457 transition count 1404
Deduced a syphon composed of 3 places in 8 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 1454 transition count 1404
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 1453 transition count 1403
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 1453 transition count 1403
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 34 place count 1445 transition count 1395
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 37 place count 1445 transition count 1395
Applied a total of 37 rules in 350 ms. Remains 1445 /1462 variables (removed 17) and now considering 1395/1412 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 351 ms. Remains : 1445/1462 places, 1395/1412 transitions.
RANDOM walk for 40000 steps (8 resets) in 1412 ms. (28 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 418 ms. (95 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 411 ms. (97 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 372 ms. (107 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 323 ms. (123 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 282 ms. (141 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 372 ms. (107 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 394 ms. (101 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 109160 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :0 out of 7
Probabilistic random walk after 109160 steps, saw 91782 distinct states, run finished after 3005 ms. (steps per millisecond=36 ) properties seen :0
// Phase 1: matrix 1395 rows 1445 cols
[2024-05-28 17:32:54] [INFO ] Computed 451 invariants in 19 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 644/849 variables, 224/224 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/849 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 415/1264 variables, 156/380 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1264 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 26/1290 variables, 13/393 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1290 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1309/2599 variables, 1290/1683 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2599 variables, 0/1683 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 147/2746 variables, 91/1774 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2746 variables, 30/1804 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2746 variables, 0/1804 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 4/2750 variables, 4/1808 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2750 variables, 4/1812 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2750 variables, 0/1812 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 6/2756 variables, 3/1815 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2756 variables, 4/1819 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2756 variables, 0/1819 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 2/2758 variables, 1/1820 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2758 variables, 2/1822 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2758 variables, 0/1822 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 55/2813 variables, 34/1856 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2813 variables, 10/1866 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2813 variables, 1/1867 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2813 variables, 0/1867 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (OVERLAPS) 1/2814 variables, 1/1868 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2814 variables, 1/1869 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2814 variables, 0/1869 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (OVERLAPS) 20/2834 variables, 14/1883 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2834 variables, 4/1887 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2834 variables, 0/1887 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (OVERLAPS) 1/2835 variables, 2/1889 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2835 variables, 1/1890 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2835 variables, 0/1890 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 34 (OVERLAPS) 5/2840 variables, 4/1894 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2840 variables, 2/1896 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2840 variables, 0/1896 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 37 (OVERLAPS) 0/2840 variables, 0/1896 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2840/2840 variables, and 1896 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4488 ms.
Refiners :[Positive P Invariants (semi-flows): 436/436 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 1445/1445 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 644/849 variables, 224/224 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:32:59] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2024-05-28 17:32:59] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 2 ms to minimize.
[2024-05-28 17:32:59] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 2 ms to minimize.
[2024-05-28 17:32:59] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-05-28 17:32:59] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 2 ms to minimize.
[2024-05-28 17:32:59] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
[2024-05-28 17:33:00] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-05-28 17:33:00] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-05-28 17:33:00] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 2 ms to minimize.
[2024-05-28 17:33:00] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-05-28 17:33:00] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 2 ms to minimize.
[2024-05-28 17:33:00] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 2 ms to minimize.
[2024-05-28 17:33:00] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 6 ms to minimize.
[2024-05-28 17:33:00] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-28 17:33:00] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 2 ms to minimize.
[2024-05-28 17:33:00] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-28 17:33:00] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-28 17:33:00] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-28 17:33:00] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-28 17:33:01] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/849 variables, 20/244 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:33:01] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-28 17:33:01] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-28 17:33:01] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 1 ms to minimize.
[2024-05-28 17:33:01] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-28 17:33:01] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-28 17:33:01] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-28 17:33:01] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-28 17:33:01] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-28 17:33:01] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/849 variables, 9/253 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:33:01] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-28 17:33:02] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-28 17:33:02] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-05-28 17:33:02] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-28 17:33:02] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-05-28 17:33:02] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/849 variables, 6/259 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:33:02] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 1 ms to minimize.
[2024-05-28 17:33:02] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-28 17:33:02] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-05-28 17:33:02] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-28 17:33:02] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-05-28 17:33:03] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/849 variables, 6/265 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:33:03] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-28 17:33:03] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/849 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:33:03] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2024-05-28 17:33:03] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-28 17:33:03] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/849 variables, 3/270 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:33:03] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/849 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:33:03] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-28 17:33:04] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-28 17:33:04] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/849 variables, 3/274 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/849 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 415/1264 variables, 156/430 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:33:04] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 3 ms to minimize.
[2024-05-28 17:33:04] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 2 ms to minimize.
[2024-05-28 17:33:04] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-28 17:33:04] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 2 ms to minimize.
[2024-05-28 17:33:05] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 2 ms to minimize.
[2024-05-28 17:33:05] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
[2024-05-28 17:33:05] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 2 ms to minimize.
[2024-05-28 17:33:05] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 4 ms to minimize.
[2024-05-28 17:33:05] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 2 ms to minimize.
[2024-05-28 17:33:05] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 1 ms to minimize.
[2024-05-28 17:33:05] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
[2024-05-28 17:33:05] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 1 ms to minimize.
[2024-05-28 17:33:05] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2024-05-28 17:33:05] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 1 ms to minimize.
[2024-05-28 17:33:06] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 1 ms to minimize.
[2024-05-28 17:33:06] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2024-05-28 17:33:06] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 2 ms to minimize.
[2024-05-28 17:33:06] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-05-28 17:33:06] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-28 17:33:06] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1264 variables, 20/450 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:33:06] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-28 17:33:06] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-28 17:33:06] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-28 17:33:06] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 1 ms to minimize.
[2024-05-28 17:33:07] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-28 17:33:07] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-28 17:33:07] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 2 ms to minimize.
[2024-05-28 17:33:07] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-05-28 17:33:07] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-28 17:33:07] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-28 17:33:07] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-28 17:33:07] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-28 17:33:07] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-05-28 17:33:07] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-28 17:33:07] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-28 17:33:08] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-28 17:33:08] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 1 ms to minimize.
[2024-05-28 17:33:08] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1264 variables, 18/468 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:33:08] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2024-05-28 17:33:08] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 2 ms to minimize.
[2024-05-28 17:33:08] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 2 ms to minimize.
[2024-05-28 17:33:08] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-05-28 17:33:08] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1264 variables, 5/473 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:33:09] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1264 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1264 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 26/1290 variables, 13/487 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:33:09] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 2 ms to minimize.
[2024-05-28 17:33:09] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 3 ms to minimize.
[2024-05-28 17:33:09] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 3 ms to minimize.
[2024-05-28 17:33:10] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 3 ms to minimize.
[2024-05-28 17:33:10] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 2 ms to minimize.
[2024-05-28 17:33:10] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 2 ms to minimize.
[2024-05-28 17:33:10] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 2 ms to minimize.
[2024-05-28 17:33:10] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 2 ms to minimize.
[2024-05-28 17:33:10] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 4 ms to minimize.
[2024-05-28 17:33:10] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 2 ms to minimize.
[2024-05-28 17:33:10] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 2 ms to minimize.
[2024-05-28 17:33:11] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 2 ms to minimize.
[2024-05-28 17:33:11] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 2 ms to minimize.
[2024-05-28 17:33:11] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 2 ms to minimize.
[2024-05-28 17:33:11] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 1 ms to minimize.
[2024-05-28 17:33:11] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
[2024-05-28 17:33:11] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-28 17:33:11] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-28 17:33:11] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-28 17:33:11] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1290 variables, 20/507 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:33:12] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 2 ms to minimize.
[2024-05-28 17:33:12] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-05-28 17:33:12] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2024-05-28 17:33:12] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2024-05-28 17:33:12] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 2 ms to minimize.
[2024-05-28 17:33:12] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-05-28 17:33:12] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2024-05-28 17:33:12] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 1 ms to minimize.
[2024-05-28 17:33:13] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 2 ms to minimize.
[2024-05-28 17:33:13] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 2 ms to minimize.
[2024-05-28 17:33:13] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2024-05-28 17:33:13] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 2 ms to minimize.
[2024-05-28 17:33:13] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2024-05-28 17:33:13] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
[2024-05-28 17:33:13] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
[2024-05-28 17:33:13] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 1 ms to minimize.
[2024-05-28 17:33:13] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1290 variables, 17/524 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:33:14] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 2 ms to minimize.
[2024-05-28 17:33:14] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-05-28 17:33:14] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-28 17:33:14] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 1 ms to minimize.
[2024-05-28 17:33:14] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1290 variables, 5/529 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:33:15] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1290 variables, 1/530 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:33:15] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 4 ms to minimize.
[2024-05-28 17:33:15] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 2 ms to minimize.
[2024-05-28 17:33:15] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 1 ms to minimize.
[2024-05-28 17:33:15] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 2 ms to minimize.
[2024-05-28 17:33:15] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 2 ms to minimize.
[2024-05-28 17:33:15] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 2 ms to minimize.
[2024-05-28 17:33:15] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 1 ms to minimize.
[2024-05-28 17:33:16] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 3 ms to minimize.
[2024-05-28 17:33:16] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 2 ms to minimize.
[2024-05-28 17:33:16] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 2 ms to minimize.
[2024-05-28 17:33:16] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 2 ms to minimize.
[2024-05-28 17:33:16] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-05-28 17:33:16] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
[2024-05-28 17:33:16] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 2 ms to minimize.
[2024-05-28 17:33:17] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1290 variables, 15/545 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:33:17] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 2 ms to minimize.
[2024-05-28 17:33:17] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-05-28 17:33:17] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 ms to minimize.
[2024-05-28 17:33:17] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1290 variables, 4/549 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1290 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (OVERLAPS) 1309/2599 variables, 1290/1839 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2599 variables, 2/1841 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:33:19] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 3 ms to minimize.
[2024-05-28 17:33:19] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 2 ms to minimize.
[2024-05-28 17:33:19] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 2 ms to minimize.
[2024-05-28 17:33:19] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 2 ms to minimize.
[2024-05-28 17:33:19] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 2 ms to minimize.
[2024-05-28 17:33:19] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 2 ms to minimize.
[2024-05-28 17:33:20] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 2 ms to minimize.
[2024-05-28 17:33:20] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2024-05-28 17:33:20] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 2 ms to minimize.
[2024-05-28 17:33:20] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 2 ms to minimize.
[2024-05-28 17:33:20] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 2 ms to minimize.
[2024-05-28 17:33:20] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 2 ms to minimize.
[2024-05-28 17:33:21] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 2 ms to minimize.
[2024-05-28 17:33:21] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 2 ms to minimize.
[2024-05-28 17:33:21] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 2 ms to minimize.
[2024-05-28 17:33:21] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 2 ms to minimize.
[2024-05-28 17:33:21] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2024-05-28 17:33:22] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-28 17:33:22] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2024-05-28 17:33:22] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 2 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/2599 variables, 20/1861 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:33:23] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 2 ms to minimize.
[2024-05-28 17:33:23] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 1 ms to minimize.
[2024-05-28 17:33:23] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 2 ms to minimize.
[2024-05-28 17:33:23] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-28 17:33:23] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 2 ms to minimize.
[2024-05-28 17:33:24] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 2 ms to minimize.
[2024-05-28 17:33:24] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-05-28 17:33:24] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 2 ms to minimize.
[2024-05-28 17:33:24] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 2 ms to minimize.
[2024-05-28 17:33:24] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-28 17:33:24] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2024-05-28 17:33:25] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
[2024-05-28 17:33:25] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 2 ms to minimize.
[2024-05-28 17:33:25] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/2599 variables, 14/1875 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:33:26] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:33:26] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/2599 variables, 2/1877 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2599 variables, 0/1877 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (OVERLAPS) 147/2746 variables, 91/1968 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2746 variables, 30/1998 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2746 variables, 5/2003 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:33:31] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 2 ms to minimize.
[2024-05-28 17:33:31] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 2 ms to minimize.
[2024-05-28 17:33:31] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 2 ms to minimize.
[2024-05-28 17:33:31] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 2 ms to minimize.
[2024-05-28 17:33:31] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 2 ms to minimize.
[2024-05-28 17:33:32] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2024-05-28 17:33:32] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 2 ms to minimize.
[2024-05-28 17:33:32] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 2 ms to minimize.
[2024-05-28 17:33:33] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 2 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/2746 variables, 9/2012 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:33:33] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
[2024-05-28 17:33:34] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 2 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/2746 variables, 2/2014 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:33:36] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 2 ms to minimize.
[2024-05-28 17:33:36] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 2 ms to minimize.
[2024-05-28 17:33:36] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 2 ms to minimize.
[2024-05-28 17:33:36] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 2 ms to minimize.
[2024-05-28 17:33:36] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 2 ms to minimize.
[2024-05-28 17:33:37] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 2 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/2746 variables, 6/2020 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2746 variables, 0/2020 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 38 (OVERLAPS) 4/2750 variables, 4/2024 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2750 variables, 4/2028 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:33:38] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 2 ms to minimize.
At refinement iteration 40 (INCLUDED_ONLY) 0/2750 variables, 1/2029 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:33:40] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 2 ms to minimize.
[2024-05-28 17:33:40] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 2 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/2750 variables, 2/2031 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:33:41] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 2 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/2750 variables, 1/2032 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2750 variables, 0/2032 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 44 (OVERLAPS) 6/2756 variables, 3/2035 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/2756 variables, 4/2039 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/2756 variables, 0/2039 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 47 (OVERLAPS) 2/2758 variables, 1/2040 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/2758 variables, 2/2042 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:33:45] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 2 ms to minimize.
[2024-05-28 17:33:45] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 2 ms to minimize.
[2024-05-28 17:33:46] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 2 ms to minimize.
[2024-05-28 17:33:46] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 2 ms to minimize.
[2024-05-28 17:33:46] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 2 ms to minimize.
[2024-05-28 17:33:46] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 2 ms to minimize.
[2024-05-28 17:33:47] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 2 ms to minimize.
At refinement iteration 49 (INCLUDED_ONLY) 0/2758 variables, 7/2049 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:33:48] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
At refinement iteration 50 (INCLUDED_ONLY) 0/2758 variables, 1/2050 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/2758 variables, 0/2050 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 52 (OVERLAPS) 55/2813 variables, 34/2084 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/2813 variables, 10/2094 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/2813 variables, 1/2095 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:33:51] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 2 ms to minimize.
[2024-05-28 17:33:51] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 2 ms to minimize.
[2024-05-28 17:33:51] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 2 ms to minimize.
At refinement iteration 55 (INCLUDED_ONLY) 0/2813 variables, 3/2098 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/2813 variables, 0/2098 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 57 (OVERLAPS) 1/2814 variables, 1/2099 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/2814 variables, 1/2100 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/2814 variables, 0/2100 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 60 (OVERLAPS) 20/2834 variables, 14/2114 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/2834 variables, 4/2118 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/2834 variables, 0/2118 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 63 (OVERLAPS) 1/2835 variables, 2/2120 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/2835 variables, 1/2121 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/2835 variables, 0/2121 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 66 (OVERLAPS) 5/2840 variables, 4/2125 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/2840 variables, 2/2127 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/2840 variables, 0/2127 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 69 (OVERLAPS) 0/2840 variables, 0/2127 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2840/2840 variables, and 2127 constraints, problems are : Problem set: 0 solved, 7 unsolved in 61913 ms.
Refiners :[Positive P Invariants (semi-flows): 436/436 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 1445/1445 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 224/224 constraints]
After SMT, in 66470ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 10339 ms.
Support contains 205 out of 1445 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1445/1445 places, 1395/1395 transitions.
Applied a total of 0 rules in 46 ms. Remains 1445 /1445 variables (removed 0) and now considering 1395/1395 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 1445/1445 places, 1395/1395 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1445/1445 places, 1395/1395 transitions.
Applied a total of 0 rules in 45 ms. Remains 1445 /1445 variables (removed 0) and now considering 1395/1395 (removed 0) transitions.
[2024-05-28 17:34:11] [INFO ] Invariant cache hit.
[2024-05-28 17:34:12] [INFO ] Implicit Places using invariants in 698 ms returned []
[2024-05-28 17:34:12] [INFO ] Invariant cache hit.
[2024-05-28 17:34:13] [INFO ] Implicit Places using invariants and state equation in 1551 ms returned []
Implicit Place search using SMT with State Equation took 2257 ms to find 0 implicit places.
[2024-05-28 17:34:13] [INFO ] Redundant transitions in 106 ms returned []
Running 1378 sub problems to find dead transitions.
[2024-05-28 17:34:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1428 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 1378 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1428 variables, 15/84 constraints. Problems are: Problem set: 0 solved, 1378 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1428/2840 variables, and 84 constraints, problems are : Problem set: 0 solved, 1378 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 69/436 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 0/1445 constraints, PredecessorRefiner: 1378/1378 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1378 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1428 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 1378 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1428 variables, 15/84 constraints. Problems are: Problem set: 0 solved, 1378 unsolved
[2024-05-28 17:35:04] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-28 17:35:05] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-28 17:35:06] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 17:35:06] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 17:35:07] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-28 17:35:07] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1428/2840 variables, and 90 constraints, problems are : Problem set: 0 solved, 1378 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 69/436 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 0/1445 constraints, PredecessorRefiner: 0/1378 constraints, Known Traps: 6/6 constraints]
After SMT, in 60540ms problems are : Problem set: 0 solved, 1378 unsolved
Search for dead transitions found 0 dead transitions in 60558ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62980 ms. Remains : 1445/1445 places, 1395/1395 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-28 17:35:14] [INFO ] Flatten gal took : 91 ms
[2024-05-28 17:35:14] [INFO ] Applying decomposition
[2024-05-28 17:35:14] [INFO ] Flatten gal took : 89 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3653763213726254233.txt' '-o' '/tmp/graph3653763213726254233.bin' '-w' '/tmp/graph3653763213726254233.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3653763213726254233.bin' '-l' '-1' '-v' '-w' '/tmp/graph3653763213726254233.weights' '-q' '0' '-e' '0.001'
[2024-05-28 17:35:15] [INFO ] Decomposing Gal with order
[2024-05-28 17:35:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 17:35:15] [INFO ] Removed a total of 1150 redundant transitions.
[2024-05-28 17:35:15] [INFO ] Flatten gal took : 199 ms
[2024-05-28 17:35:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 20 ms.
[2024-05-28 17:35:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8527787397204249521.gal : 32 ms
[2024-05-28 17:35:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1577907158915871989.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8527787397204249521.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1577907158915871989.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality1577907158915871989.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :1 after 4.21673e+22
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :4.21673e+22 after 8.31932e+115
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :3.0761e+138 after 1.17916e+139
ITS-tools command line returned an error code 137
[2024-05-28 17:43:30] [INFO ] Flatten gal took : 73 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1826134378714949675
[2024-05-28 17:43:30] [INFO ] Computing symmetric may disable matrix : 1395 transitions.
[2024-05-28 17:43:30] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:43:30] [INFO ] Computing symmetric may enable matrix : 1395 transitions.
[2024-05-28 17:43:30] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:43:30] [INFO ] Applying decomposition
[2024-05-28 17:43:30] [INFO ] Flatten gal took : 60 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15733652951149582352.txt' '-o' '/tmp/graph15733652951149582352.bin' '-w' '/tmp/graph15733652951149582352.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15733652951149582352.bin' '-l' '-1' '-v' '-w' '/tmp/graph15733652951149582352.weights' '-q' '0' '-e' '0.001'
[2024-05-28 17:43:30] [INFO ] Decomposing Gal with order
[2024-05-28 17:43:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 17:43:30] [INFO ] Removed a total of 1074 redundant transitions.
[2024-05-28 17:43:31] [INFO ] Flatten gal took : 94 ms
[2024-05-28 17:43:31] [INFO ] Computing Do-Not-Accords matrix : 1395 transitions.
[2024-05-28 17:43:31] [INFO ] Computation of Completed DNA matrix. took 99 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:43:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 1024 labels/synchronizations in 82 ms.
[2024-05-28 17:43:31] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability10487886868336873842.gal : 37 ms
[2024-05-28 17:43:31] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability8184180207348720991.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability10487886868336873842.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability8184180207348720991.prop' '--nowitness'

[2024-05-28 17:43:31] [INFO ] Built C files in 645ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1826134378714949675
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Running compilation step : cd /tmp/ltsmin1826134378714949675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '102' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Loading property file /tmp/ReachabilityFireability8184180207348720991.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :1 after 97
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :97 after 5473
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :5473 after 32833
Compilation finished in 6546 ms.
Running link step : cd /tmp/ltsmin1826134378714949675;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 93 ms.
Running LTSmin : cd /tmp/ltsmin1826134378714949675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT050BReachabilityFireability202400==true'
WARNING : LTSmin timed out (>73 s) on command cd /tmp/ltsmin1826134378714949675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT050BReachabilityFireability202400==true'
Running LTSmin : cd /tmp/ltsmin1826134378714949675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT050BReachabilityFireability202304==true'
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :32833 after 4.16993e+09
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :4.16993e+09 after 5.12497e+21
WARNING : LTSmin timed out (>73 s) on command cd /tmp/ltsmin1826134378714949675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT050BReachabilityFireability202304==true'
Running LTSmin : cd /tmp/ltsmin1826134378714949675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT050BReachabilityFireability202305==true'
WARNING : LTSmin timed out (>73 s) on command cd /tmp/ltsmin1826134378714949675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT050BReachabilityFireability202305==true'
Running LTSmin : cd /tmp/ltsmin1826134378714949675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT050BReachabilityFireability202406==true'
WARNING : LTSmin timed out (>73 s) on command cd /tmp/ltsmin1826134378714949675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT050BReachabilityFireability202406==true'
Running LTSmin : cd /tmp/ltsmin1826134378714949675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT050BReachabilityFireability202409==true'
WARNING : LTSmin timed out (>73 s) on command cd /tmp/ltsmin1826134378714949675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT050BReachabilityFireability202409==true'
Running LTSmin : cd /tmp/ltsmin1826134378714949675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT050BReachabilityFireability202410==true'
WARNING : LTSmin timed out (>73 s) on command cd /tmp/ltsmin1826134378714949675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT050BReachabilityFireability202410==true'
Running LTSmin : cd /tmp/ltsmin1826134378714949675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT050BReachabilityFireability202411==true'
WARNING : LTSmin timed out (>73 s) on command cd /tmp/ltsmin1826134378714949675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT050BReachabilityFireability202411==true'
Retrying LTSmin with larger timeout 4112 s
Running LTSmin : cd /tmp/ltsmin1826134378714949675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT050BReachabilityFireability202400==true'
WARNING : LTSmin timed out (>587 s) on command cd /tmp/ltsmin1826134378714949675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT050BReachabilityFireability202400==true'
Running LTSmin : cd /tmp/ltsmin1826134378714949675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT050BReachabilityFireability202304==true'
ITS-tools command line returned an error code 137
[2024-05-28 18:06:51] [INFO ] Applying decomposition
[2024-05-28 18:06:51] [INFO ] Flatten gal took : 105 ms
[2024-05-28 18:06:51] [INFO ] Decomposing Gal with order
[2024-05-28 18:06:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 18:06:51] [INFO ] Removed a total of 1098 redundant transitions.
[2024-05-28 18:06:51] [INFO ] Flatten gal took : 263 ms
[2024-05-28 18:06:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 2301 labels/synchronizations in 371 ms.
[2024-05-28 18:06:54] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability10319140457155113665.gal : 86 ms
[2024-05-28 18:06:54] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability11469765020663333794.prop : 18 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability10319140457155113665.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability11469765020663333794.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityFireability11469765020663333794.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :7 after 19
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :19 after 343
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :343 after 5.21241e+08
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :5.21241e+08 after 4.44876e+18
WARNING : LTSmin timed out (>587 s) on command cd /tmp/ltsmin1826134378714949675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT050BReachabilityFireability202304==true'
Running LTSmin : cd /tmp/ltsmin1826134378714949675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT050BReachabilityFireability202305==true'
WARNING : LTSmin timed out (>587 s) on command cd /tmp/ltsmin1826134378714949675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT050BReachabilityFireability202305==true'
Running LTSmin : cd /tmp/ltsmin1826134378714949675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT050BReachabilityFireability202406==true'
ITS-tools command line returned an error code 137
[2024-05-28 18:27:10] [INFO ] Flatten gal took : 60 ms
[2024-05-28 18:27:10] [INFO ] Input system was already deterministic with 1395 transitions.
[2024-05-28 18:27:10] [INFO ] Transformed 1445 places.
[2024-05-28 18:27:10] [INFO ] Transformed 1395 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 18:27:11] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability9241582085364403305.gal : 16 ms
[2024-05-28 18:27:11] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability8426892854915417295.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability9241582085364403305.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability8426892854915417295.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...373
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityFireability8426892854915417295.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :4 after 9
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :9 after 43
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :43 after 112
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :112 after 776
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :776 after 5202
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :5202 after 77554
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :77554 after 96526
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :96526 after 1.86217e+06
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :1.86217e+06 after 1.29706e+08
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :1.29706e+08 after 1.64191e+08
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :1.64191e+08 after 4.22497e+09
SDD proceeding with computation,7 properties remain. new max is 16384
SDD size :4.22497e+09 after 4.01576e+11
SDD proceeding with computation,7 properties remain. new max is 32768
SDD size :4.01576e+11 after 1.06263e+14
SDD proceeding with computation,7 properties remain. new max is 65536
SDD size :1.06263e+14 after 2.33732e+15
SDD proceeding with computation,7 properties remain. new max is 131072
SDD size :2.33732e+15 after 4.40657e+17
SDD proceeding with computation,7 properties remain. new max is 262144
SDD size :4.40657e+17 after 1.28826e+19
WARNING : LTSmin timed out (>587 s) on command cd /tmp/ltsmin1826134378714949675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT050BReachabilityFireability202406==true'
Running LTSmin : cd /tmp/ltsmin1826134378714949675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT050BReachabilityFireability202409==true'

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//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//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-050B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ShieldIIPs-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 r356-tall-171683760500159"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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