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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K 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.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 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 1.9M 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 ShieldPPPt-PT-100B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-2023-04
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717031434132

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-100B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-30 01:10:35] [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-30 01:10:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 01:10:35] [INFO ] Load time of PNML (sax parser for PT used): 323 ms
[2024-05-30 01:10:35] [INFO ] Transformed 7803 places.
[2024-05-30 01:10:36] [INFO ] Transformed 7103 transitions.
[2024-05-30 01:10:36] [INFO ] Found NUPN structural information;
[2024-05-30 01:10:36] [INFO ] Parsed PT model containing 7803 places and 7103 transitions and 17806 arcs in 799 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 3031 ms. (13 steps per ms) remains 10/15 properties
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 313 ms. (127 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 552 ms. (72 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 10/10 properties
[2024-05-30 01:10:37] [INFO ] Flatten gal took : 772 ms
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 149 ms. (266 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 111 ms. (357 steps per ms) remains 10/10 properties
[2024-05-30 01:10:37] [INFO ] Flatten gal took : 343 ms
// Phase 1: matrix 7103 rows 7803 cols
[2024-05-30 01:10:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4174590116512501990.gal : 86 ms
[2024-05-30 01:10:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15483333107438723081.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4174590116512501990.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15483333107438723081.prop' '--nowitness' '--gen-order' 'FOLLOW'
[2024-05-30 01:10:38] [INFO ] Computed 1101 invariants in 171 ms

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 ...329
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Loading property file /tmp/ReachabilityCardinality15483333107438723081.prop.
At refinement iteration 2 (OVERLAPS) 1218/1297 variables, 139/218 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1297 variables, 1218/1436 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1297 variables, 0/1436 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 6506/7803 variables, 962/2398 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7803 variables, 6506/8904 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7803 variables, 0/8904 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SMT process timed out in 5445ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 79 out of 7803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7803/7803 places, 7103/7103 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1850 transitions
Trivial Post-agglo rules discarded 1850 transitions
Performed 1850 trivial Post agglomeration. Transition count delta: 1850
Iterating post reduction 0 with 1850 rules applied. Total rules applied 1850 place count 7803 transition count 5253
Reduce places removed 1850 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 1 with 1870 rules applied. Total rules applied 3720 place count 5953 transition count 5233
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 3740 place count 5933 transition count 5233
Performed 405 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 405 Pre rules applied. Total rules applied 3740 place count 5933 transition count 4828
Deduced a syphon composed of 405 places in 22 ms
Reduce places removed 405 places and 0 transitions.
Iterating global reduction 3 with 810 rules applied. Total rules applied 4550 place count 5528 transition count 4828
Discarding 682 places :
Symmetric choice reduction at 3 with 682 rule applications. Total rules 5232 place count 4846 transition count 4146
Iterating global reduction 3 with 682 rules applied. Total rules applied 5914 place count 4846 transition count 4146
Performed 287 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 287 Pre rules applied. Total rules applied 5914 place count 4846 transition count 3859
Deduced a syphon composed of 287 places in 54 ms
Reduce places removed 287 places and 0 transitions.
Iterating global reduction 3 with 574 rules applied. Total rules applied 6488 place count 4559 transition count 3859
Performed 1663 Post agglomeration using F-continuation condition.Transition count delta: 1663
Deduced a syphon composed of 1663 places in 28 ms
Reduce places removed 1663 places and 0 transitions.
Iterating global reduction 3 with 3326 rules applied. Total rules applied 9814 place count 2896 transition count 2196
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 10 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 10016 place count 2795 transition count 2196
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 7 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 10218 place count 2694 transition count 2196
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 4 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 10396 place count 2605 transition count 2196
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 10400 place count 2605 transition count 2192
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 10404 place count 2601 transition count 2192
Partial Free-agglomeration rule applied 287 times.
Drop transitions (Partial Free agglomeration) removed 287 transitions
Iterating global reduction 4 with 287 rules applied. Total rules applied 10691 place count 2601 transition count 2192
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 10692 place count 2600 transition count 2191
Applied a total of 10692 rules in 4670 ms. Remains 2600 /7803 variables (removed 5203) and now considering 2191/7103 (removed 4912) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4680 ms. Remains : 2600/7803 places, 2191/7103 transitions.
RANDOM walk for 40000 steps (8 resets) in 1687 ms. (23 steps per ms) remains 8/10 properties
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 771 ms. (51 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 726 ms. (55 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 843 ms. (47 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 838 ms. (47 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 725 ms. (55 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 650 ms. (61 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 742 ms. (53 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 707 ms. (56 steps per ms) remains 8/8 properties
// Phase 1: matrix 2191 rows 2600 cols
[2024-05-30 01:10:50] [INFO ] Computed 1101 invariants in 8 ms
[2024-05-30 01:10:50] [INFO ] State equation strengthened by 51 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 309/377 variables, 123/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 111/488 variables, 50/173 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/488 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 577/1065 variables, 488/661 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1065 variables, 39/700 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1065 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 774/1839 variables, 420/1120 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1839 variables, 162/1282 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1839 variables, 8/1290 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1839 variables, 0/1290 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 33/1872 variables, 34/1324 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1872 variables, 31/1355 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1872 variables, 0/1355 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 57/1929 variables, 28/1383 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1929 variables, 0/1383 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 904/2833 variables, 494/1877 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2833 variables, 141/2018 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2833 variables, 1/2019 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2833 variables, 0/2019 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 59/2892 variables, 63/2082 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2892 variables, 57/2139 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2892 variables, 0/2139 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (OVERLAPS) 106/2998 variables, 53/2192 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2998 variables, 0/2192 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (OVERLAPS) 653/3651 variables, 441/2633 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3651 variables, 126/2759 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3651 variables, 0/2759 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (OVERLAPS) 25/3676 variables, 33/2792 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3676 variables, 23/2815 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/3676 variables, 0/2815 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (OVERLAPS) 43/3719 variables, 20/2835 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/3719 variables, 0/2835 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 34 (OVERLAPS) 381/4100 variables, 238/3073 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/4100 variables, 63/3136 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/4100 variables, 3/3139 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/4100 variables, 0/3139 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 38 (OVERLAPS) 17/4117 variables, 30/3169 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/4117 variables, 17/3186 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/4117 variables, 0/3186 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 41 (OVERLAPS) 8/4125 variables, 4/3190 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/4125 variables, 0/3190 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 43 (OVERLAPS) 196/4321 variables, 121/3311 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/4321 variables, 44/3355 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/4321 variables, 0/3355 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 46 (OVERLAPS) 5/4326 variables, 10/3365 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/4326 variables, 5/3370 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/4326 variables, 0/3370 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 49 (OVERLAPS) 139/4465 variables, 73/3443 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/4465 variables, 19/3462 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/4465 variables, 0/3462 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 52 (OVERLAPS) 10/4475 variables, 16/3478 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/4475 variables, 10/3488 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/4475 variables, 0/3488 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 55 (OVERLAPS) 8/4483 variables, 4/3492 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/4483 variables, 0/3492 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 57 (OVERLAPS) 79/4562 variables, 52/3544 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/4562 variables, 21/3565 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/4562 variables, 0/3565 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 60 (OVERLAPS) 80/4642 variables, 42/3607 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/4642 variables, 9/3616 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/4642 variables, 0/3616 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 63 (OVERLAPS) 6/4648 variables, 11/3627 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/4648 variables, 6/3633 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/4648 variables, 0/3633 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 66 (OVERLAPS) 2/4650 variables, 1/3634 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/4650 variables, 0/3634 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 68 (OVERLAPS) 26/4676 variables, 18/3652 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/4676 variables, 8/3660 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/4676 variables, 0/3660 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 71 (OVERLAPS) 29/4705 variables, 15/3675 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/4705 variables, 3/3678 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/4705 variables, 0/3678 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 74 (OVERLAPS) 2/4707 variables, 4/3682 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/4707 variables, 2/3684 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/4707 variables, 0/3684 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 77 (OVERLAPS) 15/4722 variables, 8/3692 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/4722 variables, 4/3696 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/4722 variables, 0/3696 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 80 (OVERLAPS) 29/4751 variables, 15/3711 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/4751 variables, 3/3714 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/4751 variables, 0/3714 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 83 (OVERLAPS) 2/4753 variables, 4/3718 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/4753 variables, 2/3720 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/4753 variables, 0/3720 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 86 (OVERLAPS) 15/4768 variables, 8/3728 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/4768 variables, 3/3731 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/4768 variables, 0/3731 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 89 (OVERLAPS) 1/4769 variables, 1/3732 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/4769 variables, 1/3733 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/4769 variables, 0/3733 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 92 (OVERLAPS) 19/4788 variables, 10/3743 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/4788 variables, 3/3746 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/4788 variables, 0/3746 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 95 (OVERLAPS) 1/4789 variables, 2/3748 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/4789 variables, 1/3749 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/4789 variables, 0/3749 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 98 (OVERLAPS) 2/4791 variables, 2/3751 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/4791 variables, 1/3752 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/4791 variables, 0/3752 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 101 (OVERLAPS) 0/4791 variables, 0/3752 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4791/4791 variables, and 3752 constraints, problems are : Problem set: 0 solved, 8 unsolved in 18651 ms.
Refiners :[Positive P Invariants (semi-flows): 1101/1101 constraints, State Equation: 2600/2600 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 309/377 variables, 123/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 01:11:10] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 7 ms to minimize.
[2024-05-30 01:11:10] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/377 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 111/488 variables, 50/175 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 01:11:10] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 577/1065 variables, 488/664 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1065 variables, 39/703 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 01:11:10] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1065 variables, 1/704 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1065 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 774/1839 variables, 420/1124 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1839 variables, 162/1286 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1839 variables, 8/1294 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1839 variables, 8/1302 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 01:11:11] [INFO ] Deduced a trap composed of 3 places in 211 ms of which 4 ms to minimize.
[2024-05-30 01:11:11] [INFO ] Deduced a trap composed of 3 places in 180 ms of which 12 ms to minimize.
[2024-05-30 01:11:12] [INFO ] Deduced a trap composed of 6 places in 179 ms of which 3 ms to minimize.
[2024-05-30 01:11:12] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 3 ms to minimize.
[2024-05-30 01:11:12] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 3 ms to minimize.
[2024-05-30 01:11:12] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 3 ms to minimize.
[2024-05-30 01:11:12] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 2 ms to minimize.
[2024-05-30 01:11:13] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1839 variables, 8/1310 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1839 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 33/1872 variables, 34/1344 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1872 variables, 31/1375 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 01:11:13] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1872 variables, 1/1376 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1872 variables, 0/1376 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 57/1929 variables, 28/1404 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 01:11:14] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1929 variables, 1/1405 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 01:11:15] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 3 ms to minimize.
[2024-05-30 01:11:15] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1929 variables, 2/1407 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1929 variables, 0/1407 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (OVERLAPS) 904/2833 variables, 494/1901 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2833 variables, 141/2042 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2833 variables, 1/2043 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 01:11:16] [INFO ] Deduced a trap composed of 5 places in 201 ms of which 4 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/2833 variables, 1/2044 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2833 variables, 0/2044 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (OVERLAPS) 59/2892 variables, 63/2107 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2892 variables, 57/2164 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2892 variables, 0/2164 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (OVERLAPS) 106/2998 variables, 53/2217 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 01:11:18] [INFO ] Deduced a trap composed of 6 places in 227 ms of which 5 ms to minimize.
[2024-05-30 01:11:18] [INFO ] Deduced a trap composed of 5 places in 214 ms of which 4 ms to minimize.
[2024-05-30 01:11:18] [INFO ] Deduced a trap composed of 6 places in 225 ms of which 4 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :19 after 36
[2024-05-30 01:11:19] [INFO ] Deduced a trap composed of 5 places in 246 ms of which 5 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :69 after 118
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :118 after 5935
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :5935 after 9.17035e+07
At refinement iteration 34 (INCLUDED_ONLY) 0/2998 variables, 4/2221 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :9.17035e+07 after 4.01557e+14
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :4.01557e+14 after 4.83162e+30
At refinement iteration 35 (INCLUDED_ONLY) 0/2998 variables, 0/2221 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :4.83162e+30 after 6.79827e+72
At refinement iteration 36 (OVERLAPS) 653/3651 variables, 441/2662 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/3651 variables, 126/2788 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 01:11:21] [INFO ] Deduced a trap composed of 6 places in 262 ms of which 5 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/3651 variables, 1/2789 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 01:11:21] [INFO ] Deduced a trap composed of 6 places in 270 ms of which 5 ms to minimize.
[2024-05-30 01:11:22] [INFO ] Deduced a trap composed of 4 places in 267 ms of which 5 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/3651 variables, 2/2791 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/3651 variables, 0/2791 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 41 (OVERLAPS) 25/3676 variables, 33/2824 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/3676 variables, 23/2847 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/3676 variables, 0/2847 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 44 (OVERLAPS) 43/3719 variables, 20/2867 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/3719 variables, 0/2867 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 46 (OVERLAPS) 381/4100 variables, 238/3105 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/4100 variables, 63/3168 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/4100 variables, 3/3171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 01:11:25] [INFO ] Deduced a trap composed of 6 places in 310 ms of which 6 ms to minimize.
At refinement iteration 49 (INCLUDED_ONLY) 0/4100 variables, 1/3172 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 01:11:26] [INFO ] Deduced a trap composed of 6 places in 314 ms of which 5 ms to minimize.
At refinement iteration 50 (INCLUDED_ONLY) 0/4100 variables, 1/3173 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/4100 variables, 0/3173 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 52 (OVERLAPS) 17/4117 variables, 30/3203 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/4117 variables, 17/3220 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/4117 variables, 0/3220 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 55 (OVERLAPS) 8/4125 variables, 4/3224 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/4125 variables, 0/3224 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 57 (OVERLAPS) 196/4321 variables, 121/3345 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/4321 variables, 44/3389 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/4321 variables, 0/3389 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 60 (OVERLAPS) 5/4326 variables, 10/3399 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/4326 variables, 5/3404 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/4326 variables, 0/3404 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 63 (OVERLAPS) 139/4465 variables, 73/3477 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/4465 variables, 19/3496 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/4465 variables, 0/3496 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 66 (OVERLAPS) 10/4475 variables, 16/3512 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/4475 variables, 10/3522 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/4475 variables, 0/3522 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 69 (OVERLAPS) 8/4483 variables, 4/3526 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/4483 variables, 0/3526 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 71 (OVERLAPS) 79/4562 variables, 52/3578 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/4562 variables, 21/3599 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/4562 variables, 0/3599 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 74 (OVERLAPS) 80/4642 variables, 42/3641 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/4642 variables, 9/3650 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/4642 variables, 0/3650 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 77 (OVERLAPS) 6/4648 variables, 11/3661 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/4648 variables, 6/3667 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/4648 variables, 0/3667 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 80 (OVERLAPS) 2/4650 variables, 1/3668 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/4650 variables, 0/3668 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 82 (OVERLAPS) 26/4676 variables, 18/3686 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/4676 variables, 8/3694 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/4676 variables, 0/3694 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 85 (OVERLAPS) 29/4705 variables, 15/3709 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/4705 variables, 3/3712 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/4705 variables, 0/3712 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 88 (OVERLAPS) 2/4707 variables, 4/3716 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/4707 variables, 2/3718 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/4707 variables, 0/3718 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 91 (OVERLAPS) 15/4722 variables, 8/3726 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/4722 variables, 4/3730 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/4722 variables, 0/3730 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 94 (OVERLAPS) 29/4751 variables, 15/3745 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/4751 variables, 3/3748 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/4751 variables, 0/3748 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 97 (OVERLAPS) 2/4753 variables, 4/3752 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/4753 variables, 2/3754 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/4753 variables, 0/3754 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 100 (OVERLAPS) 15/4768 variables, 8/3762 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/4768 variables, 3/3765 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/4768 variables, 0/3765 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 103 (OVERLAPS) 1/4769 variables, 1/3766 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/4769 variables, 1/3767 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/4769 variables, 0/3767 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 106 (OVERLAPS) 19/4788 variables, 10/3777 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/4788 variables, 3/3780 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/4788 variables, 0/3780 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 109 (OVERLAPS) 1/4789 variables, 2/3782 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/4789 variables, 1/3783 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/4789 variables, 0/3783 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 112 (OVERLAPS) 2/4791 variables, 2/3785 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/4791 variables, 1/3786 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/4791 variables, 0/3786 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 115 (OVERLAPS) 0/4791 variables, 0/3786 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4791/4791 variables, and 3786 constraints, problems are : Problem set: 0 solved, 8 unsolved in 37379 ms.
Refiners :[Positive P Invariants (semi-flows): 1101/1101 constraints, State Equation: 2600/2600 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 26/26 constraints]
After SMT, in 56169ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 17668 ms.
Support contains 68 out of 2600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2600/2600 places, 2191/2191 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 2600 transition count 2188
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 2597 transition count 2187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 2596 transition count 2187
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 8 place count 2596 transition count 2186
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 2595 transition count 2186
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 6 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 13 rules applied. Total rules applied 23 place count 2588 transition count 2180
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 25 place count 2588 transition count 2178
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 25 place count 2588 transition count 2176
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 29 place count 2586 transition count 2176
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 31 place count 2585 transition count 2176
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 32 place count 2585 transition count 2176
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 35 place count 2582 transition count 2173
Applied a total of 35 rules in 578 ms. Remains 2582 /2600 variables (removed 18) and now considering 2173/2191 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 578 ms. Remains : 2582/2600 places, 2173/2191 transitions.
RANDOM walk for 40000 steps (8 resets) in 1008 ms. (39 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 770 ms. (51 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 752 ms. (53 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 632 ms. (63 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 595 ms. (67 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 607 ms. (65 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 557 ms. (71 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 568 ms. (70 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 583 ms. (68 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 71898 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 8
Probabilistic random walk after 71898 steps, saw 65077 distinct states, run finished after 3005 ms. (steps per millisecond=23 ) properties seen :0
// Phase 1: matrix 2173 rows 2582 cols
[2024-05-30 01:12:10] [INFO ] Computed 1100 invariants in 14 ms
[2024-05-30 01:12:10] [INFO ] State equation strengthened by 49 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 306/374 variables, 123/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/374 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 111/485 variables, 50/173 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/485 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 575/1060 variables, 485/658 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1060 variables, 39/697 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1060 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 773/1833 variables, 422/1119 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1833 variables, 165/1284 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1833 variables, 8/1292 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1833 variables, 0/1292 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 28/1861 variables, 31/1323 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1861 variables, 28/1351 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1861 variables, 0/1351 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 50/1911 variables, 25/1376 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1911 variables, 0/1376 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 903/2814 variables, 487/1863 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2814 variables, 141/2004 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2814 variables, 0/2004 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 59/2873 variables, 64/2068 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2873 variables, 59/2127 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2873 variables, 0/2127 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 108/2981 variables, 54/2181 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2981 variables, 0/2181 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (OVERLAPS) 650/3631 variables, 441/2622 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3631 variables, 129/2751 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3631 variables, 0/2751 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (OVERLAPS) 21/3652 variables, 31/2782 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3652 variables, 21/2803 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3652 variables, 0/2803 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (OVERLAPS) 22/3674 variables, 11/2814 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/3674 variables, 0/2814 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (OVERLAPS) 371/4045 variables, 219/3033 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/4045 variables, 63/3096 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/4045 variables, 0/3096 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (OVERLAPS) 19/4064 variables, 32/3128 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/4064 variables, 19/3147 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/4064 variables, 0/3147 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 39 (OVERLAPS) 12/4076 variables, 6/3153 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/4076 variables, 0/3153 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 41 (OVERLAPS) 201/4277 variables, 125/3278 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/4277 variables, 44/3322 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/4277 variables, 0/3322 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 44 (OVERLAPS) 5/4282 variables, 10/3332 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/4282 variables, 5/3337 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/4282 variables, 0/3337 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 47 (OVERLAPS) 140/4422 variables, 75/3412 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/4422 variables, 20/3432 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/4422 variables, 0/3432 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 50 (OVERLAPS) 10/4432 variables, 16/3448 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/4432 variables, 10/3458 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/4432 variables, 0/3458 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 53 (OVERLAPS) 8/4440 variables, 4/3462 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/4440 variables, 0/3462 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 55 (OVERLAPS) 80/4520 variables, 50/3512 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/4520 variables, 20/3532 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/4520 variables, 0/3532 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 58 (OVERLAPS) 96/4616 variables, 52/3584 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/4616 variables, 12/3596 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/4616 variables, 0/3596 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 61 (OVERLAPS) 7/4623 variables, 13/3609 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/4623 variables, 7/3616 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/4623 variables, 0/3616 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 64 (OVERLAPS) 2/4625 variables, 1/3617 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/4625 variables, 0/3617 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 66 (OVERLAPS) 26/4651 variables, 18/3635 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/4651 variables, 8/3643 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/4651 variables, 0/3643 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 69 (OVERLAPS) 29/4680 variables, 15/3658 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/4680 variables, 3/3661 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/4680 variables, 0/3661 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 72 (OVERLAPS) 2/4682 variables, 4/3665 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/4682 variables, 2/3667 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/4682 variables, 0/3667 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 75 (OVERLAPS) 15/4697 variables, 8/3675 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/4697 variables, 4/3679 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/4697 variables, 1/3680 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/4697 variables, 0/3680 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 79 (OVERLAPS) 26/4723 variables, 14/3694 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/4723 variables, 3/3697 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/4723 variables, 0/3697 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 82 (OVERLAPS) 2/4725 variables, 4/3701 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/4725 variables, 2/3703 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/4725 variables, 0/3703 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 85 (OVERLAPS) 10/4735 variables, 6/3709 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/4735 variables, 3/3712 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/4735 variables, 0/3712 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 88 (OVERLAPS) 16/4751 variables, 8/3720 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/4751 variables, 3/3723 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/4751 variables, 1/3724 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/4751 variables, 0/3724 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 92 (OVERLAPS) 1/4752 variables, 1/3725 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/4752 variables, 1/3726 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/4752 variables, 0/3726 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 95 (OVERLAPS) 1/4753 variables, 1/3727 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/4753 variables, 1/3728 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/4753 variables, 0/3728 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 98 (OVERLAPS) 2/4755 variables, 2/3730 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/4755 variables, 1/3731 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/4755 variables, 0/3731 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 101 (OVERLAPS) 0/4755 variables, 0/3731 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4755/4755 variables, and 3731 constraints, problems are : Problem set: 0 solved, 8 unsolved in 17408 ms.
Refiners :[Positive P Invariants (semi-flows): 1100/1100 constraints, State Equation: 2582/2582 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 306/374 variables, 123/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 01:12:27] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/374 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/374 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 111/485 variables, 50/174 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 01:12:27] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:12:27] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:12:28] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/485 variables, 3/177 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 575/1060 variables, 485/662 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1060 variables, 39/701 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 01:12:28] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 1 ms to minimize.
[2024-05-30 01:12:28] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1060 variables, 2/703 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1060 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 773/1833 variables, 422/1125 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1833 variables, 165/1290 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1833 variables, 8/1298 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1833 variables, 8/1306 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 01:12:29] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 3 ms to minimize.
[2024-05-30 01:12:29] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 7 ms to minimize.
[2024-05-30 01:12:29] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 4 ms to minimize.
[2024-05-30 01:12:29] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 3 ms to minimize.
[2024-05-30 01:12:29] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 3 ms to minimize.
[2024-05-30 01:12:30] [INFO ] Deduced a trap composed of 3 places in 159 ms of which 3 ms to minimize.
[2024-05-30 01:12:30] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 3 ms to minimize.
[2024-05-30 01:12:30] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 4 ms to minimize.
[2024-05-30 01:12:30] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 3 ms to minimize.
[2024-05-30 01:12:30] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 3 ms to minimize.
[2024-05-30 01:12:31] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 3 ms to minimize.
[2024-05-30 01:12:31] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 2 ms to minimize.
[2024-05-30 01:12:31] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1833 variables, 13/1319 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 01:12:31] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1833 variables, 1/1320 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1833 variables, 0/1320 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 28/1861 variables, 31/1351 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1861 variables, 28/1379 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 01:12:32] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 2 ms to minimize.
[2024-05-30 01:12:32] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1861 variables, 2/1381 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 01:12:33] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1861 variables, 1/1382 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 01:12:33] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1861 variables, 1/1383 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1861 variables, 0/1383 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (OVERLAPS) 50/1911 variables, 25/1408 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1911 variables, 0/1408 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (OVERLAPS) 903/2814 variables, 487/1895 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2814 variables, 141/2036 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 01:12:35] [INFO ] Deduced a trap composed of 6 places in 187 ms of which 4 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/2814 variables, 1/2037 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2814 variables, 0/2037 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (OVERLAPS) 59/2873 variables, 64/2101 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2873 variables, 59/2160 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2873 variables, 0/2160 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (OVERLAPS) 108/2981 variables, 54/2214 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 01:12:36] [INFO ] Deduced a trap composed of 6 places in 216 ms of which 4 ms to minimize.
[2024-05-30 01:12:37] [INFO ] Deduced a trap composed of 5 places in 213 ms of which 4 ms to minimize.
[2024-05-30 01:12:37] [INFO ] Deduced a trap composed of 6 places in 212 ms of which 4 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/2981 variables, 3/2217 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2981 variables, 0/2217 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (OVERLAPS) 650/3631 variables, 441/2658 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/3631 variables, 129/2787 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 01:12:39] [INFO ] Deduced a trap composed of 5 places in 245 ms of which 4 ms to minimize.
[2024-05-30 01:12:39] [INFO ] Deduced a trap composed of 7 places in 246 ms of which 12 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/3631 variables, 2/2789 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/3631 variables, 0/2789 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 40 (OVERLAPS) 21/3652 variables, 31/2820 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/3652 variables, 21/2841 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 01:12:41] [INFO ] Deduced a trap composed of 6 places in 237 ms of which 5 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/3652 variables, 1/2842 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/3652 variables, 0/2842 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 44 (OVERLAPS) 22/3674 variables, 11/2853 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/3674 variables, 0/2853 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 46 (OVERLAPS) 371/4045 variables, 219/3072 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/4045 variables, 63/3135 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 01:12:43] [INFO ] Deduced a trap composed of 5 places in 241 ms of which 4 ms to minimize.
At refinement iteration 48 (INCLUDED_ONLY) 0/4045 variables, 1/3136 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/4045 variables, 0/3136 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 50 (OVERLAPS) 19/4064 variables, 32/3168 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/4064 variables, 19/3187 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/4064 variables, 0/3187 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 53 (OVERLAPS) 12/4076 variables, 6/3193 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 01:12:45] [INFO ] Deduced a trap composed of 6 places in 247 ms of which 4 ms to minimize.
At refinement iteration 54 (INCLUDED_ONLY) 0/4076 variables, 1/3194 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/4076 variables, 0/3194 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 56 (OVERLAPS) 201/4277 variables, 125/3319 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/4277 variables, 44/3363 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/4277 variables, 0/3363 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 59 (OVERLAPS) 5/4282 variables, 10/3373 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/4282 variables, 5/3378 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/4282 variables, 0/3378 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 62 (OVERLAPS) 140/4422 variables, 75/3453 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/4422 variables, 20/3473 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/4422 variables, 0/3473 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 65 (OVERLAPS) 10/4432 variables, 16/3489 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/4432 variables, 10/3499 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/4432 variables, 0/3499 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 68 (OVERLAPS) 8/4440 variables, 4/3503 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/4440 variables, 0/3503 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 70 (OVERLAPS) 80/4520 variables, 50/3553 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/4520 variables, 20/3573 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/4520 variables, 0/3573 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 73 (OVERLAPS) 96/4616 variables, 52/3625 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/4616 variables, 12/3637 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/4616 variables, 0/3637 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 76 (OVERLAPS) 7/4623 variables, 13/3650 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/4623 variables, 7/3657 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/4623 variables, 0/3657 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 79 (OVERLAPS) 2/4625 variables, 1/3658 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/4625 variables, 0/3658 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 81 (OVERLAPS) 26/4651 variables, 18/3676 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/4651 variables, 8/3684 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/4651 variables, 0/3684 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 84 (OVERLAPS) 29/4680 variables, 15/3699 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/4680 variables, 3/3702 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/4680 variables, 0/3702 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 87 (OVERLAPS) 2/4682 variables, 4/3706 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/4682 variables, 2/3708 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/4682 variables, 0/3708 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 90 (OVERLAPS) 15/4697 variables, 8/3716 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/4697 variables, 4/3720 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/4697 variables, 1/3721 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/4697 variables, 0/3721 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 94 (OVERLAPS) 26/4723 variables, 14/3735 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/4723 variables, 3/3738 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/4723 variables, 0/3738 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 97 (OVERLAPS) 2/4725 variables, 4/3742 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/4725 variables, 2/3744 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/4725 variables, 0/3744 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 100 (OVERLAPS) 10/4735 variables, 6/3750 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/4735 variables, 3/3753 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 01:13:01] [INFO ] Deduced a trap composed of 5 places in 310 ms of which 6 ms to minimize.
At refinement iteration 102 (INCLUDED_ONLY) 0/4735 variables, 1/3754 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/4735 variables, 0/3754 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 104 (OVERLAPS) 16/4751 variables, 8/3762 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/4751 variables, 3/3765 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/4751 variables, 1/3766 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/4751 variables, 0/3766 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 108 (OVERLAPS) 1/4752 variables, 1/3767 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/4752 variables, 1/3768 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/4752 variables, 0/3768 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 111 (OVERLAPS) 1/4753 variables, 1/3769 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/4753 variables, 1/3770 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/4753 variables, 0/3770 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 114 (OVERLAPS) 2/4755 variables, 2/3772 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/4755 variables, 1/3773 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/4755 variables, 0/3773 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 117 (OVERLAPS) 0/4755 variables, 0/3773 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4755/4755 variables, and 3773 constraints, problems are : Problem set: 0 solved, 8 unsolved in 40064 ms.
Refiners :[Positive P Invariants (semi-flows): 1100/1100 constraints, State Equation: 2582/2582 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 34/34 constraints]
After SMT, in 57553ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 12834 ms.
Support contains 68 out of 2582 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2582/2582 places, 2173/2173 transitions.
Applied a total of 0 rules in 105 ms. Remains 2582 /2582 variables (removed 0) and now considering 2173/2173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 2582/2582 places, 2173/2173 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2582/2582 places, 2173/2173 transitions.
Applied a total of 0 rules in 102 ms. Remains 2582 /2582 variables (removed 0) and now considering 2173/2173 (removed 0) transitions.
[2024-05-30 01:13:20] [INFO ] Invariant cache hit.
[2024-05-30 01:13:22] [INFO ] Implicit Places using invariants in 1561 ms returned [2565, 2569]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1571 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2580/2582 places, 2173/2173 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2578 transition count 2171
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2578 transition count 2171
Applied a total of 4 rules in 189 ms. Remains 2578 /2580 variables (removed 2) and now considering 2171/2173 (removed 2) transitions.
// Phase 1: matrix 2171 rows 2578 cols
[2024-05-30 01:13:22] [INFO ] Computed 1098 invariants in 14 ms
[2024-05-30 01:13:23] [INFO ] Implicit Places using invariants in 1531 ms returned []
[2024-05-30 01:13:23] [INFO ] Invariant cache hit.
[2024-05-30 01:13:25] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-30 01:13:28] [INFO ] Implicit Places using invariants and state equation in 4621 ms returned []
Implicit Place search using SMT with State Equation took 6156 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2578/2582 places, 2171/2173 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 8020 ms. Remains : 2578/2582 places, 2171/2173 transitions.
RANDOM walk for 40000 steps (8 resets) in 808 ms. (49 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 588 ms. (67 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 583 ms. (68 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 643 ms. (62 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 565 ms. (70 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 631 ms. (63 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 547 ms. (73 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 549 ms. (72 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 552 ms. (72 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 65359 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 8
Probabilistic random walk after 65359 steps, saw 59786 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
[2024-05-30 01:13:33] [INFO ] Invariant cache hit.
[2024-05-30 01:13:33] [INFO ] State equation strengthened by 47 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 306/374 variables, 123/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/374 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 111/485 variables, 50/173 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/485 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 575/1060 variables, 485/658 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1060 variables, 39/697 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1060 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 773/1833 variables, 422/1119 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1833 variables, 165/1284 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1833 variables, 8/1292 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1833 variables, 0/1292 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 28/1861 variables, 31/1323 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1861 variables, 28/1351 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1861 variables, 0/1351 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 50/1911 variables, 25/1376 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1911 variables, 0/1376 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 903/2814 variables, 487/1863 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2814 variables, 141/2004 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2814 variables, 0/2004 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 59/2873 variables, 64/2068 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2873 variables, 59/2127 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2873 variables, 0/2127 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 108/2981 variables, 54/2181 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2981 variables, 0/2181 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (OVERLAPS) 650/3631 variables, 441/2622 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3631 variables, 129/2751 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3631 variables, 0/2751 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (OVERLAPS) 21/3652 variables, 31/2782 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3652 variables, 21/2803 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3652 variables, 0/2803 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (OVERLAPS) 22/3674 variables, 11/2814 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/3674 variables, 0/2814 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (OVERLAPS) 371/4045 variables, 219/3033 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/4045 variables, 63/3096 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/4045 variables, 0/3096 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (OVERLAPS) 19/4064 variables, 32/3128 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/4064 variables, 19/3147 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/4064 variables, 0/3147 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 39 (OVERLAPS) 12/4076 variables, 6/3153 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/4076 variables, 0/3153 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 41 (OVERLAPS) 201/4277 variables, 125/3278 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/4277 variables, 44/3322 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/4277 variables, 0/3322 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 44 (OVERLAPS) 5/4282 variables, 10/3332 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/4282 variables, 5/3337 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/4282 variables, 0/3337 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 47 (OVERLAPS) 140/4422 variables, 75/3412 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/4422 variables, 20/3432 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/4422 variables, 0/3432 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 50 (OVERLAPS) 10/4432 variables, 16/3448 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/4432 variables, 10/3458 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/4432 variables, 0/3458 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 53 (OVERLAPS) 8/4440 variables, 4/3462 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/4440 variables, 0/3462 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 55 (OVERLAPS) 80/4520 variables, 50/3512 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/4520 variables, 20/3532 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/4520 variables, 0/3532 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 58 (OVERLAPS) 96/4616 variables, 52/3584 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/4616 variables, 12/3596 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/4616 variables, 0/3596 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 61 (OVERLAPS) 7/4623 variables, 13/3609 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/4623 variables, 7/3616 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/4623 variables, 0/3616 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 64 (OVERLAPS) 2/4625 variables, 1/3617 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/4625 variables, 0/3617 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 66 (OVERLAPS) 26/4651 variables, 18/3635 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/4651 variables, 8/3643 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/4651 variables, 0/3643 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 69 (OVERLAPS) 29/4680 variables, 15/3658 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/4680 variables, 3/3661 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/4680 variables, 0/3661 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 72 (OVERLAPS) 2/4682 variables, 4/3665 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/4682 variables, 2/3667 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/4682 variables, 0/3667 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 75 (OVERLAPS) 14/4696 variables, 8/3675 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/4696 variables, 4/3679 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/4696 variables, 0/3679 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 78 (OVERLAPS) 24/4720 variables, 12/3691 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/4720 variables, 2/3693 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/4720 variables, 0/3693 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 81 (OVERLAPS) 2/4722 variables, 4/3697 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/4722 variables, 2/3699 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/4722 variables, 0/3699 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 84 (OVERLAPS) 10/4732 variables, 6/3705 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/4732 variables, 3/3708 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/4732 variables, 0/3708 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 87 (OVERLAPS) 15/4747 variables, 8/3716 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/4747 variables, 4/3720 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/4747 variables, 0/3720 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 90 (OVERLAPS) 2/4749 variables, 2/3722 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/4749 variables, 1/3723 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/4749 variables, 0/3723 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 93 (OVERLAPS) 0/4749 variables, 0/3723 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4749/4749 variables, and 3723 constraints, problems are : Problem set: 0 solved, 8 unsolved in 17351 ms.
Refiners :[Positive P Invariants (semi-flows): 1098/1098 constraints, State Equation: 2578/2578 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 306/374 variables, 123/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 01:13:50] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/374 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/374 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 111/485 variables, 50/174 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 01:13:51] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-30 01:13:51] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/485 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 575/1060 variables, 485/661 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1060 variables, 39/700 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 01:13:51] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1060 variables, 1/701 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1060 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 773/1833 variables, 422/1123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1833 variables, 165/1288 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1833 variables, 8/1296 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1833 variables, 8/1304 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 01:13:52] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 3 ms to minimize.
[2024-05-30 01:13:52] [INFO ] Deduced a trap composed of 3 places in 158 ms of which 3 ms to minimize.
[2024-05-30 01:13:52] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 3 ms to minimize.
[2024-05-30 01:13:52] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 3 ms to minimize.
[2024-05-30 01:13:52] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 3 ms to minimize.
[2024-05-30 01:13:53] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 3 ms to minimize.
[2024-05-30 01:13:53] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 2 ms to minimize.
[2024-05-30 01:13:53] [INFO ] Deduced a trap composed of 3 places in 153 ms of which 4 ms to minimize.
[2024-05-30 01:13:53] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 3 ms to minimize.
[2024-05-30 01:13:53] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1833 variables, 10/1314 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1833 variables, 0/1314 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 28/1861 variables, 31/1345 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1861 variables, 28/1373 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1861 variables, 0/1373 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 50/1911 variables, 25/1398 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1911 variables, 0/1398 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (OVERLAPS) 903/2814 variables, 487/1885 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2814 variables, 141/2026 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 01:13:55] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 4 ms to minimize.
[2024-05-30 01:13:55] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 4 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/2814 variables, 2/2028 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2814 variables, 0/2028 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (OVERLAPS) 59/2873 variables, 64/2092 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2873 variables, 59/2151 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2873 variables, 0/2151 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (OVERLAPS) 108/2981 variables, 54/2205 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 01:13:57] [INFO ] Deduced a trap composed of 5 places in 215 ms of which 4 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/2981 variables, 1/2206 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2981 variables, 0/2206 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (OVERLAPS) 650/3631 variables, 441/2647 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/3631 variables, 129/2776 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 01:13:59] [INFO ] Deduced a trap composed of 5 places in 253 ms of which 5 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/3631 variables, 1/2777 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/3631 variables, 0/2777 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (OVERLAPS) 21/3652 variables, 31/2808 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/3652 variables, 21/2829 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/3652 variables, 0/2829 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 39 (OVERLAPS) 22/3674 variables, 11/2840 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/3674 variables, 0/2840 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 41 (OVERLAPS) 371/4045 variables, 219/3059 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/4045 variables, 63/3122 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 01:14:02] [INFO ] Deduced a trap composed of 5 places in 275 ms of which 5 ms to minimize.
At refinement iteration 43 (INCLUDED_ONLY) 0/4045 variables, 1/3123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 01:14:03] [INFO ] Deduced a trap composed of 4 places in 265 ms of which 5 ms to minimize.
At refinement iteration 44 (INCLUDED_ONLY) 0/4045 variables, 1/3124 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/4045 variables, 0/3124 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 46 (OVERLAPS) 19/4064 variables, 32/3156 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/4064 variables, 19/3175 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/4064 variables, 0/3175 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 49 (OVERLAPS) 12/4076 variables, 6/3181 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/4076 variables, 0/3181 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 51 (OVERLAPS) 201/4277 variables, 125/3306 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/4277 variables, 44/3350 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 01:14:06] [INFO ] Deduced a trap composed of 7 places in 265 ms of which 5 ms to minimize.
At refinement iteration 53 (INCLUDED_ONLY) 0/4277 variables, 1/3351 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/4277 variables, 0/3351 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 55 (OVERLAPS) 5/4282 variables, 10/3361 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/4282 variables, 5/3366 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/4282 variables, 0/3366 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 58 (OVERLAPS) 140/4422 variables, 75/3441 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/4422 variables, 20/3461 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 01:14:08] [INFO ] Deduced a trap composed of 6 places in 270 ms of which 5 ms to minimize.
At refinement iteration 60 (INCLUDED_ONLY) 0/4422 variables, 1/3462 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/4422 variables, 0/3462 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 62 (OVERLAPS) 10/4432 variables, 16/3478 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/4432 variables, 10/3488 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/4432 variables, 0/3488 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 65 (OVERLAPS) 8/4440 variables, 4/3492 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/4440 variables, 0/3492 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 67 (OVERLAPS) 80/4520 variables, 50/3542 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/4520 variables, 20/3562 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/4520 variables, 0/3562 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 70 (OVERLAPS) 96/4616 variables, 52/3614 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/4616 variables, 12/3626 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/4616 variables, 0/3626 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 73 (OVERLAPS) 7/4623 variables, 13/3639 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/4623 variables, 7/3646 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/4623 variables, 0/3646 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 76 (OVERLAPS) 2/4625 variables, 1/3647 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/4625 variables, 0/3647 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 78 (OVERLAPS) 26/4651 variables, 18/3665 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/4651 variables, 8/3673 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/4651 variables, 0/3673 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 81 (OVERLAPS) 29/4680 variables, 15/3688 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/4680 variables, 3/3691 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/4680 variables, 0/3691 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 84 (OVERLAPS) 2/4682 variables, 4/3695 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/4682 variables, 2/3697 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/4682 variables, 0/3697 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 87 (OVERLAPS) 14/4696 variables, 8/3705 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/4696 variables, 4/3709 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/4696 variables, 0/3709 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 90 (OVERLAPS) 24/4720 variables, 12/3721 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/4720 variables, 2/3723 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/4720 variables, 0/3723 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 93 (OVERLAPS) 2/4722 variables, 4/3727 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/4722 variables, 2/3729 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/4722 variables, 0/3729 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 96 (OVERLAPS) 10/4732 variables, 6/3735 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/4732 variables, 3/3738 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/4732 variables, 0/3738 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 99 (OVERLAPS) 15/4747 variables, 8/3746 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/4747 variables, 4/3750 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/4747 variables, 0/3750 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 102 (OVERLAPS) 2/4749 variables, 2/3752 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/4749 variables, 1/3753 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/4749 variables, 0/3753 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 105 (OVERLAPS) 0/4749 variables, 0/3753 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4749/4749 variables, and 3753 constraints, problems are : Problem set: 0 solved, 8 unsolved in 33606 ms.
Refiners :[Positive P Invariants (semi-flows): 1098/1098 constraints, State Equation: 2578/2578 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 22/22 constraints]
After SMT, in 50994ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6568 ms.
Support contains 68 out of 2578 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2578/2578 places, 2171/2171 transitions.
Applied a total of 0 rules in 105 ms. Remains 2578 /2578 variables (removed 0) and now considering 2171/2171 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 2578/2578 places, 2171/2171 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2578/2578 places, 2171/2171 transitions.
Applied a total of 0 rules in 99 ms. Remains 2578 /2578 variables (removed 0) and now considering 2171/2171 (removed 0) transitions.
[2024-05-30 01:14:31] [INFO ] Invariant cache hit.
[2024-05-30 01:14:32] [INFO ] Implicit Places using invariants in 1522 ms returned []
[2024-05-30 01:14:32] [INFO ] Invariant cache hit.
[2024-05-30 01:14:34] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-30 01:14:37] [INFO ] Implicit Places using invariants and state equation in 4445 ms returned []
Implicit Place search using SMT with State Equation took 5975 ms to find 0 implicit places.
[2024-05-30 01:14:37] [INFO ] Redundant transitions in 106 ms returned []
Running 2149 sub problems to find dead transitions.
[2024-05-30 01:14:37] [INFO ] Invariant cache hit.
[2024-05-30 01:14:37] [INFO ] State equation strengthened by 47 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2558 variables, 985/985 constraints. Problems are: Problem set: 0 solved, 2149 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2558/4749 variables, and 985 constraints, problems are : Problem set: 0 solved, 2149 unsolved in 30090 ms.
Refiners :[Positive P Invariants (semi-flows): 985/1098 constraints, State Equation: 0/2578 constraints, ReadFeed: 0/47 constraints, PredecessorRefiner: 2149/2149 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2558 variables, 985/985 constraints. Problems are: Problem set: 0 solved, 2149 unsolved
[2024-05-30 01:15:13] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:15:14] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:15:14] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:15:14] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:15:14] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:15:14] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:15:15] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:15:15] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:15:15] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:15:15] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2024-05-30 01:15:16] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:15:16] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:15:16] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:15:16] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:15:16] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:15:17] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-05-30 01:15:17] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-05-30 01:15:18] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-05-30 01:15:18] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-05-30 01:15:19] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/2558 variables, 20/1005 constraints. Problems are: Problem set: 0 solved, 2149 unsolved
[2024-05-30 01:15:23] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:15:26] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-05-30 01:15:27] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2024-05-30 01:15:28] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 2 ms to minimize.
[2024-05-30 01:15:28] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2024-05-30 01:15:28] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 2 ms to minimize.
[2024-05-30 01:15:28] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 1 ms to minimize.
[2024-05-30 01:15:29] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 2 ms to minimize.
[2024-05-30 01:15:29] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 2 ms to minimize.
[2024-05-30 01:15:29] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
[2024-05-30 01:15:29] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 2 ms to minimize.
[2024-05-30 01:15:29] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2024-05-30 01:15:30] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 2 ms to minimize.
[2024-05-30 01:15:30] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 1 ms to minimize.
[2024-05-30 01:15:30] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 1 ms to minimize.
[2024-05-30 01:15:31] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 1 ms to minimize.
[2024-05-30 01:15:31] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 2 ms to minimize.
[2024-05-30 01:15:31] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 1 ms to minimize.
[2024-05-30 01:15:31] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 2 ms to minimize.
[2024-05-30 01:15:32] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2558 variables, 20/1025 constraints. Problems are: Problem set: 0 solved, 2149 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2558/4749 variables, and 1025 constraints, problems are : Problem set: 0 solved, 2149 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 985/1098 constraints, State Equation: 0/2578 constraints, ReadFeed: 0/47 constraints, PredecessorRefiner: 0/2149 constraints, Known Traps: 40/40 constraints]
After SMT, in 61287ms problems are : Problem set: 0 solved, 2149 unsolved
Search for dead transitions found 0 dead transitions in 61333ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67533 ms. Remains : 2578/2578 places, 2171/2171 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 569 times.
Drop transitions (Partial Free agglomeration) removed 569 transitions
Iterating global reduction 0 with 569 rules applied. Total rules applied 569 place count 2578 transition count 2171
Applied a total of 569 rules in 250 ms. Remains 2578 /2578 variables (removed 0) and now considering 2171/2171 (removed 0) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 2171 rows 2578 cols
[2024-05-30 01:15:38] [INFO ] Computed 1098 invariants in 5 ms
[2024-05-30 01:15:39] [INFO ] [Real]Absence check using 1098 positive place invariants in 159 ms returned sat
[2024-05-30 01:15:39] [INFO ] After 755ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-30 01:15:40] [INFO ] [Nat]Absence check using 1098 positive place invariants in 182 ms returned sat
[2024-05-30 01:15:42] [INFO ] After 1628ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-30 01:15:42] [INFO ] State equation strengthened by 533 read => feed constraints.
[2024-05-30 01:15:43] [INFO ] After 1353ms SMT Verify possible using 533 Read/Feed constraints in natural domain returned unsat :0 sat :8
TRAPS : Iteration 0
[2024-05-30 01:15:44] [INFO ] Deduced a trap composed of 5 places in 506 ms of which 8 ms to minimize.
[2024-05-30 01:15:45] [INFO ] Deduced a trap composed of 5 places in 499 ms of which 7 ms to minimize.
[2024-05-30 01:15:45] [INFO ] Deduced a trap composed of 6 places in 495 ms of which 8 ms to minimize.
[2024-05-30 01:15:46] [INFO ] Deduced a trap composed of 5 places in 486 ms of which 7 ms to minimize.
[2024-05-30 01:15:46] [INFO ] Deduced a trap composed of 5 places in 480 ms of which 7 ms to minimize.
[2024-05-30 01:15:47] [INFO ] Deduced a trap composed of 5 places in 470 ms of which 7 ms to minimize.
[2024-05-30 01:15:47] [INFO ] Deduced a trap composed of 5 places in 480 ms of which 7 ms to minimize.
[2024-05-30 01:15:48] [INFO ] Deduced a trap composed of 6 places in 473 ms of which 8 ms to minimize.
[2024-05-30 01:15:49] [INFO ] Deduced a trap composed of 7 places in 460 ms of which 7 ms to minimize.
[2024-05-30 01:15:49] [INFO ] Deduced a trap composed of 4 places in 466 ms of which 8 ms to minimize.
[2024-05-30 01:15:50] [INFO ] Deduced a trap composed of 6 places in 510 ms of which 8 ms to minimize.
[2024-05-30 01:15:50] [INFO ] Deduced a trap composed of 5 places in 473 ms of which 7 ms to minimize.
[2024-05-30 01:15:51] [INFO ] Deduced a trap composed of 5 places in 464 ms of which 7 ms to minimize.
[2024-05-30 01:15:51] [INFO ] Deduced a trap composed of 5 places in 462 ms of which 8 ms to minimize.
[2024-05-30 01:15:52] [INFO ] Deduced a trap composed of 5 places in 453 ms of which 7 ms to minimize.
[2024-05-30 01:15:53] [INFO ] Deduced a trap composed of 6 places in 454 ms of which 7 ms to minimize.
[2024-05-30 01:15:53] [INFO ] Deduced a trap composed of 5 places in 442 ms of which 6 ms to minimize.
[2024-05-30 01:15:54] [INFO ] Deduced a trap composed of 7 places in 447 ms of which 7 ms to minimize.
[2024-05-30 01:15:54] [INFO ] Deduced a trap composed of 5 places in 450 ms of which 7 ms to minimize.
[2024-05-30 01:15:55] [INFO ] Deduced a trap composed of 6 places in 443 ms of which 7 ms to minimize.
[2024-05-30 01:15:55] [INFO ] Deduced a trap composed of 5 places in 473 ms of which 7 ms to minimize.
[2024-05-30 01:15:56] [INFO ] Deduced a trap composed of 5 places in 431 ms of which 7 ms to minimize.
[2024-05-30 01:15:56] [INFO ] Deduced a trap composed of 7 places in 424 ms of which 7 ms to minimize.
[2024-05-30 01:15:57] [INFO ] Deduced a trap composed of 7 places in 413 ms of which 7 ms to minimize.
[2024-05-30 01:15:57] [INFO ] Deduced a trap composed of 7 places in 405 ms of which 6 ms to minimize.
[2024-05-30 01:15:57] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 14122 ms
[2024-05-30 01:15:58] [INFO ] Deduced a trap composed of 5 places in 410 ms of which 7 ms to minimize.
[2024-05-30 01:15:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 592 ms
[2024-05-30 01:15:59] [INFO ] Deduced a trap composed of 3 places in 454 ms of which 7 ms to minimize.
[2024-05-30 01:15:59] [INFO ] Deduced a trap composed of 3 places in 440 ms of which 7 ms to minimize.
[2024-05-30 01:16:00] [INFO ] Deduced a trap composed of 5 places in 423 ms of which 6 ms to minimize.
[2024-05-30 01:16:00] [INFO ] Deduced a trap composed of 5 places in 425 ms of which 7 ms to minimize.
[2024-05-30 01:16:01] [INFO ] Deduced a trap composed of 5 places in 423 ms of which 7 ms to minimize.
[2024-05-30 01:16:02] [INFO ] Deduced a trap composed of 5 places in 418 ms of which 7 ms to minimize.
[2024-05-30 01:16:02] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3273 ms
[2024-05-30 01:16:02] [INFO ] Deduced a trap composed of 8 places in 399 ms of which 7 ms to minimize.
[2024-05-30 01:16:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 570 ms
[2024-05-30 01:16:03] [INFO ] Deduced a trap composed of 6 places in 431 ms of which 7 ms to minimize.
[2024-05-30 01:16:03] [INFO ] Deduced a trap composed of 7 places in 418 ms of which 7 ms to minimize.
[2024-05-30 01:16:04] [INFO ] Deduced a trap composed of 9 places in 422 ms of which 7 ms to minimize.
[2024-05-30 01:16:04] [INFO ] Deduced a trap composed of 6 places in 425 ms of which 6 ms to minimize.
[2024-05-30 01:16:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2150 ms
[2024-05-30 01:16:06] [INFO ] Deduced a trap composed of 3 places in 430 ms of which 7 ms to minimize.
[2024-05-30 01:16:06] [INFO ] Deduced a trap composed of 5 places in 425 ms of which 6 ms to minimize.
[2024-05-30 01:16:07] [INFO ] Deduced a trap composed of 7 places in 441 ms of which 7 ms to minimize.
[2024-05-30 01:16:07] [INFO ] Deduced a trap composed of 9 places in 427 ms of which 6 ms to minimize.
[2024-05-30 01:16:08] [INFO ] Deduced a trap composed of 5 places in 436 ms of which 8 ms to minimize.
[2024-05-30 01:16:08] [INFO ] Deduced a trap composed of 5 places in 429 ms of which 6 ms to minimize.
[2024-05-30 01:16:09] [INFO ] Deduced a trap composed of 6 places in 428 ms of which 7 ms to minimize.
[2024-05-30 01:16:09] [INFO ] Deduced a trap composed of 6 places in 433 ms of which 7 ms to minimize.
[2024-05-30 01:16:10] [INFO ] Deduced a trap composed of 5 places in 441 ms of which 7 ms to minimize.
[2024-05-30 01:16:10] [INFO ] Deduced a trap composed of 3 places in 492 ms of which 7 ms to minimize.
[2024-05-30 01:16:11] [INFO ] Deduced a trap composed of 5 places in 505 ms of which 7 ms to minimize.
[2024-05-30 01:16:12] [INFO ] Deduced a trap composed of 9 places in 494 ms of which 7 ms to minimize.
[2024-05-30 01:16:12] [INFO ] Deduced a trap composed of 5 places in 496 ms of which 7 ms to minimize.
[2024-05-30 01:16:13] [INFO ] Deduced a trap composed of 6 places in 498 ms of which 7 ms to minimize.
[2024-05-30 01:16:13] [INFO ] Deduced a trap composed of 5 places in 486 ms of which 8 ms to minimize.
[2024-05-30 01:16:14] [INFO ] Deduced a trap composed of 8 places in 488 ms of which 8 ms to minimize.
[2024-05-30 01:16:15] [INFO ] Deduced a trap composed of 7 places in 482 ms of which 8 ms to minimize.
[2024-05-30 01:16:15] [INFO ] Deduced a trap composed of 7 places in 460 ms of which 7 ms to minimize.
[2024-05-30 01:16:16] [INFO ] Deduced a trap composed of 6 places in 474 ms of which 8 ms to minimize.
[2024-05-30 01:16:16] [INFO ] Deduced a trap composed of 10 places in 464 ms of which 9 ms to minimize.
[2024-05-30 01:16:17] [INFO ] Deduced a trap composed of 9 places in 472 ms of which 8 ms to minimize.
[2024-05-30 01:16:17] [INFO ] Deduced a trap composed of 8 places in 462 ms of which 8 ms to minimize.
[2024-05-30 01:16:18] [INFO ] Deduced a trap composed of 5 places in 452 ms of which 7 ms to minimize.
[2024-05-30 01:16:18] [INFO ] Deduced a trap composed of 9 places in 450 ms of which 7 ms to minimize.
[2024-05-30 01:16:19] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 13511 ms
TRAPS : Iteration 1
[2024-05-30 01:16:19] [INFO ] Deduced a trap composed of 11 places in 442 ms of which 7 ms to minimize.
[2024-05-30 01:16:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 614 ms
[2024-05-30 01:16:20] [INFO ] Deduced a trap composed of 7 places in 437 ms of which 8 ms to minimize.
[2024-05-30 01:16:21] [INFO ] Deduced a trap composed of 6 places in 457 ms of which 8 ms to minimize.
[2024-05-30 01:16:21] [INFO ] Deduced a trap composed of 3 places in 440 ms of which 7 ms to minimize.
[2024-05-30 01:16:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1696 ms
[2024-05-30 01:16:22] [INFO ] Deduced a trap composed of 6 places in 421 ms of which 7 ms to minimize.
[2024-05-30 01:16:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 591 ms
[2024-05-30 01:16:23] [INFO ] Deduced a trap composed of 6 places in 409 ms of which 7 ms to minimize.
[2024-05-30 01:16:23] [INFO ] Deduced a trap composed of 5 places in 408 ms of which 7 ms to minimize.
[2024-05-30 01:16:24] [INFO ] Deduced a trap composed of 8 places in 413 ms of which 6 ms to minimize.
[2024-05-30 01:16:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1590 ms
TRAPS : Iteration 2
[2024-05-30 01:16:25] [INFO ] Deduced a trap composed of 3 places in 415 ms of which 6 ms to minimize.
[2024-05-30 01:16:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 585 ms
[2024-05-30 01:16:25] [INFO ] Deduced a trap composed of 7 places in 425 ms of which 7 ms to minimize.
[2024-05-30 01:16:26] [INFO ] Deduced a trap composed of 5 places in 418 ms of which 6 ms to minimize.
[2024-05-30 01:16:26] [INFO ] Deduced a trap composed of 6 places in 416 ms of which 7 ms to minimize.
[2024-05-30 01:16:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1613 ms
[2024-05-30 01:16:27] [INFO ] Deduced a trap composed of 7 places in 397 ms of which 7 ms to minimize.
[2024-05-30 01:16:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 575 ms
[2024-05-30 01:16:28] [INFO ] Deduced a trap composed of 6 places in 433 ms of which 7 ms to minimize.
[2024-05-30 01:16:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 627 ms
[2024-05-30 01:16:29] [INFO ] Deduced a trap composed of 6 places in 419 ms of which 6 ms to minimize.
[2024-05-30 01:16:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 593 ms
TRAPS : Iteration 3
[2024-05-30 01:16:30] [INFO ] Deduced a trap composed of 6 places in 432 ms of which 7 ms to minimize.
[2024-05-30 01:16:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 608 ms
[2024-05-30 01:16:31] [INFO ] Deduced a trap composed of 6 places in 412 ms of which 6 ms to minimize.
[2024-05-30 01:16:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 591 ms
TRAPS : Iteration 4
[2024-05-30 01:16:32] [INFO ] Deduced a trap composed of 12 places in 437 ms of which 7 ms to minimize.
[2024-05-30 01:16:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 612 ms
[2024-05-30 01:16:34] [INFO ] Deduced a trap composed of 8 places in 710 ms of which 11 ms to minimize.
[2024-05-30 01:16:35] [INFO ] Deduced a trap composed of 4 places in 708 ms of which 10 ms to minimize.
[2024-05-30 01:16:36] [INFO ] Deduced a trap composed of 7 places in 642 ms of which 9 ms to minimize.
[2024-05-30 01:16:36] [INFO ] Deduced a trap composed of 13 places in 640 ms of which 9 ms to minimize.
[2024-05-30 01:16:37] [INFO ] Deduced a trap composed of 12 places in 630 ms of which 9 ms to minimize.
[2024-05-30 01:16:38] [INFO ] Deduced a trap composed of 5 places in 621 ms of which 9 ms to minimize.
[2024-05-30 01:16:38] [INFO ] Deduced a trap composed of 5 places in 620 ms of which 9 ms to minimize.
[2024-05-30 01:16:39] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 5511 ms
[2024-05-30 01:16:40] [INFO ] Deduced a trap composed of 8 places in 551 ms of which 8 ms to minimize.
[2024-05-30 01:16:40] [INFO ] Deduced a trap composed of 5 places in 539 ms of which 8 ms to minimize.
[2024-05-30 01:16:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1361 ms
[2024-05-30 01:16:41] [INFO ] Deduced a trap composed of 5 places in 542 ms of which 8 ms to minimize.
[2024-05-30 01:16:42] [INFO ] Deduced a trap composed of 5 places in 537 ms of which 8 ms to minimize.
[2024-05-30 01:16:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1357 ms
[2024-05-30 01:16:43] [INFO ] Deduced a trap composed of 5 places in 535 ms of which 8 ms to minimize.
[2024-05-30 01:16:43] [INFO ] Deduced a trap composed of 8 places in 528 ms of which 8 ms to minimize.
[2024-05-30 01:16:44] [INFO ] Deduced a trap composed of 5 places in 532 ms of which 7 ms to minimize.
[2024-05-30 01:16:44] [INFO ] Deduced a trap composed of 5 places in 530 ms of which 8 ms to minimize.
[2024-05-30 01:16:45] [INFO ] Deduced a trap composed of 6 places in 533 ms of which 8 ms to minimize.
[2024-05-30 01:16:46] [INFO ] Deduced a trap composed of 6 places in 538 ms of which 8 ms to minimize.
[2024-05-30 01:16:46] [INFO ] Deduced a trap composed of 5 places in 522 ms of which 7 ms to minimize.
[2024-05-30 01:16:47] [INFO ] Deduced a trap composed of 5 places in 536 ms of which 8 ms to minimize.
[2024-05-30 01:16:47] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 5103 ms
[2024-05-30 01:16:48] [INFO ] Deduced a trap composed of 7 places in 532 ms of which 8 ms to minimize.
[2024-05-30 01:16:48] [INFO ] Deduced a trap composed of 7 places in 520 ms of which 8 ms to minimize.
[2024-05-30 01:16:49] [INFO ] Deduced a trap composed of 5 places in 519 ms of which 8 ms to minimize.
[2024-05-30 01:16:50] [INFO ] Deduced a trap composed of 5 places in 565 ms of which 8 ms to minimize.
[2024-05-30 01:16:50] [INFO ] Deduced a trap composed of 9 places in 557 ms of which 8 ms to minimize.
[2024-05-30 01:16:51] [INFO ] Deduced a trap composed of 7 places in 572 ms of which 9 ms to minimize.
[2024-05-30 01:16:51] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3931 ms
TRAPS : Iteration 5
[2024-05-30 01:16:52] [INFO ] Deduced a trap composed of 10 places in 557 ms of which 7 ms to minimize.
[2024-05-30 01:16:53] [INFO ] Deduced a trap composed of 9 places in 554 ms of which 7 ms to minimize.
[2024-05-30 01:16:53] [INFO ] Deduced a trap composed of 6 places in 496 ms of which 8 ms to minimize.
[2024-05-30 01:16:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1972 ms
[2024-05-30 01:16:54] [INFO ] Deduced a trap composed of 9 places in 565 ms of which 9 ms to minimize.
[2024-05-30 01:16:55] [INFO ] Deduced a trap composed of 5 places in 545 ms of which 8 ms to minimize.
[2024-05-30 01:16:56] [INFO ] Deduced a trap composed of 6 places in 548 ms of which 9 ms to minimize.
[2024-05-30 01:16:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2039 ms
[2024-05-30 01:16:56] [INFO ] Deduced a trap composed of 6 places in 511 ms of which 8 ms to minimize.
[2024-05-30 01:16:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 683 ms
[2024-05-30 01:16:57] [INFO ] Deduced a trap composed of 5 places in 539 ms of which 8 ms to minimize.
[2024-05-30 01:16:58] [INFO ] Deduced a trap composed of 5 places in 532 ms of which 8 ms to minimize.
[2024-05-30 01:16:58] [INFO ] Deduced a trap composed of 7 places in 485 ms of which 7 ms to minimize.
[2024-05-30 01:16:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1925 ms
[2024-05-30 01:17:00] [INFO ] Deduced a trap composed of 6 places in 485 ms of which 7 ms to minimize.
[2024-05-30 01:17:00] [INFO ] Deduced a trap composed of 7 places in 492 ms of which 7 ms to minimize.
[2024-05-30 01:17:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1231 ms
TRAPS : Iteration 6
[2024-05-30 01:17:02] [INFO ] After 79902ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
[2024-05-30 01:17:03] [INFO ] After 83800ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Over-approximation ignoring read arcs solved 0 properties in 84857 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-30 01:17:03] [INFO ] Flatten gal took : 182 ms
[2024-05-30 01:17:03] [INFO ] Applying decomposition
[2024-05-30 01:17:03] [INFO ] Flatten gal took : 178 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/graph299393107719455386.txt' '-o' '/tmp/graph299393107719455386.bin' '-w' '/tmp/graph299393107719455386.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph299393107719455386.bin' '-l' '-1' '-v' '-w' '/tmp/graph299393107719455386.weights' '-q' '0' '-e' '0.001'
[2024-05-30 01:17:04] [INFO ] Decomposing Gal with order
[2024-05-30 01:17:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 01:17:08] [INFO ] Removed a total of 600 redundant transitions.
[2024-05-30 01:17:09] [INFO ] Flatten gal took : 417 ms
[2024-05-30 01:17:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 32 ms.
[2024-05-30 01:17:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5061543025642483661.gal : 73 ms
[2024-05-30 01:17:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8393145621770549870.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/ReachabilityCardinality5061543025642483661.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8393145621770549870.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality8393145621770549870.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :1 after 834
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :834 after 11206
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :3.25219e+12 after 2.61031e+27
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :9.67667e+298 after 1.16306e+305
ITS-tools command line returned an error code 137
[2024-05-30 01:26:15] [INFO ] Flatten gal took : 71 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9124717795612916985
[2024-05-30 01:26:15] [INFO ] Too many transitions (2171) to apply POR reductions. Disabling POR matrices.
[2024-05-30 01:26:15] [INFO ] Applying decomposition
[2024-05-30 01:26:15] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9124717795612916985
Running compilation step : cd /tmp/ltsmin9124717795612916985;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '90' '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-30 01:26:15] [INFO ] Flatten gal took : 71 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/graph5091641425906548431.txt' '-o' '/tmp/graph5091641425906548431.bin' '-w' '/tmp/graph5091641425906548431.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5091641425906548431.bin' '-l' '-1' '-v' '-w' '/tmp/graph5091641425906548431.weights' '-q' '0' '-e' '0.001'
[2024-05-30 01:26:15] [INFO ] Decomposing Gal with order
[2024-05-30 01:26:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 01:26:15] [INFO ] Removed a total of 1413 redundant transitions.
[2024-05-30 01:26:15] [INFO ] Flatten gal took : 116 ms
[2024-05-30 01:26:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 588 labels/synchronizations in 27 ms.
[2024-05-30 01:26:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality904268159197998373.gal : 47 ms
[2024-05-30 01:26:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7020680362340571177.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/ReachabilityCardinality904268159197998373.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7020680362340571177.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 ...306
Loading property file /tmp/ReachabilityCardinality7020680362340571177.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :1 after 27
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :27 after 54
Compilation finished in 6548 ms.
Running link step : cd /tmp/ltsmin9124717795612916985;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin9124717795612916985;'/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' 'ShieldPPPtPT100BReachabilityCardinality202401==true'
WARNING : LTSmin timed out (>56 s) on command cd /tmp/ltsmin9124717795612916985;'/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' 'ShieldPPPtPT100BReachabilityCardinality202401==true'
Running LTSmin : cd /tmp/ltsmin9124717795612916985;'/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' 'ShieldPPPtPT100BReachabilityCardinality202403==true'
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :54 after 39366
WARNING : LTSmin timed out (>56 s) on command cd /tmp/ltsmin9124717795612916985;'/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' 'ShieldPPPtPT100BReachabilityCardinality202403==true'
Running LTSmin : cd /tmp/ltsmin9124717795612916985;'/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' 'ShieldPPPtPT100BReachabilityCardinality202304==true'
WARNING : LTSmin timed out (>56 s) on command cd /tmp/ltsmin9124717795612916985;'/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' 'ShieldPPPtPT100BReachabilityCardinality202304==true'
Running LTSmin : cd /tmp/ltsmin9124717795612916985;'/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' 'ShieldPPPtPT100BReachabilityCardinality202406==true'
WARNING : LTSmin timed out (>56 s) on command cd /tmp/ltsmin9124717795612916985;'/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' 'ShieldPPPtPT100BReachabilityCardinality202406==true'
Running LTSmin : cd /tmp/ltsmin9124717795612916985;'/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' 'ShieldPPPtPT100BReachabilityCardinality202407==true'
WARNING : LTSmin timed out (>56 s) on command cd /tmp/ltsmin9124717795612916985;'/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' 'ShieldPPPtPT100BReachabilityCardinality202407==true'
Running LTSmin : cd /tmp/ltsmin9124717795612916985;'/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' 'ShieldPPPtPT100BReachabilityCardinality202411==true'
WARNING : LTSmin timed out (>56 s) on command cd /tmp/ltsmin9124717795612916985;'/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' 'ShieldPPPtPT100BReachabilityCardinality202411==true'
Running LTSmin : cd /tmp/ltsmin9124717795612916985;'/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' 'ShieldPPPtPT100BReachabilityCardinality202412==true'
WARNING : LTSmin timed out (>56 s) on command cd /tmp/ltsmin9124717795612916985;'/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' 'ShieldPPPtPT100BReachabilityCardinality202412==true'
Running LTSmin : cd /tmp/ltsmin9124717795612916985;'/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' 'ShieldPPPtPT100BReachabilityCardinality202413==true'
WARNING : LTSmin timed out (>56 s) on command cd /tmp/ltsmin9124717795612916985;'/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' 'ShieldPPPtPT100BReachabilityCardinality202413==true'
Retrying LTSmin with larger timeout 3600 s
Running LTSmin : cd /tmp/ltsmin9124717795612916985;'/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' 'ShieldPPPtPT100BReachabilityCardinality202401==true'
WARNING : LTSmin timed out (>450 s) on command cd /tmp/ltsmin9124717795612916985;'/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' 'ShieldPPPtPT100BReachabilityCardinality202401==true'
Running LTSmin : cd /tmp/ltsmin9124717795612916985;'/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' 'ShieldPPPtPT100BReachabilityCardinality202403==true'
ITS-tools command line returned an error code 137
[2024-05-30 01:44:52] [INFO ] Applying decomposition
[2024-05-30 01:44:52] [INFO ] Flatten gal took : 194 ms
[2024-05-30 01:44:52] [INFO ] Decomposing Gal with order
[2024-05-30 01:44:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 01:44:55] [INFO ] Removed a total of 1537 redundant transitions.
[2024-05-30 01:44:55] [INFO ] Flatten gal took : 347 ms
[2024-05-30 01:45:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 2142 labels/synchronizations in 419 ms.
[2024-05-30 01:45:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17826933637562312023.gal : 108 ms
[2024-05-30 01:45:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17669346399800977166.prop : 4 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/ReachabilityCardinality17826933637562312023.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17669346399800977166.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/ReachabilityCardinality17669346399800977166.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :1 after 54
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :54 after 4374
WARNING : LTSmin timed out (>450 s) on command cd /tmp/ltsmin9124717795612916985;'/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' 'ShieldPPPtPT100BReachabilityCardinality202403==true'
Running LTSmin : cd /tmp/ltsmin9124717795612916985;'/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' 'ShieldPPPtPT100BReachabilityCardinality202304==true'
WARNING : LTSmin timed out (>450 s) on command cd /tmp/ltsmin9124717795612916985;'/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' 'ShieldPPPtPT100BReachabilityCardinality202304==true'
Running LTSmin : cd /tmp/ltsmin9124717795612916985;'/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' 'ShieldPPPtPT100BReachabilityCardinality202406==true'
WARNING : LTSmin timed out (>450 s) on command cd /tmp/ltsmin9124717795612916985;'/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' 'ShieldPPPtPT100BReachabilityCardinality202406==true'
Running LTSmin : cd /tmp/ltsmin9124717795612916985;'/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' 'ShieldPPPtPT100BReachabilityCardinality202407==true'
Detected timeout of ITS tools.
[2024-05-30 02:10:15] [INFO ] Flatten gal took : 199 ms
[2024-05-30 02:10:15] [INFO ] Input system was already deterministic with 2171 transitions.
[2024-05-30 02:10:15] [INFO ] Transformed 2578 places.
[2024-05-30 02:10:15] [INFO ] Transformed 2171 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-30 02:10:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11515409349423106927.gal : 49 ms
[2024-05-30 02:10:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6252704349282289838.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/ReachabilityCardinality11515409349423106927.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6252704349282289838.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 ...374
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityCardinality6252704349282289838.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :6 after 33
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :33 after 43
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :43 after 192
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :192 after 5504
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :5504 after 55040
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :55040 after 8.8311e+06
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :8.8311e+06 after 7.80446e+08
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :7.80446e+08 after 2.56243e+12
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :2.56243e+12 after 1.19826e+19
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :1.19826e+19 after 1.52912e+29
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :1.52912e+29 after 1.19687e+40
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :1.19687e+40 after 1.09668e+44

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="ShieldPPPt-PT-100B"
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 ShieldPPPt-PT-100B, 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-171683761700702"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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