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-171683760400110.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-020B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760400110
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 11 14:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 11 14:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 332K 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-020B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-2023-12
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716899679231

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-020B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-28 12:34:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 12:34:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 12:34:40] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2024-05-28 12:34:40] [INFO ] Transformed 1203 places.
[2024-05-28 12:34:40] [INFO ] Transformed 1183 transitions.
[2024-05-28 12:34:40] [INFO ] Found NUPN structural information;
[2024-05-28 12:34:40] [INFO ] Parsed PT model containing 1203 places and 1183 transitions and 3566 arcs in 266 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (15 resets) in 1761 ms. (22 steps per ms) remains 2/11 properties
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-28 12:34:41] [INFO ] Flatten gal took : 298 ms
BEST_FIRST walk for 40004 steps (8 resets) in 436 ms. (91 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 2/2 properties
[2024-05-28 12:34:41] [INFO ] Flatten gal took : 116 ms
// Phase 1: matrix 1183 rows 1203 cols
[2024-05-28 12:34:41] [INFO ] Computed 181 invariants in 28 ms
[2024-05-28 12:34:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality638137053158345818.gal : 65 ms
[2024-05-28 12:34:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14525582051949273213.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality638137053158345818.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14525582051949273213.prop' '--nowitness' '--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 ...328
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Loading property file /tmp/ReachabilityCardinality14525582051949273213.prop.
At refinement iteration 2 (OVERLAPS) 238/253 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 238/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 950/1203 variables, 152/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1203 variables, 950/1384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1203 variables, 0/1384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1183/2386 variables, 1203/2587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,2 properties remain. new max is 64
At refinement iteration 9 (INCLUDED_ONLY) 0/2386 variables, 0/2587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD size :36 after 374
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :374 after 486
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :486 after 18163
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :18163 after 1.45699e+08
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.45699e+08 after 5.81902e+13
At refinement iteration 10 (OVERLAPS) 0/2386 variables, 0/2587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2386/2386 variables, and 2587 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1077 ms.
Refiners :[Domain max(s): 1203/1203 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 1203/1203 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :5.81902e+13 after 1.53458e+30
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 238/253 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 238/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.53458e+30 after 1.96246e+50
[2024-05-28 12:34:42] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.96246e+50 after 2.03579e+55
At refinement iteration 6 (OVERLAPS) 950/1203 variables, 152/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1203 variables, 950/1385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 12:34:43] [INFO ] Deduced a trap composed of 25 places in 228 ms of which 4 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2.03579e+55 after 2.03579e+55
[2024-05-28 12:34:43] [INFO ] Deduced a trap composed of 19 places in 230 ms of which 5 ms to minimize.
[2024-05-28 12:34:43] [INFO ] Deduced a trap composed of 26 places in 216 ms of which 5 ms to minimize.
[2024-05-28 12:34:44] [INFO ] Deduced a trap composed of 38 places in 204 ms of which 4 ms to minimize.
[2024-05-28 12:34:44] [INFO ] Deduced a trap composed of 24 places in 193 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :2.03579e+55 after 2.03579e+55
[2024-05-28 12:34:44] [INFO ] Deduced a trap composed of 24 places in 216 ms of which 4 ms to minimize.
[2024-05-28 12:34:44] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 4 ms to minimize.
[2024-05-28 12:34:44] [INFO ] Deduced a trap composed of 28 places in 195 ms of which 4 ms to minimize.
[2024-05-28 12:34:45] [INFO ] Deduced a trap composed of 14 places in 199 ms of which 4 ms to minimize.
[2024-05-28 12:34:45] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 4 ms to minimize.
[2024-05-28 12:34:45] [INFO ] Deduced a trap composed of 25 places in 165 ms of which 3 ms to minimize.
[2024-05-28 12:34:45] [INFO ] Deduced a trap composed of 44 places in 166 ms of which 3 ms to minimize.
[2024-05-28 12:34:45] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 4 ms to minimize.
[2024-05-28 12:34:46] [INFO ] Deduced a trap composed of 40 places in 194 ms of which 3 ms to minimize.
[2024-05-28 12:34:46] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 4 ms to minimize.
[2024-05-28 12:34:46] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 3 ms to minimize.
[2024-05-28 12:34:46] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :2.03579e+55 after 2.03579e+55
[2024-05-28 12:34:46] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 3 ms to minimize.
[2024-05-28 12:34:46] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 3 ms to minimize.
[2024-05-28 12:34:47] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1203 variables, 20/1405 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 12:34:47] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 3 ms to minimize.
[2024-05-28 12:34:47] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 3 ms to minimize.
[2024-05-28 12:34:47] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 2 ms to minimize.
[2024-05-28 12:34:47] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 3 ms to minimize.
SMT process timed out in 6202ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 1203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1203/1203 places, 1183/1183 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 1203 transition count 1086
Reduce places removed 97 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 99 rules applied. Total rules applied 196 place count 1106 transition count 1084
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 198 place count 1104 transition count 1084
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 198 place count 1104 transition count 984
Deduced a syphon composed of 100 places in 3 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 398 place count 1004 transition count 984
Discarding 136 places :
Symmetric choice reduction at 3 with 136 rule applications. Total rules 534 place count 868 transition count 848
Iterating global reduction 3 with 136 rules applied. Total rules applied 670 place count 868 transition count 848
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 670 place count 868 transition count 790
Deduced a syphon composed of 58 places in 3 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 786 place count 810 transition count 790
Performed 295 Post agglomeration using F-continuation condition.Transition count delta: 295
Deduced a syphon composed of 295 places in 2 ms
Reduce places removed 295 places and 0 transitions.
Iterating global reduction 3 with 590 rules applied. Total rules applied 1376 place count 515 transition count 495
Partial Free-agglomeration rule applied 134 times.
Drop transitions (Partial Free agglomeration) removed 134 transitions
Iterating global reduction 3 with 134 rules applied. Total rules applied 1510 place count 515 transition count 495
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1511 place count 514 transition count 494
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1512 place count 513 transition count 494
Applied a total of 1512 rules in 460 ms. Remains 513 /1203 variables (removed 690) and now considering 494/1183 (removed 689) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 473 ms. Remains : 513/1203 places, 494/1183 transitions.
RANDOM walk for 40000 steps (12 resets) in 1242 ms. (32 steps per ms) remains 1/2 properties
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 1/1 properties
// Phase 1: matrix 494 rows 513 cols
[2024-05-28 12:34:48] [INFO ] Computed 180 invariants in 14 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/27 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 384/411 variables, 134/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 12:34:48] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-28 12:34:48] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-28 12:34:48] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-28 12:34:48] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 4/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/415 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/415 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 401/816 variables, 415/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 12:34:49] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 2 ms to minimize.
[2024-05-28 12:34:49] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 2 ms to minimize.
[2024-05-28 12:34:49] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2024-05-28 12:34:49] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2024-05-28 12:34:49] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 2 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/816 variables, 5/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/816 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/832 variables, 6/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/832 variables, 2/577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/832 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 25/857 variables, 12/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/857 variables, 3/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/857 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/858 variables, 1/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/858 variables, 1/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/858 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/860 variables, 1/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/860 variables, 2/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/860 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 21/881 variables, 10/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/881 variables, 4/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/881 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 25/906 variables, 12/623 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/906 variables, 3/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/906 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1/907 variables, 1/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/907 variables, 1/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/907 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 2/909 variables, 1/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/909 variables, 2/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/909 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 21/930 variables, 10/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/930 variables, 4/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/930 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 25/955 variables, 12/657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/955 variables, 3/660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/955 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 1/956 variables, 1/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/956 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/956 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 2/958 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/958 variables, 2/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/958 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 21/979 variables, 10/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/979 variables, 4/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/979 variables, 0/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 19/998 variables, 9/688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/998 variables, 1/689 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/998 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 1/999 variables, 1/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/999 variables, 1/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/999 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 2/1001 variables, 1/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1001 variables, 2/694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1001 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 1/1002 variables, 1/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1002 variables, 1/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1002 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 5/1007 variables, 4/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1007 variables, 2/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1007 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 0/1007 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1007/1007 variables, and 702 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1347 ms.
Refiners :[Positive P Invariants (semi-flows): 177/177 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/27 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 384/411 variables, 134/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 6/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 12:34:50] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-28 12:34:50] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-28 12:34:50] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-05-28 12:34:50] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-28 12:34:50] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-28 12:34:50] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-28 12:34:50] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 7/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/415 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/415 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/415 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 401/816 variables, 415/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/816 variables, 1/577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 12:34:50] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2024-05-28 12:34:50] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 2 ms to minimize.
[2024-05-28 12:34:50] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
[2024-05-28 12:34:50] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-05-28 12:34:50] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-28 12:34:51] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-28 12:34:51] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2024-05-28 12:34:51] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-28 12:34:51] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/816 variables, 9/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 12:34:51] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/816 variables, 1/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/816 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 16/832 variables, 6/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/832 variables, 2/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/832 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 25/857 variables, 12/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/857 variables, 3/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 12:34:51] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/857 variables, 1/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/857 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/858 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/858 variables, 1/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/858 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/860 variables, 1/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/860 variables, 2/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/860 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 21/881 variables, 10/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/881 variables, 4/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/881 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 25/906 variables, 12/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/906 variables, 3/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/906 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 1/907 variables, 1/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/907 variables, 1/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/907 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 2/909 variables, 1/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/909 variables, 2/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/909 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 21/930 variables, 10/660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/930 variables, 4/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/930 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 25/955 variables, 12/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/955 variables, 3/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/955 variables, 0/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 1/956 variables, 1/680 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/956 variables, 1/681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 12:34:51] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
At refinement iteration 48 (INCLUDED_ONLY) 0/956 variables, 1/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/956 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 2/958 variables, 1/683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/958 variables, 2/685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/958 variables, 0/685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 21/979 variables, 10/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/979 variables, 4/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/979 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 19/998 variables, 9/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/998 variables, 1/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/998 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 1/999 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/999 variables, 1/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/999 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 2/1001 variables, 1/712 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1001 variables, 2/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1001 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 1/1002 variables, 1/715 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1002 variables, 1/716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1002 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 5/1007 variables, 4/720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1007 variables, 2/722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1007 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 0/1007 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1007/1007 variables, and 722 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1999 ms.
Refiners :[Positive P Invariants (semi-flows): 177/177 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 28/28 constraints]
After SMT, in 3370ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 65 ms.
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 494/494 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 513 transition count 492
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 511 transition count 492
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 511 transition count 491
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 510 transition count 491
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 20 place count 503 transition count 484
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 503 transition count 484
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 502 transition count 483
Applied a total of 25 rules in 72 ms. Remains 502 /513 variables (removed 11) and now considering 483/494 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 502/513 places, 483/494 transitions.
RANDOM walk for 40000 steps (8 resets) in 433 ms. (92 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :2.03579e+55 after 2.03579e+55
Interrupted probabilistic random walk after 326641 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 1
Probabilistic random walk after 326641 steps, saw 147970 distinct states, run finished after 3014 ms. (steps per millisecond=108 ) properties seen :0
// Phase 1: matrix 483 rows 502 cols
[2024-05-28 12:34:55] [INFO ] Computed 180 invariants in 10 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/26 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/28 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 46/74 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 84/158 variables, 39/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 13/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 114/272 variables, 52/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 14/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/275 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/275 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/275 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/281 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/281 variables, 4/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/281 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 108/389 variables, 56/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/389 variables, 19/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/389 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/391 variables, 2/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/391 variables, 2/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/391 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 4/395 variables, 2/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/395 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/395 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 83/478 variables, 48/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/478 variables, 13/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/478 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 3/481 variables, 3/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/481 variables, 3/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/481 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 6/487 variables, 3/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/487 variables, 6/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 12:34:55] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-28 12:34:55] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-28 12:34:55] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 8 ms to minimize.
[2024-05-28 12:34:55] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/487 variables, 4/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/487 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 31/518 variables, 18/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/518 variables, 8/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/518 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 25/543 variables, 12/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/543 variables, 3/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/543 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 1/544 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/544 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/544 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 2/546 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/546 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/546 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 21/567 variables, 10/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/567 variables, 4/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/567 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 25/592 variables, 12/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/592 variables, 3/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/592 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 1/593 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/593 variables, 1/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/593 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 2/595 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/595 variables, 2/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/595 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 21/616 variables, 10/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/616 variables, 4/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/616 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 25/641 variables, 12/438 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/641 variables, 3/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/641 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 1/642 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/642 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/642 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 2/644 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/644 variables, 2/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/644 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 21/665 variables, 10/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/665 variables, 4/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/665 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 25/690 variables, 12/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/690 variables, 3/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/690 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 1/691 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/691 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/691 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 2/693 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/693 variables, 2/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/693 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 21/714 variables, 10/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/714 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/714 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (OVERLAPS) 25/739 variables, 12/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/739 variables, 3/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/739 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (OVERLAPS) 1/740 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/740 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/740 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (OVERLAPS) 2/742 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/742 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/742 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (OVERLAPS) 21/763 variables, 10/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/763 variables, 4/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/763 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (OVERLAPS) 25/788 variables, 12/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/788 variables, 3/543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/788 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (OVERLAPS) 1/789 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/789 variables, 1/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/789 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (OVERLAPS) 2/791 variables, 1/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/791 variables, 2/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/791 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (OVERLAPS) 21/812 variables, 10/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/812 variables, 4/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/812 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (OVERLAPS) 25/837 variables, 12/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/837 variables, 3/577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/837 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (OVERLAPS) 1/838 variables, 1/578 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/838 variables, 1/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/838 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (OVERLAPS) 2/840 variables, 1/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/840 variables, 2/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/840 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (OVERLAPS) 21/861 variables, 10/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/861 variables, 4/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/861 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (OVERLAPS) 25/886 variables, 12/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/886 variables, 3/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/886 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (OVERLAPS) 1/887 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/887 variables, 1/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/887 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (OVERLAPS) 2/889 variables, 1/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/889 variables, 2/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/889 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (OVERLAPS) 21/910 variables, 10/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/910 variables, 4/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/910 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 137 (OVERLAPS) 25/935 variables, 12/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/935 variables, 3/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/935 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 140 (OVERLAPS) 1/936 variables, 1/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/936 variables, 1/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/936 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 143 (OVERLAPS) 2/938 variables, 1/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/938 variables, 2/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/938 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 146 (OVERLAPS) 21/959 variables, 10/660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 147 (INCLUDED_ONLY) 0/959 variables, 4/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/959 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 149 (OVERLAPS) 18/977 variables, 9/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/977 variables, 2/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/977 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 152 (OVERLAPS) 2/979 variables, 1/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/979 variables, 2/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 154 (INCLUDED_ONLY) 0/979 variables, 0/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 155 (OVERLAPS) 1/980 variables, 1/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/980 variables, 1/680 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/980 variables, 0/680 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 158 (OVERLAPS) 5/985 variables, 4/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 159 (INCLUDED_ONLY) 0/985 variables, 2/686 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 160 (INCLUDED_ONLY) 0/985 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 161 (OVERLAPS) 0/985 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 985/985 variables, and 686 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1448 ms.
Refiners :[Positive P Invariants (semi-flows): 179/179 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 502/502 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/26 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/28 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 46/74 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 84/158 variables, 39/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 13/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 114/272 variables, 52/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 14/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 12:34:56] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/272 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/275 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/275 variables, 3/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/275 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/281 variables, 3/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/281 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/281 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 108/389 variables, 56/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/389 variables, 19/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/389 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/391 variables, 2/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/391 variables, 2/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/391 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 4/395 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/395 variables, 2/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/395 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 83/478 variables, 48/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/478 variables, 13/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/478 variables, 4/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/478 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 3/481 variables, 3/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/481 variables, 3/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/481 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 6/487 variables, 3/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/487 variables, 6/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/487 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 31/518 variables, 18/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/518 variables, 8/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 12:34:57] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/518 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/518 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 25/543 variables, 12/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/543 variables, 3/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/543 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 1/544 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/544 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/544 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 2/546 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/546 variables, 2/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/546 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 21/567 variables, 10/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/567 variables, 4/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/567 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 25/592 variables, 12/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/592 variables, 3/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/592 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 1/593 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/593 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/593 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 2/595 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/595 variables, 2/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/595 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 21/616 variables, 10/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/616 variables, 4/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/616 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 25/641 variables, 12/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/641 variables, 3/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/641 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 1/642 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/642 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/642 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 2/644 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/644 variables, 2/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/644 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 21/665 variables, 10/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/665 variables, 4/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/665 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 25/690 variables, 12/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/690 variables, 3/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/690 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 1/691 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/691 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/691 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 2/693 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/693 variables, 2/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/693 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (OVERLAPS) 21/714 variables, 10/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/714 variables, 4/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/714 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (OVERLAPS) 25/739 variables, 12/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/739 variables, 3/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/739 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (OVERLAPS) 1/740 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/740 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/740 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (OVERLAPS) 2/742 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/742 variables, 2/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/742 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (OVERLAPS) 21/763 variables, 10/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/763 variables, 4/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/763 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (OVERLAPS) 25/788 variables, 12/543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/788 variables, 3/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/788 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (OVERLAPS) 1/789 variables, 1/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/789 variables, 1/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/789 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (OVERLAPS) 2/791 variables, 1/549 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/791 variables, 2/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/791 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (OVERLAPS) 21/812 variables, 10/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/812 variables, 4/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/812 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (OVERLAPS) 25/837 variables, 12/577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/837 variables, 3/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/837 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (OVERLAPS) 1/838 variables, 1/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/838 variables, 1/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/838 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (OVERLAPS) 2/840 variables, 1/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/840 variables, 2/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/840 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (OVERLAPS) 21/861 variables, 10/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/861 variables, 4/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/861 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (OVERLAPS) 25/886 variables, 12/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/886 variables, 3/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/886 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (OVERLAPS) 1/887 variables, 1/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/887 variables, 1/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/887 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (OVERLAPS) 2/889 variables, 1/617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/889 variables, 2/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/889 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 137 (OVERLAPS) 21/910 variables, 10/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/910 variables, 4/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/910 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 140 (OVERLAPS) 25/935 variables, 12/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/935 variables, 3/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/935 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 143 (OVERLAPS) 1/936 variables, 1/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/936 variables, 1/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/936 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 146 (OVERLAPS) 2/938 variables, 1/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 147 (INCLUDED_ONLY) 0/938 variables, 2/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/938 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 149 (OVERLAPS) 21/959 variables, 10/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/959 variables, 4/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/959 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 152 (OVERLAPS) 18/977 variables, 9/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/977 variables, 2/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 154 (INCLUDED_ONLY) 0/977 variables, 0/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 155 (OVERLAPS) 2/979 variables, 1/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/979 variables, 2/681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/979 variables, 0/681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 158 (OVERLAPS) 1/980 variables, 1/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 159 (INCLUDED_ONLY) 0/980 variables, 1/683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 160 (INCLUDED_ONLY) 0/980 variables, 0/683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 161 (OVERLAPS) 5/985 variables, 4/687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 162 (INCLUDED_ONLY) 0/985 variables, 2/689 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 163 (INCLUDED_ONLY) 0/985 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 164 (OVERLAPS) 0/985 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 985/985 variables, and 689 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1130 ms.
Refiners :[Positive P Invariants (semi-flows): 179/179 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 502/502 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 2608ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 38 ms.
Support contains 4 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 483/483 transitions.
Applied a total of 0 rules in 11 ms. Remains 502 /502 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 502/502 places, 483/483 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 483/483 transitions.
Applied a total of 0 rules in 12 ms. Remains 502 /502 variables (removed 0) and now considering 483/483 (removed 0) transitions.
[2024-05-28 12:34:58] [INFO ] Invariant cache hit.
[2024-05-28 12:34:58] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-05-28 12:34:58] [INFO ] Invariant cache hit.
[2024-05-28 12:34:58] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 840 ms to find 0 implicit places.
[2024-05-28 12:34:58] [INFO ] Redundant transitions in 26 ms returned []
Running 481 sub problems to find dead transitions.
[2024-05-28 12:34:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 172/172 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 12:35:03] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-28 12:35:03] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-05-28 12:35:03] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
[2024-05-28 12:35:03] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-05-28 12:35:03] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-28 12:35:04] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-28 12:35:04] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-28 12:35:04] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-28 12:35:04] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-28 12:35:04] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-28 12:35:04] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-28 12:35:04] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:35:04] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:35:04] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-28 12:35:05] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-05-28 12:35:05] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-28 12:35:05] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
[2024-05-28 12:35:05] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-05-28 12:35:05] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-05-28 12:35:05] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/501 variables, 20/193 constraints. Problems are: Problem set: 0 solved, 481 unsolved
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :2.03579e+55 after 2.03579e+55
[2024-05-28 12:35:07] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:35:07] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:35:07] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-28 12:35:07] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 12:35:07] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 12:35:08] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-28 12:35:08] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:35:08] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-28 12:35:08] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:35:08] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 12:35:08] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 12:35:08] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:35:08] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-28 12:35:08] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-28 12:35:08] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-28 12:35:08] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 16/209 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 12:35:16] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (OVERLAPS) 1/502 variables, 7/217 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 12:35:26] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-28 12:35:26] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-28 12:35:26] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2024-05-28 12:35:26] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-28 12:35:26] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 1.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)timeout

