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.r312-tall-171662339500886.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 ResAllocation-PT-R100C002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-171662339500886
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 896K
-rw-r--r-- 1 mcc users 9.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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.7K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 11 23:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 11 23:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 11 23:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 11 23:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 9 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 422K 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 ResAllocation-PT-R100C002-ReachabilityCardinality-2024-00
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-2024-01
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-2024-02
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-2024-03
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-2024-04
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-2024-05
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-2024-06
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-2024-07
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-2024-08
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-2024-09
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-2024-10
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-2024-11
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-2024-12
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-2024-13
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-2024-14
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716720919217

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R100C002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-26 10:55:20] [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-26 10:55:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 10:55:20] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2024-05-26 10:55:20] [INFO ] Transformed 400 places.
[2024-05-26 10:55:20] [INFO ] Transformed 202 transitions.
[2024-05-26 10:55:20] [INFO ] Found NUPN structural information;
[2024-05-26 10:55:20] [INFO ] Parsed PT model containing 400 places and 202 transitions and 1000 arcs in 219 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 10:55:21] [INFO ] Flatten gal took : 171 ms
RANDOM walk for 40000 steps (12 resets) in 1999 ms. (20 steps per ms) remains 3/14 properties
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-26 10:55:21] [INFO ] Flatten gal took : 69 ms
[2024-05-26 10:55:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15163114055204833054.gal : 24 ms
[2024-05-26 10:55:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2722539895884656967.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/ReachabilityCardinality15163114055204833054.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2722539895884656967.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 427 ms. (93 steps per ms) remains 3/3 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality2722539895884656967.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 3/3 properties
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :8 after 32
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :32 after 448
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :448 after 14336
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :14336 after 1.67772e+07
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :1.67772e+07 after 7.03687e+13
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :7.03687e+13 after 1.0832e+27
BEST_FIRST walk for 40003 steps (8 resets) in 331 ms. (120 steps per ms) remains 3/3 properties
// Phase 1: matrix 202 rows 400 cols
[2024-05-26 10:55:21] [INFO ] Computed 200 invariants in 27 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 37/59 variables, 23/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 37/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 25/84 variables, 19/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 25/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 76/160 variables, 84/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 150/310 variables, 112/322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/310 variables, 112/434 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 56/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/310 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 86/396 variables, 60/550 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/396 variables, 60/610 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/396 variables, 30/640 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/396 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 56/452 variables, 40/680 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/452 variables, 40/720 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/452 variables, 20/740 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/452 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 40/492 variables, 28/768 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/492 variables, 28/796 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/492 variables, 14/810 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/492 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 28/520 variables, 20/830 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/520 variables, 20/850 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/520 variables, 10/860 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/520 variables, 0/860 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 18/538 variables, 12/872 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/538 variables, 12/884 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/538 variables, 6/890 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/538 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 18/556 variables, 12/902 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/556 variables, 12/914 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/556 variables, 6/920 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/556 variables, 0/920 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (OVERLAPS) 18/574 variables, 12/932 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/574 variables, 12/944 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/574 variables, 6/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/574 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (OVERLAPS) 12/586 variables, 8/958 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/586 variables, 8/966 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/586 variables, 4/970 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/586 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (OVERLAPS) 12/598 variables, 8/978 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/598 variables, 8/986 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/598 variables, 4/990 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/598 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (OVERLAPS) 4/602 variables, 4/994 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/602 variables, 4/998 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/602 variables, 2/1000 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/602 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (OVERLAPS) 0/602 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 602/602 variables, and 1000 constraints, problems are : Problem set: 0 solved, 3 unsolved in 987 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 37/59 variables, 23/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 37/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 10:55:22] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 25/84 variables, 19/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 25/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 10:55:23] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/84 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 76/160 variables, 84/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/160 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 150/310 variables, 112/324 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/310 variables, 112/436 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/310 variables, 56/492 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/310 variables, 3/495 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 10:55:23] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/310 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/310 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 86/396 variables, 60/556 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/396 variables, 60/616 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/396 variables, 30/646 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 10:55:23] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-26 10:55:23] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/396 variables, 2/648 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 10:55:23] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/396 variables, 1/649 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 10:55:23] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/396 variables, 1/650 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/396 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 56/452 variables, 40/690 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/452 variables, 40/730 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/452 variables, 20/750 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 10:55:23] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 ms to minimize.
[2024-05-26 10:55:23] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/452 variables, 2/752 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/452 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 40/492 variables, 28/780 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/492 variables, 28/808 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/492 variables, 14/822 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/492 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 28/520 variables, 20/842 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/520 variables, 20/862 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/520 variables, 10/872 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/520 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (OVERLAPS) 18/538 variables, 12/884 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/538 variables, 12/896 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/538 variables, 6/902 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/538 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (OVERLAPS) 18/556 variables, 12/914 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/556 variables, 12/926 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/556 variables, 6/932 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 10:55:24] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 45 (INCLUDED_ONLY) 0/556 variables, 1/933 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/556 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (OVERLAPS) 18/574 variables, 12/945 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/574 variables, 12/957 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/574 variables, 6/963 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/574 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (OVERLAPS) 12/586 variables, 8/971 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/586 variables, 8/979 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/586 variables, 4/983 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/586 variables, 0/983 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (OVERLAPS) 12/598 variables, 8/991 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/598 variables, 8/999 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/598 variables, 4/1003 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/598 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (OVERLAPS) 4/602 variables, 4/1007 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/602 variables, 4/1011 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/602 variables, 2/1013 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 10:55:26] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 62 (INCLUDED_ONLY) 0/602 variables, 1/1014 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/602 variables, 0/1014 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (OVERLAPS) 0/602 variables, 0/1014 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 602/602 variables, and 1014 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4130 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 11/11 constraints]
After SMT, in 5224ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-2024-04 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 1642 ms.
Support contains 21 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 397 transition count 200
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 397 transition count 199
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 395 transition count 199
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 393 transition count 198
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 393 transition count 197
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 391 transition count 197
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 17 place count 389 transition count 196
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 389 transition count 195
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 387 transition count 195
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 23 place count 385 transition count 194
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 385 transition count 193
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 26 place count 383 transition count 193
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 29 place count 381 transition count 192
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 30 place count 381 transition count 191
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 32 place count 379 transition count 191
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 35 place count 377 transition count 190
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 36 place count 377 transition count 189
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 38 place count 375 transition count 189
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 41 place count 373 transition count 188
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 42 place count 373 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 44 place count 371 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 47 place count 369 transition count 186
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 48 place count 369 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 50 place count 367 transition count 185
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 51 place count 367 transition count 184
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 54 place count 364 transition count 184
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 56 place count 363 transition count 183
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 57 place count 363 transition count 182
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 60 place count 360 transition count 182
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 62 place count 359 transition count 181
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 63 place count 359 transition count 180
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 66 place count 356 transition count 180
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 68 place count 355 transition count 179
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 69 place count 355 transition count 178
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 72 place count 352 transition count 178
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 74 place count 351 transition count 177
Applied a total of 74 rules in 320 ms. Remains 351 /400 variables (removed 49) and now considering 177/202 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 330 ms. Remains : 351/400 places, 177/202 transitions.
RANDOM walk for 40000 steps (19 resets) in 522 ms. (76 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 628634 steps, run timeout after 3001 ms. (steps per millisecond=209 ) properties seen :0 out of 2
Probabilistic random walk after 628634 steps, saw 172375 distinct states, run finished after 3004 ms. (steps per millisecond=209 ) properties seen :0
// Phase 1: matrix 177 rows 351 cols
[2024-05-26 10:55:32] [INFO ] Computed 176 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 36/57 variables, 22/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 36/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 22/79 variables, 18/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 22/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 72/151 variables, 79/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 144/295 variables, 107/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/295 variables, 107/412 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/295 variables, 53/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/295 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/296 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/296 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/296 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/296 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 74/370 variables, 52/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/370 variables, 52/572 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/370 variables, 26/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/370 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 44/414 variables, 32/630 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/414 variables, 32/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/414 variables, 16/678 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/414 variables, 0/678 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 28/442 variables, 20/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/442 variables, 20/718 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/442 variables, 10/728 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/442 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 22/464 variables, 16/744 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/464 variables, 16/760 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/464 variables, 8/768 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/464 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 12/476 variables, 8/776 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/476 variables, 8/784 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/476 variables, 4/788 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/476 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (OVERLAPS) 12/488 variables, 8/796 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/488 variables, 8/804 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/488 variables, 4/808 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/488 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (OVERLAPS) 12/500 variables, 8/816 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/500 variables, 8/824 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/500 variables, 4/828 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/500 variables, 0/828 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (OVERLAPS) 12/512 variables, 8/836 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/512 variables, 8/844 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/512 variables, 4/848 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/512 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (OVERLAPS) 12/524 variables, 8/856 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/524 variables, 8/864 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/524 variables, 4/868 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/524 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (OVERLAPS) 4/528 variables, 4/872 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/528 variables, 4/876 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/528 variables, 2/878 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/528 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (OVERLAPS) 0/528 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 528/528 variables, and 878 constraints, problems are : Problem set: 0 solved, 2 unsolved in 593 ms.
Refiners :[Domain max(s): 351/351 constraints, Positive P Invariants (semi-flows): 176/176 constraints, State Equation: 351/351 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 36/57 variables, 22/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 36/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 10:55:32] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 22/79 variables, 18/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 22/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 10:55:32] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 72/151 variables, 79/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/151 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/295 variables, 107/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/295 variables, 107/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/295 variables, 53/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/295 variables, 2/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 10:55:32] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:55:32] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-26 10:55:33] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/295 variables, 3/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 10:55:33] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/295 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/295 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/296 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/296 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/296 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/296 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 74/370 variables, 52/528 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/370 variables, 52/580 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/370 variables, 26/606 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 10:55:33] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/370 variables, 1/607 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/370 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 44/414 variables, 32/639 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/414 variables, 32/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/414 variables, 16/687 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/414 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 28/442 variables, 20/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/442 variables, 20/727 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/442 variables, 10/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/442 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (OVERLAPS) 22/464 variables, 16/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/464 variables, 16/769 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/464 variables, 8/777 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/464 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (OVERLAPS) 12/476 variables, 8/785 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/476 variables, 8/793 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/476 variables, 4/797 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/476 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (OVERLAPS) 12/488 variables, 8/805 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/488 variables, 8/813 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/488 variables, 4/817 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/488 variables, 0/817 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (OVERLAPS) 12/500 variables, 8/825 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/500 variables, 8/833 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/500 variables, 4/837 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/500 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (OVERLAPS) 12/512 variables, 8/845 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/512 variables, 8/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/512 variables, 4/857 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/512 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (OVERLAPS) 12/524 variables, 8/865 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/524 variables, 8/873 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/524 variables, 4/877 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/524 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (OVERLAPS) 4/528 variables, 4/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/528 variables, 4/885 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/528 variables, 2/887 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/528 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (OVERLAPS) 0/528 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 528/528 variables, and 887 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2628 ms.
Refiners :[Domain max(s): 351/351 constraints, Positive P Invariants (semi-flows): 176/176 constraints, State Equation: 351/351 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 3250ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1409 ms.
Support contains 21 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 177/177 transitions.
Applied a total of 0 rules in 20 ms. Remains 351 /351 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 351/351 places, 177/177 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 177/177 transitions.
Applied a total of 0 rules in 8 ms. Remains 351 /351 variables (removed 0) and now considering 177/177 (removed 0) transitions.
[2024-05-26 10:55:36] [INFO ] Invariant cache hit.
[2024-05-26 10:55:37] [INFO ] Implicit Places using invariants in 289 ms returned [176, 178, 180, 182, 184, 186, 188, 190, 194, 196, 198, 200, 202, 204, 206, 208, 210, 212, 214, 216, 218, 220, 222, 226, 228, 232, 234, 236, 238, 240, 242, 244, 246, 248, 250, 252, 254, 256, 258, 260, 262, 264, 266, 268, 270, 272, 274, 276, 278, 280, 284, 286, 288, 290, 292, 294, 296, 298, 300, 302, 304, 306, 308, 310, 312, 314, 316, 318, 320, 322, 324, 326, 328, 330, 332, 334, 336, 338, 340, 344, 346, 348]
Discarding 82 places :
Implicit Place search using SMT only with invariants took 299 ms to find 82 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 269/351 places, 177/177 transitions.
Applied a total of 0 rules in 6 ms. Remains 269 /269 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 313 ms. Remains : 269/351 places, 177/177 transitions.
RANDOM walk for 40000 steps (16 resets) in 215 ms. (185 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 103 ms. (384 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 728856 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :0 out of 2
Probabilistic random walk after 728856 steps, saw 192457 distinct states, run finished after 3001 ms. (steps per millisecond=242 ) properties seen :0
// Phase 1: matrix 177 rows 269 cols
[2024-05-26 10:55:40] [INFO ] Computed 94 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 35/56 variables, 21/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 35/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9/65 variables, 5/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 9/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 72/137 variables, 65/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 117/254 variables, 80/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/254 variables, 80/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/254 variables, 26/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/254 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/255 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/255 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/255 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/255 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 61/316 variables, 39/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/316 variables, 39/423 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/316 variables, 13/436 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/316 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 36/352 variables, 24/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/352 variables, 24/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/352 variables, 8/492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/352 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 23/375 variables, 15/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/375 variables, 15/522 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/375 variables, 5/527 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/375 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 18/393 variables, 12/539 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/393 variables, 12/551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/393 variables, 4/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/393 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 10/403 variables, 6/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/403 variables, 6/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/403 variables, 2/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/403 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (OVERLAPS) 10/413 variables, 6/575 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/413 variables, 6/581 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/413 variables, 2/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/413 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (OVERLAPS) 10/423 variables, 6/589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/423 variables, 6/595 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/423 variables, 2/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/423 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (OVERLAPS) 10/433 variables, 6/603 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/433 variables, 6/609 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/433 variables, 2/611 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/433 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (OVERLAPS) 10/443 variables, 6/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/443 variables, 6/623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/443 variables, 2/625 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/443 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (OVERLAPS) 3/446 variables, 3/628 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/446 variables, 3/631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/446 variables, 1/632 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/446 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (OVERLAPS) 0/446 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/446 variables, and 632 constraints, problems are : Problem set: 0 solved, 2 unsolved in 450 ms.
Refiners :[Domain max(s): 269/269 constraints, Positive P Invariants (semi-flows): 94/94 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 35/56 variables, 21/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 35/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9/65 variables, 5/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 9/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 10:55:40] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 72/137 variables, 65/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 117/254 variables, 80/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/254 variables, 80/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/254 variables, 26/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/254 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 10:55:40] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/254 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/254 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/255 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/255 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/255 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/255 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 61/316 variables, 39/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/316 variables, 39/427 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/316 variables, 13/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 10:55:41] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/316 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 10:55:41] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/316 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/316 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 36/352 variables, 24/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/352 variables, 24/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/352 variables, 8/498 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 10:55:41] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/352 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/352 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 23/375 variables, 15/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/375 variables, 15/529 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/375 variables, 5/534 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/375 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (OVERLAPS) 18/393 variables, 12/546 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/393 variables, 12/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/393 variables, 4/562 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/393 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (OVERLAPS) 10/403 variables, 6/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/403 variables, 6/574 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/403 variables, 2/576 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/403 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (OVERLAPS) 10/413 variables, 6/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/413 variables, 6/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/413 variables, 2/590 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/413 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (OVERLAPS) 10/423 variables, 6/596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/423 variables, 6/602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/423 variables, 2/604 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/423 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (OVERLAPS) 10/433 variables, 6/610 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/433 variables, 6/616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/433 variables, 2/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/433 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (OVERLAPS) 10/443 variables, 6/624 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/443 variables, 6/630 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/443 variables, 2/632 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/443 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (OVERLAPS) 3/446 variables, 3/635 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/446 variables, 3/638 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/446 variables, 1/639 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 10:55:42] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-26 10:55:42] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
At refinement iteration 63 (INCLUDED_ONLY) 0/446 variables, 2/641 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/446 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (OVERLAPS) 0/446 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 446/446 variables, and 641 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2027 ms.
Refiners :[Domain max(s): 269/269 constraints, Positive P Invariants (semi-flows): 94/94 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 2495ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1282 ms.
Support contains 21 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 177/177 transitions.
Applied a total of 0 rules in 17 ms. Remains 269 /269 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 269/269 places, 177/177 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 177/177 transitions.
Applied a total of 0 rules in 6 ms. Remains 269 /269 variables (removed 0) and now considering 177/177 (removed 0) transitions.
[2024-05-26 10:55:44] [INFO ] Invariant cache hit.
[2024-05-26 10:55:44] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-26 10:55:44] [INFO ] Invariant cache hit.
[2024-05-26 10:55:44] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
[2024-05-26 10:55:44] [INFO ] Redundant transitions in 5 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-26 10:55:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 268/268 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 93/361 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-26 10:55:46] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-05-26 10:55:46] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-26 10:55:46] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-05-26 10:55:46] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 2 ms to minimize.
[2024-05-26 10:55:46] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-26 10:55:46] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 2 ms to minimize.
[2024-05-26 10:55:46] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 7 ms to minimize.
[2024-05-26 10:55:46] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-26 10:55:46] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 5 ms to minimize.
[2024-05-26 10:55:46] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-05-26 10:55:47] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2024-05-26 10:55:47] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-26 10:55:47] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-26 10:55:47] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-26 10:55:47] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 2 ms to minimize.
[2024-05-26 10:55:47] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-26 10:55:47] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-26 10:55:47] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-26 10:55:47] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-26 10:55:47] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 20/381 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-26 10:55:48] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-26 10:55:48] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-26 10:55:48] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 2 ms to minimize.
[2024-05-26 10:55:48] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-26 10:55:48] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-05-26 10:55:48] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 2 ms to minimize.
[2024-05-26 10:55:48] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-26 10:55:48] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-26 10:55:48] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-26 10:55:49] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-05-26 10:55:49] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 8 ms to minimize.
[2024-05-26 10:55:49] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-26 10:55:49] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-26 10:55:49] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-26 10:55:49] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 2 ms to minimize.
[2024-05-26 10:55:49] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-05-26 10:55:49] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-26 10:55:49] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-05-26 10:55:49] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 2 ms to minimize.
[2024-05-26 10:55:49] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 20/401 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-26 10:55:51] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-05-26 10:55:51] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 2 ms to minimize.
[2024-05-26 10:55:51] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-26 10:55:51] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-26 10:55:51] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-26 10:55:51] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-26 10:55:51] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-26 10:55:51] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-26 10:55:51] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-26 10:55:51] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-26 10:55:51] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-26 10:55:52] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-26 10:55:52] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-26 10:55:52] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-26 10:55:52] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-26 10:55:52] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-26 10:55:52] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-26 10:55:52] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-26 10:55:52] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 ms to minimize.
[2024-05-26 10:55:52] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 20/421 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-26 10:55:53] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-26 10:55:53] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-26 10:55:53] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-26 10:55:53] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-26 10:55:53] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-26 10:55:53] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-26 10:55:53] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-05-26 10:55:53] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-26 10:55:53] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-26 10:55:54] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-26 10:55:54] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-26 10:55:54] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-26 10:55:54] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-26 10:55:54] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-26 10:55:54] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-26 10:55:54] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-26 10:55:54] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-26 10:55:54] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-26 10:55:54] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-26 10:55:54] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 20/441 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-26 10:55:55] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-26 10:55:55] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-26 10:55:55] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2024-05-26 10:55:55] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-26 10:55:55] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-26 10:55:55] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-26 10:55:56] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 7/448 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 1/269 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (OVERLAPS) 177/446 variables, 269/719 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 13 (OVERLAPS) 0/446 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/446 variables, and 719 constraints, problems are : Problem set: 0 solved, 175 unsolved in 20133 ms.
Refiners :[Domain max(s): 269/269 constraints, Positive P Invariants (semi-flows): 94/94 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 87/87 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 268/268 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 93/361 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 87/448 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 1/269 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (OVERLAPS) 177/446 variables, 269/719 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 175/894 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/446 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/446 variables, and 894 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30044 ms.
Refiners :[Domain max(s): 269/269 constraints, Positive P Invariants (semi-flows): 94/94 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 87/87 constraints]
After SMT, in 50223ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 50226ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50748 ms. Remains : 269/269 places, 177/177 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 268 transition count 177
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 267 transition count 176
Applied a total of 3 rules in 21 ms. Remains 267 /269 variables (removed 2) and now considering 176/177 (removed 1) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 176 rows 267 cols
[2024-05-26 10:56:34] [INFO ] Computed 93 invariants in 1 ms
[2024-05-26 10:56:34] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-26 10:56:35] [INFO ] [Nat]Absence check using 93 positive place invariants in 12 ms returned sat
[2024-05-26 10:56:35] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-26 10:56:35] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-26 10:56:35] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:56:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 128 ms
TRAPS : Iteration 1
[2024-05-26 10:56:35] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-26 10:56:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
TRAPS : Iteration 2
[2024-05-26 10:56:35] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-26 10:56:35] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:56:35] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:56:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 168 ms
TRAPS : Iteration 3
[2024-05-26 10:56:36] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-26 10:56:36] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:56:36] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 10:56:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 177 ms
TRAPS : Iteration 4
[2024-05-26 10:56:36] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 10:56:36] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-26 10:56:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 146 ms
TRAPS : Iteration 5
[2024-05-26 10:56:36] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:56:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
TRAPS : Iteration 6
[2024-05-26 10:56:36] [INFO ] After 1663ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-26 10:56:36] [INFO ] After 1877ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-26 10:56:36] [INFO ] Flatten gal took : 15 ms
[2024-05-26 10:56:36] [INFO ] Flatten gal took : 30 ms
[2024-05-26 10:56:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3989177890014669123.gal : 15 ms
[2024-05-26 10:56:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9600244985094705332.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/ReachabilityCardinality3989177890014669123.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9600244985094705332.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality9600244985094705332.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 32
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :32 after 448
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :448 after 14336
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :14336 after 1.67772e+07
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.67772e+07 after 7.03687e+13
Detected timeout of ITS tools.
[2024-05-26 10:56:52] [INFO ] Flatten gal took : 16 ms
[2024-05-26 10:56:52] [INFO ] Applying decomposition
[2024-05-26 10:56:52] [INFO ] Flatten gal took : 15 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/graph1503488681837641195.txt' '-o' '/tmp/graph1503488681837641195.bin' '-w' '/tmp/graph1503488681837641195.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1503488681837641195.bin' '-l' '-1' '-v' '-w' '/tmp/graph1503488681837641195.weights' '-q' '0' '-e' '0.001'
[2024-05-26 10:56:52] [INFO ] Decomposing Gal with order
[2024-05-26 10:56:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 10:56:52] [INFO ] Flatten gal took : 46 ms
[2024-05-26 10:56:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-26 10:56:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2718857146917288599.gal : 5 ms
[2024-05-26 10:56:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18283912753226796464.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/ReachabilityCardinality2718857146917288599.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18283912753226796464.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality18283912753226796464.prop.
Reachability property ResAllocation-PT-R100C002-ReachabilityCardinality-2024-03 is true.
SDD proceeding with computation,1 properties remain. new max is 2
SDD size :1 after 9.67141e+24
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :9.67141e+24 after 7.73713e+25
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1.12188e+27 after 1.52808e+27
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.36173e+28,0.247065,14348,140,17,28404,107,316,27958,37,316,0
Total reachable state count : 13617340432139183023890366464

Verifying 2 reachability properties.
Reachability property ResAllocation-PT-R100C002-ReachabilityCardinality-2024-03 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ResAllocation-PT-R100C002-ReachabilityCardinality-2024-03,1.20893e+25,0.256685,14608,71,18,28404,107,376,27958,44,316,207
Invariant property ResAllocation-PT-R100C002-ReachabilityCardinality-2024-09 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ResAllocation-PT-R100C002-ReachabilityCardinality-2024-09,0,0.257475,14608,1,0,28404,107,383,27958,44,316,328
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-2024-09 TRUE TECHNIQUES OVER_APPROXIMATION
Over-approximation ignoring read arcs solved -1 properties in 17695 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-26 10:56:52] [INFO ] Flatten gal took : 15 ms
[2024-05-26 10:56:52] [INFO ] Applying decomposition
[2024-05-26 10:56:52] [INFO ] Flatten gal took : 14 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/graph9241281212391384189.txt' '-o' '/tmp/graph9241281212391384189.bin' '-w' '/tmp/graph9241281212391384189.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9241281212391384189.bin' '-l' '-1' '-v' '-w' '/tmp/graph9241281212391384189.weights' '-q' '0' '-e' '0.001'
[2024-05-26 10:56:52] [INFO ] Decomposing Gal with order
[2024-05-26 10:56:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 10:56:52] [INFO ] Flatten gal took : 21 ms
[2024-05-26 10:56:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-26 10:56:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8955063344345974885.gal : 6 ms
[2024-05-26 10:56:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11916482055006776137.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/ReachabilityCardinality8955063344345974885.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11916482055006776137.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality11916482055006776137.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,6.46502e+31,0.475612,22196,332,7,45003,117,415,57001,17,124,0
Total reachable state count : 64650180611639699476331863474176

Verifying 1 reachability properties.
Reachability property ResAllocation-PT-R100C002-ReachabilityCardinality-2024-03 is true.
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ResAllocation-PT-R100C002-ReachabilityCardinality-2024-03,5.94211e+28,0.478134,22196,142,7,45003,117,430,57001,22,124,382
All properties solved without resorting to model-checking.
Total runtime 92838 ms.

BK_STOP 1716721013340

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="ResAllocation-PT-R100C002"
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 ResAllocation-PT-R100C002, 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 r312-tall-171662339500886"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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