(s151 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 502/985 variables, and 222 constraints, problems are : Problem set: 0 solved, 481 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 179/179 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/502 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 481 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 172/172 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/501 variables, 42/215 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 12:35:30] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 481 unsolved
SDD proceeding with computation,2 properties remain. new max is 524288
At refinement iteration 5 (OVERLAPS) 1/502 variables, 7/223 constraints. Problems are: Problem set: 0 solved, 481 unsolved
SDD size :2.03579e+55 after 2.03579e+55
[2024-05-28 12:35:39] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-28 12:35:39] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-28 12:35:39] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 12:35:43] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-28 12:35:43] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-28 12:35:43] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-28 12:35:43] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-05-28 12:35:43] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-28 12:35:43] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/502 variables, 6/232 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/502 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 9 (OVERLAPS) 483/985 variables, 502/734 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/985 variables, 481/1215 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 985/985 variables, and 1215 constraints, problems are : Problem set: 0 solved, 481 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 179/179 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 502/502 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 52/52 constraints]
After SMT, in 60241ms problems are : Problem set: 0 solved, 481 unsolved
Search for dead transitions found 0 dead transitions in 60267ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61157 ms. Remains : 502/502 places, 483/483 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-28 12:35:59] [INFO ] Flatten gal took : 54 ms
[2024-05-28 12:35:59] [INFO ] Applying decomposition
[2024-05-28 12:35:59] [INFO ] Flatten gal took : 48 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/graph10639966231473061009.txt' '-o' '/tmp/graph10639966231473061009.bin' '-w' '/tmp/graph10639966231473061009.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10639966231473061009.bin' '-l' '-1' '-v' '-w' '/tmp/graph10639966231473061009.weights' '-q' '0' '-e' '0.001'
[2024-05-28 12:35:59] [INFO ] Decomposing Gal with order
[2024-05-28 12:35:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 12:35:59] [INFO ] Removed a total of 460 redundant transitions.
[2024-05-28 12:35:59] [INFO ] Flatten gal took : 118 ms
[2024-05-28 12:35:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2024-05-28 12:35:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16433096788046523356.gal : 24 ms
[2024-05-28 12:35:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2389018817846893024.prop : 0 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/ReachabilityCardinality16433096788046523356.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2389018817846893024.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality2389018817846893024.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 47
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :47 after 2.16328e+29
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :8.0077e+55 after 3.06958e+56
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3.06958e+56 after 7.389e+56
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :7.389e+56 after 9.849e+56
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :9.849e+56 after 1.10315e+57
ITS-tools command line returned an error code 137
[2024-05-28 12:49:51] [INFO ] Flatten gal took : 26 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9359179381624119511
[2024-05-28 12:49:51] [INFO ] Applying decomposition
[2024-05-28 12:49:51] [INFO ] Computing symmetric may disable matrix : 483 transitions.
[2024-05-28 12:49:51] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 12:49:51] [INFO ] Computing symmetric may enable matrix : 483 transitions.
[2024-05-28 12:49:51] [INFO ] Flatten gal took : 25 ms
[2024-05-28 12:49:51] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph16454962755430529305.txt' '-o' '/tmp/graph16454962755430529305.bin' '-w' '/tmp/graph16454962755430529305.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16454962755430529305.bin' '-l' '-1' '-v' '-w' '/tmp/graph16454962755430529305.weights' '-q' '0' '-e' '0.001'
[2024-05-28 12:49:51] [INFO ] Decomposing Gal with order
[2024-05-28 12:49:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 12:49:51] [INFO ] Computing Do-Not-Accords matrix : 483 transitions.
[2024-05-28 12:49:51] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 12:49:52] [INFO ] Removed a total of 386 redundant transitions.
[2024-05-28 12:49:52] [INFO ] Built C files in 165ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9359179381624119511
Running compilation step : cd /tmp/ltsmin9359179381624119511;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' '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'
[2024-05-28 12:49:52] [INFO ] Flatten gal took : 43 ms
[2024-05-28 12:49:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 469 labels/synchronizations in 15 ms.
[2024-05-28 12:49:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18302763835788650967.gal : 6 ms
[2024-05-28 12:49:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9453669264941499707.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/ReachabilityCardinality18302763835788650967.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9453669264941499707.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality9453669264941499707.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2 after 820584
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :820584 after 5.03849e+13
Compilation finished in 1541 ms.
Running link step : cd /tmp/ltsmin9359179381624119511;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin9359179381624119511;'/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' 'ShieldIIPsPT020BReachabilityCardinality202312==true'
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :5.03849e+13 after 1.41428e+30
ITS-tools command line returned an error code 137
[2024-05-28 13:08:36] [INFO ] Applying decomposition
[2024-05-28 13:08:36] [INFO ] Flatten gal took : 102 ms
[2024-05-28 13:08:36] [INFO ] Decomposing Gal with order
[2024-05-28 13:08:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:08:36] [INFO ] Removed a total of 455 redundant transitions.
[2024-05-28 13:08:36] [INFO ] Flatten gal took : 115 ms
[2024-05-28 13:08:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 982 labels/synchronizations in 120 ms.
[2024-05-28 13:08:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17780004103804249806.gal : 32 ms
[2024-05-28 13:08:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15417648108211931802.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/ReachabilityCardinality17780004103804249806.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15417648108211931802.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/ReachabilityCardinality15417648108211931802.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :192 after 2.22366e+16
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.039: Initializing POR dependencies: labels 484, guards 483
pins2lts-mc-linux64( 1/ 8), 0.043: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.044: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.051: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.053: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.062: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.064: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.071: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 4.272: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 6/ 8), 5.301: "ShieldIIPsPT020BReachabilityCardinality202312==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 5.300: "ShieldIIPsPT020BReachabilityCardinality202312==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 5.302: "ShieldIIPsPT020BReachabilityCardinality202312==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 5.304: "ShieldIIPsPT020BReachabilityCardinality202312==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 5.302: "ShieldIIPsPT020BReachabilityCardinality202312==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 5.304: "ShieldIIPsPT020BReachabilityCardinality202312==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 5.303: "ShieldIIPsPT020BReachabilityCardinality202312==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 5.305: "ShieldIIPsPT020BReachabilityCardinality202312==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 5.306: There are 484 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 5.306: State length is 502, there are 483 groups
pins2lts-mc-linux64( 0/ 8), 5.306: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 5.306: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 5.306: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 5.306: Visible groups: 0 / 483, labels: 1 / 484
pins2lts-mc-linux64( 0/ 8), 5.306: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 5.306: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 5.325: ~8 levels ~960 states ~3168 transitions
pins2lts-mc-linux64( 0/ 8), 5.857: ~10 levels ~1920 states ~7096 transitions
pins2lts-mc-linux64( 0/ 8), 6.046: ~12 levels ~3840 states ~14600 transitions
pins2lts-mc-linux64( 0/ 8), 6.807: ~14 levels ~7680 states ~31176 transitions
pins2lts-mc-linux64( 0/ 8), 7.716: ~16 levels ~15360 states ~66472 transitions
pins2lts-mc-linux64( 2/ 8), 9.377: ~8 levels ~30720 states ~166216 transitions
pins2lts-mc-linux64( 2/ 8), 13.932: ~10 levels ~61440 states ~350296 transitions
pins2lts-mc-linux64( 3/ 8), 23.415: ~10 levels ~122880 states ~763320 transitions
pins2lts-mc-linux64( 0/ 8), 45.638: ~21 levels ~245760 states ~1370480 transitions
pins2lts-mc-linux64( 6/ 8), 76.747: ~14 levels ~491520 states ~3137064 transitions
pins2lts-mc-linux64( 6/ 8), 115.754: ~15 levels ~983040 states ~6675552 transitions
pins2lts-mc-linux64( 6/ 8), 164.744: ~16 levels ~1966080 states ~13939152 transitions
pins2lts-mc-linux64( 6/ 8), 252.736: ~17 levels ~3932160 states ~28568352 transitions
pins2lts-mc-linux64( 0/ 8), 434.226: ~27 levels ~7864320 states ~58750568 transitions
pins2lts-mc-linux64( 6/ 8), 764.214: ~20 levels ~15728640 states ~124587040 transitions
pins2lts-mc-linux64( 1/ 8), 1260.505: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1260.592:
pins2lts-mc-linux64( 0/ 8), 1260.592: mean standard work distribution: 7.3% (states) 2.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 1260.594:
pins2lts-mc-linux64( 0/ 8), 1260.594: Explored 24038707 states 208072985 transitions, fanout: 8.656
pins2lts-mc-linux64( 0/ 8), 1260.594: Total exploration time 1255.280 sec (1255.210 sec minimum, 1255.226 sec on average)
pins2lts-mc-linux64( 0/ 8), 1260.594: States per second: 19150, Transitions per second: 165758
pins2lts-mc-linux64( 0/ 8), 1260.594: Ignoring proviso: 14213137
pins2lts-mc-linux64( 0/ 8), 1260.594:
pins2lts-mc-linux64( 0/ 8), 1260.594: Queue width: 8B, total height: 20747494, memory: 158.29MB
pins2lts-mc-linux64( 0/ 8), 1260.594: Tree memory: 597.7MB, 14.0 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 1260.594: Tree fill ratio (roots/leafs): 33.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1260.594: Stored 486 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1260.595: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1260.595: Est. total memory use: 756.0MB (~1182.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9359179381624119511;'/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' 'ShieldIIPsPT020BReachabilityCardinality202312==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9359179381624119511;'/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' 'ShieldIIPsPT020BReachabilityCardinality202312==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
ITS-tools command line returned an error code 137
[2024-05-28 13:20:07] [INFO ] Flatten gal took : 60 ms
[2024-05-28 13:20:07] [INFO ] Input system was already deterministic with 483 transitions.
[2024-05-28 13:20:07] [INFO ] Transformed 502 places.
[2024-05-28 13:20:07] [INFO ] Transformed 483 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 13:20:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8738128868137285438.gal : 13 ms
[2024-05-28 13:20:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8916121287411353554.prop : 0 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/ReachabilityCardinality8738128868137285438.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8916121287411353554.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/ReachabilityCardinality8916121287411353554.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 44
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :44 after 64
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :64 after 440
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :440 after 1023
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1023 after 12195
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :12195 after 169170
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :169170 after 941831
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :941831 after 1.5248e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.5248e+06 after 2.68401e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.68401e+07 after 4.53111e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4.53111e+08 after 2.57425e+09
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.57425e+09 after 1.10521e+10
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.10521e+10 after 2.23714e+11
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :2.23714e+11 after 8.96484e+12
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :8.96484e+12 after 4.00401e+13
SDD proceeding with computation,1 properties remain. new max is 524288
SDD size :4.00401e+13 after 1.45334e+15
SDD proceeding with computation,1 properties remain. new max is 1048576
SDD size :1.45334e+15 after 3.86808e+16
SDD proceeding with computation,1 properties remain. new max is 2097152
SDD size :3.86808e+16 after 5.32072e+16
SDD proceeding with computation,1 properties remain. new max is 4194304
SDD size :5.32072e+16 after 1.46124e+20

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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ShieldIIPs-PT-020B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r356-tall-171683760400110"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-020B.tgz
mv ShieldIIPs-PT-020B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;