Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 29K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 12 17:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 17:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 625K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-2023-10
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717271930102

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-050B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:58:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 19:58:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:58:51] [INFO ] Load time of PNML (sax parser for PT used): 179 ms
[2024-06-01 19:58:51] [INFO ] Transformed 2003 places.
[2024-06-01 19:58:51] [INFO ] Transformed 2253 transitions.
[2024-06-01 19:58:51] [INFO ] Found NUPN structural information;
[2024-06-01 19:58:51] [INFO ] Parsed PT model containing 2003 places and 2253 transitions and 7200 arcs in 340 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (16 resets) in 2012 ms. (19 steps per ms) remains 3/16 properties
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 3/3 properties
// Phase 1: matrix 2253 rows 2003 cols
[2024-06-01 19:58:52] [INFO ] Computed 201 invariants in 27 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1182/1228 variables, 116/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1228 variables, 1182/1344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1228 variables, 0/1344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 775/2003 variables, 85/1429 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2003 variables, 775/2204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2003 variables, 0/2204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2253/4256 variables, 2003/4207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4256 variables, 0/4207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/4256 variables, 0/4207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4256/4256 variables, and 4207 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1803 ms.
Refiners :[Domain max(s): 2003/2003 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 2003/2003 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/46 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1182/1228 variables, 116/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1228 variables, 1182/1344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:58:55] [INFO ] Deduced a trap composed of 39 places in 351 ms of which 55 ms to minimize.
[2024-06-01 19:58:55] [INFO ] Deduced a trap composed of 54 places in 305 ms of which 5 ms to minimize.
[2024-06-01 19:58:55] [INFO ] Deduced a trap composed of 39 places in 272 ms of which 4 ms to minimize.
[2024-06-01 19:58:56] [INFO ] Deduced a trap composed of 50 places in 250 ms of which 4 ms to minimize.
[2024-06-01 19:58:56] [INFO ] Deduced a trap composed of 54 places in 243 ms of which 5 ms to minimize.
[2024-06-01 19:58:56] [INFO ] Deduced a trap composed of 59 places in 246 ms of which 7 ms to minimize.
[2024-06-01 19:58:56] [INFO ] Deduced a trap composed of 71 places in 210 ms of which 5 ms to minimize.
[2024-06-01 19:58:57] [INFO ] Deduced a trap composed of 56 places in 206 ms of which 4 ms to minimize.
[2024-06-01 19:58:57] [INFO ] Deduced a trap composed of 62 places in 200 ms of which 4 ms to minimize.
[2024-06-01 19:58:57] [INFO ] Deduced a trap composed of 53 places in 201 ms of which 4 ms to minimize.
[2024-06-01 19:58:57] [INFO ] Deduced a trap composed of 55 places in 184 ms of which 4 ms to minimize.
[2024-06-01 19:58:57] [INFO ] Deduced a trap composed of 55 places in 175 ms of which 4 ms to minimize.
[2024-06-01 19:58:58] [INFO ] Deduced a trap composed of 53 places in 185 ms of which 3 ms to minimize.
[2024-06-01 19:58:58] [INFO ] Deduced a trap composed of 63 places in 181 ms of which 3 ms to minimize.
[2024-06-01 19:58:58] [INFO ] Deduced a trap composed of 62 places in 187 ms of which 4 ms to minimize.
[2024-06-01 19:58:58] [INFO ] Deduced a trap composed of 57 places in 184 ms of which 4 ms to minimize.
[2024-06-01 19:58:59] [INFO ] Deduced a trap composed of 65 places in 185 ms of which 4 ms to minimize.
[2024-06-01 19:58:59] [INFO ] Deduced a trap composed of 71 places in 181 ms of which 3 ms to minimize.
[2024-06-01 19:58:59] [INFO ] Deduced a trap composed of 68 places in 183 ms of which 4 ms to minimize.
[2024-06-01 19:58:59] [INFO ] Deduced a trap composed of 52 places in 176 ms of which 4 ms to minimize.
SMT process timed out in 7006ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 46 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2253/2253 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 189 transitions
Trivial Post-agglo rules discarded 189 transitions
Performed 189 trivial Post agglomeration. Transition count delta: 189
Iterating post reduction 0 with 189 rules applied. Total rules applied 189 place count 2003 transition count 2064
Reduce places removed 189 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 193 rules applied. Total rules applied 382 place count 1814 transition count 2060
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 386 place count 1810 transition count 2060
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 248 Pre rules applied. Total rules applied 386 place count 1810 transition count 1812
Deduced a syphon composed of 248 places in 6 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 3 with 496 rules applied. Total rules applied 882 place count 1562 transition count 1812
Discarding 329 places :
Symmetric choice reduction at 3 with 329 rule applications. Total rules 1211 place count 1233 transition count 1483
Iterating global reduction 3 with 329 rules applied. Total rules applied 1540 place count 1233 transition count 1483
Performed 137 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 137 Pre rules applied. Total rules applied 1540 place count 1233 transition count 1346
Deduced a syphon composed of 137 places in 7 ms
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 274 rules applied. Total rules applied 1814 place count 1096 transition count 1346
Performed 343 Post agglomeration using F-continuation condition.Transition count delta: 343
Deduced a syphon composed of 343 places in 4 ms
Reduce places removed 343 places and 0 transitions.
Iterating global reduction 3 with 686 rules applied. Total rules applied 2500 place count 753 transition count 1003
Partial Free-agglomeration rule applied 99 times.
Drop transitions (Partial Free agglomeration) removed 99 transitions
Iterating global reduction 3 with 99 rules applied. Total rules applied 2599 place count 753 transition count 1003
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2600 place count 752 transition count 1002
Applied a total of 2600 rules in 566 ms. Remains 752 /2003 variables (removed 1251) and now considering 1002/2253 (removed 1251) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 574 ms. Remains : 752/2003 places, 1002/2253 transitions.
RANDOM walk for 40000 steps (60 resets) in 448 ms. (89 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 2/3 properties
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 1002 rows 752 cols
[2024-06-01 19:59:00] [INFO ] Computed 201 invariants in 20 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 85/100 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:59:00] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-06-01 19:59:00] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
Problem ShieldRVs-PT-050B-ReachabilityCardinality-2024-09 is UNSAT
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 2/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 296/396 variables, 82/105 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 0/105 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 587/983 variables, 396/501 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/983 variables, 0/501 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 324/1307 variables, 124/625 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1307 variables, 25/650 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1307 variables, 0/650 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 21/1328 variables, 12/662 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1328 variables, 17/679 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1328 variables, 0/679 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/1336 variables, 3/682 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1336 variables, 5/687 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1336 variables, 0/687 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 191/1527 variables, 98/785 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1527 variables, 23/808 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1527 variables, 0/808 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 9/1536 variables, 5/813 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1536 variables, 9/822 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1536 variables, 0/822 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 95/1631 variables, 38/860 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1631 variables, 10/870 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1631 variables, 0/870 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 6/1637 variables, 3/873 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1637 variables, 6/879 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1637 variables, 0/879 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 88/1725 variables, 36/915 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1725 variables, 7/922 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1725 variables, 0/922 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 9/1734 variables, 5/927 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1734 variables, 7/934 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1734 variables, 0/934 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 2/1736 variables, 1/935 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1736 variables, 1/936 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1736 variables, 0/936 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 18/1754 variables, 15/951 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1754 variables, 4/955 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1754 variables, 0/955 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 0/1754 variables, 0/955 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1754/1754 variables, and 955 constraints, problems are : Problem set: 1 solved, 1 unsolved in 688 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 752/752 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/28 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 326/354 variables, 90/95 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 2/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 19:59:01] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 2 ms to minimize.
[2024-06-01 19:59:01] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:59:01] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:59:01] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:59:01] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:59:01] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:59:01] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:59:01] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-06-01 19:59:01] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-06-01 19:59:01] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-06-01 19:59:02] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-06-01 19:59:02] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 2 ms to minimize.
[2024-06-01 19:59:02] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 13/110 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 0/110 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 514/868 variables, 354/464 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 19:59:02] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:59:02] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/868 variables, 2/466 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/868 variables, 0/466 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 248/1116 variables, 88/554 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1116 variables, 14/568 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1116 variables, 1/569 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 19:59:02] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:59:02] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:59:02] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:59:02] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:59:02] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1116 variables, 5/574 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1116 variables, 0/574 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 21/1137 variables, 12/586 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1137 variables, 17/603 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1137 variables, 0/603 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 8/1145 variables, 3/606 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1145 variables, 5/611 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1145 variables, 0/611 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 179/1324 variables, 88/699 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1324 variables, 19/718 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1324 variables, 0/718 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 12/1336 variables, 6/724 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1336 variables, 10/734 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 19:59:03] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:59:03] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1336 variables, 2/736 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1336 variables, 0/736 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 2/1338 variables, 1/737 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1338 variables, 2/739 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1338 variables, 0/739 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 60/1398 variables, 30/769 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1398 variables, 7/776 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 19:59:03] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:59:03] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/1398 variables, 2/778 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 19:59:03] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/1398 variables, 1/779 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1398 variables, 0/779 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 4/1402 variables, 2/781 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1402 variables, 2/783 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1402 variables, 0/783 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 34/1436 variables, 16/799 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1436 variables, 4/803 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1436 variables, 0/803 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 2/1438 variables, 1/804 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1438 variables, 2/806 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1438 variables, 0/806 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 31/1469 variables, 12/818 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1469 variables, 3/821 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1469 variables, 0/821 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 2/1471 variables, 1/822 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1471 variables, 2/824 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1471 variables, 0/824 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 32/1503 variables, 12/836 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1503 variables, 3/839 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1503 variables, 0/839 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 3/1506 variables, 1/840 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1506 variables, 3/843 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1506 variables, 0/843 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 31/1537 variables, 12/855 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1537 variables, 3/858 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1537 variables, 0/858 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 2/1539 variables, 1/859 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1539 variables, 2/861 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1539 variables, 0/861 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 33/1572 variables, 12/873 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1572 variables, 2/875 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1572 variables, 0/875 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 66 (OVERLAPS) 4/1576 variables, 2/877 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1576 variables, 4/881 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1576 variables, 0/881 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 34/1610 variables, 12/893 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1610 variables, 2/895 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 19:59:04] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 2 ms to minimize.
At refinement iteration 71 (INCLUDED_ONLY) 0/1610 variables, 1/896 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1610 variables, 0/896 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 6/1616 variables, 2/898 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1616 variables, 4/902 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1616 variables, 0/902 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 33/1649 variables, 14/916 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1649 variables, 3/919 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1649 variables, 0/919 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 3/1652 variables, 1/920 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1652 variables, 3/923 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1652 variables, 0/923 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 82 (OVERLAPS) 31/1683 variables, 12/935 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1683 variables, 3/938 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1683 variables, 0/938 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 85 (OVERLAPS) 2/1685 variables, 1/939 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1685 variables, 2/941 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1685 variables, 0/941 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 88 (OVERLAPS) 31/1716 variables, 12/953 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1716 variables, 3/956 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 19:59:04] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 2 ms to minimize.
At refinement iteration 90 (INCLUDED_ONLY) 0/1716 variables, 1/957 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1716 variables, 0/957 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 92 (OVERLAPS) 2/1718 variables, 1/958 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1718 variables, 2/960 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1718 variables, 0/960 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 95 (OVERLAPS) 29/1747 variables, 12/972 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1747 variables, 2/974 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1747 variables, 0/974 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 98 (OVERLAPS) 4/1751 variables, 2/976 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1751 variables, 2/978 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1751 variables, 0/978 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 101 (OVERLAPS) 2/1753 variables, 1/979 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1753 variables, 1/980 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1753 variables, 0/980 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 104 (OVERLAPS) 1/1754 variables, 3/983 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1754 variables, 0/983 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 106 (OVERLAPS) 0/1754 variables, 0/983 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1754/1754 variables, and 983 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3454 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 752/752 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 29/29 constraints]
After SMT, in 4180ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 144 ms.
Support contains 5 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1002/1002 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 752 transition count 996
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 746 transition count 996
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 12 place count 746 transition count 994
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 744 transition count 994
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 5 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 76 place count 714 transition count 964
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 79 place count 714 transition count 964
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 86 place count 707 transition count 957
Applied a total of 86 rules in 171 ms. Remains 707 /752 variables (removed 45) and now considering 957/1002 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 707/752 places, 957/1002 transitions.
RANDOM walk for 40000 steps (67 resets) in 325 ms. (122 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 161 ms. (246 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 517836 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :0 out of 1
Probabilistic random walk after 517836 steps, saw 508774 distinct states, run finished after 3006 ms. (steps per millisecond=172 ) properties seen :0
// Phase 1: matrix 957 rows 707 cols
[2024-06-01 19:59:08] [INFO ] Computed 201 invariants in 9 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/26 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/32 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:59:08] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 89/121 variables, 32/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 271/392 variables, 98/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 24/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 10/402 variables, 5/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/402 variables, 10/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/402 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 236/638 variables, 106/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/638 variables, 28/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/638 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/650 variables, 6/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/650 variables, 12/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/650 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 151/801 variables, 64/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/801 variables, 17/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/801 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 8/809 variables, 4/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/809 variables, 8/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/809 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 126/935 variables, 50/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/935 variables, 13/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:59:08] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/935 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/935 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 8/943 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/943 variables, 8/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/943 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 104/1047 variables, 46/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1047 variables, 12/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1047 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 36 (OVERLAPS) 6/1053 variables, 3/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1053 variables, 6/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1053 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 64/1117 variables, 26/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1117 variables, 7/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:59:08] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 2 ms to minimize.
[2024-06-01 19:59:09] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/1117 variables, 2/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1117 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 4/1121 variables, 2/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1121 variables, 4/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1121 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 62/1183 variables, 24/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1183 variables, 6/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:59:09] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
At refinement iteration 48 (INCLUDED_ONLY) 0/1183 variables, 1/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1183 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 4/1187 variables, 2/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1187 variables, 4/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1187 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 62/1249 variables, 24/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1249 variables, 6/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1249 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 4/1253 variables, 2/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1253 variables, 4/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1253 variables, 0/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 62/1315 variables, 24/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1315 variables, 6/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1315 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 4/1319 variables, 2/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1319 variables, 4/715 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1319 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 62/1381 variables, 24/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1381 variables, 6/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1381 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 4/1385 variables, 2/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1385 variables, 4/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1385 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 62/1447 variables, 24/775 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1447 variables, 6/781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1447 variables, 0/781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 4/1451 variables, 2/783 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1451 variables, 4/787 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1451 variables, 0/787 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 62/1513 variables, 24/811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1513 variables, 6/817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1513 variables, 0/817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 4/1517 variables, 2/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1517 variables, 4/823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1517 variables, 0/823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 57/1574 variables, 23/846 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1574 variables, 6/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1574 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 4/1578 variables, 2/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1578 variables, 4/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1578 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (OVERLAPS) 33/1611 variables, 14/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1611 variables, 4/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1611 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (OVERLAPS) 2/1613 variables, 1/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1613 variables, 2/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1613 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (OVERLAPS) 31/1644 variables, 12/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1644 variables, 3/894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1644 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (OVERLAPS) 2/1646 variables, 1/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1646 variables, 2/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1646 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (OVERLAPS) 18/1664 variables, 12/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1664 variables, 4/913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1664 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (OVERLAPS) 0/1664 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1664/1664 variables, and 913 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1483 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 707/707 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/26 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/32 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 89/121 variables, 32/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 271/392 variables, 98/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 24/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:59:09] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:59:09] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/392 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/402 variables, 5/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/402 variables, 10/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/402 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 236/638 variables, 106/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/638 variables, 28/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:59:10] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/638 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/638 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 12/650 variables, 6/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/650 variables, 12/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/650 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 151/801 variables, 64/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/801 variables, 17/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:59:10] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/801 variables, 1/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/801 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 8/809 variables, 4/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/809 variables, 8/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/809 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 126/935 variables, 50/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/935 variables, 13/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/935 variables, 1/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/935 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 8/943 variables, 4/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/943 variables, 8/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/943 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 104/1047 variables, 46/549 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1047 variables, 12/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1047 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 6/1053 variables, 3/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1053 variables, 6/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1053 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 64/1117 variables, 26/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1117 variables, 7/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1117 variables, 2/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1117 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 4/1121 variables, 2/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1121 variables, 4/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1121 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 62/1183 variables, 24/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1183 variables, 6/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1183 variables, 1/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1183 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 4/1187 variables, 2/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1187 variables, 4/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1187 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 62/1249 variables, 24/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1249 variables, 6/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:59:10] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
At refinement iteration 60 (INCLUDED_ONLY) 0/1249 variables, 1/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1249 variables, 0/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 4/1253 variables, 2/681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1253 variables, 4/685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1253 variables, 0/685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 62/1315 variables, 24/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1315 variables, 6/715 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:59:10] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
At refinement iteration 67 (INCLUDED_ONLY) 0/1315 variables, 1/716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1315 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 4/1319 variables, 2/718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1319 variables, 4/722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1319 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 62/1381 variables, 24/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1381 variables, 6/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1381 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (OVERLAPS) 4/1385 variables, 2/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1385 variables, 4/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1385 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (OVERLAPS) 62/1447 variables, 24/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1447 variables, 6/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1447 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (OVERLAPS) 4/1451 variables, 2/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1451 variables, 4/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1451 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (OVERLAPS) 62/1513 variables, 24/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1513 variables, 6/824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1513 variables, 0/824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (OVERLAPS) 4/1517 variables, 2/826 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1517 variables, 4/830 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1517 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (OVERLAPS) 57/1574 variables, 23/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1574 variables, 6/859 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1574 variables, 0/859 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (OVERLAPS) 4/1578 variables, 2/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1578 variables, 4/865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1578 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (OVERLAPS) 33/1611 variables, 14/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1611 variables, 4/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1611 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (OVERLAPS) 2/1613 variables, 1/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1613 variables, 2/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1613 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (OVERLAPS) 31/1644 variables, 12/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1644 variables, 3/901 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1644 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (OVERLAPS) 2/1646 variables, 1/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1646 variables, 2/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1646 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (OVERLAPS) 18/1664 variables, 12/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1664 variables, 4/920 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:59:11] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
At refinement iteration 110 (INCLUDED_ONLY) 0/1664 variables, 1/921 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1664 variables, 0/921 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (OVERLAPS) 0/1664 variables, 0/921 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1664/1664 variables, and 921 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1535 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 707/707 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints]
After SMT, in 3047ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 115 ms.
Support contains 5 out of 707 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 707/707 places, 957/957 transitions.
Applied a total of 0 rules in 20 ms. Remains 707 /707 variables (removed 0) and now considering 957/957 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 707/707 places, 957/957 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 707/707 places, 957/957 transitions.
Applied a total of 0 rules in 19 ms. Remains 707 /707 variables (removed 0) and now considering 957/957 (removed 0) transitions.
[2024-06-01 19:59:11] [INFO ] Invariant cache hit.
[2024-06-01 19:59:11] [INFO ] Implicit Places using invariants in 424 ms returned []
[2024-06-01 19:59:11] [INFO ] Invariant cache hit.
[2024-06-01 19:59:12] [INFO ] Implicit Places using invariants and state equation in 801 ms returned []
Implicit Place search using SMT with State Equation took 1243 ms to find 0 implicit places.
[2024-06-01 19:59:12] [INFO ] Redundant transitions in 208 ms returned []
Running 954 sub problems to find dead transitions.
[2024-06-01 19:59:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/705 variables, 197/197 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 19:59:23] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-06-01 19:59:23] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-06-01 19:59:23] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-06-01 19:59:23] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-06-01 19:59:23] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-06-01 19:59:23] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-06-01 19:59:23] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:59:23] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2024-06-01 19:59:23] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-06-01 19:59:23] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-06-01 19:59:23] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-06-01 19:59:23] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-06-01 19:59:23] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:59:23] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-06-01 19:59:23] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-06-01 19:59:23] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:59:24] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2024-06-01 19:59:24] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:59:24] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-06-01 19:59:24] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/705 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 19:59:24] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
[2024-06-01 19:59:24] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-06-01 19:59:24] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-06-01 19:59:24] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-06-01 19:59:24] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 19:59:25] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:59:25] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:59:25] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 2 ms to minimize.
[2024-06-01 19:59:25] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 2 ms to minimize.
[2024-06-01 19:59:25] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 2 ms to minimize.
[2024-06-01 19:59:25] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 2 ms to minimize.
[2024-06-01 19:59:25] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-06-01 19:59:25] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:59:25] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-06-01 19:59:25] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-06-01 19:59:25] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:59:26] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 2 ms to minimize.
[2024-06-01 19:59:26] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-06-01 19:59:26] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-06-01 19:59:26] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/705 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 19:59:26] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-06-01 19:59:26] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-06-01 19:59:26] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-06-01 19:59:26] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-06-01 19:59:26] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-06-01 19:59:26] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 19:59:27] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:59:27] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:59:27] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:59:27] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:59:27] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 2 ms to minimize.
[2024-06-01 19:59:27] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 1 ms to minimize.
[2024-06-01 19:59:27] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
[2024-06-01 19:59:28] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 1 ms to minimize.
[2024-06-01 19:59:28] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-06-01 19:59:28] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:59:28] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 2 ms to minimize.
[2024-06-01 19:59:28] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 2 ms to minimize.
[2024-06-01 19:59:28] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-06-01 19:59:28] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/705 variables, 20/257 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 19:59:38] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:59:38] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:59:38] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:59:38] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-06-01 19:59:38] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-06-01 19:59:38] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 1 ms to minimize.
[2024-06-01 19:59:39] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:59:39] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:59:39] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:59:39] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:59:39] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 0 ms to minimize.
[2024-06-01 19:59:39] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:59:39] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 2 ms to minimize.
[2024-06-01 19:59:39] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 2 ms to minimize.
[2024-06-01 19:59:39] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-06-01 19:59:40] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 1 ms to minimize.
[2024-06-01 19:59:40] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:59:40] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:59:40] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:59:40] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/705 variables, 20/277 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 19:59:40] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 2 ms to minimize.
[2024-06-01 19:59:41] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 2 ms to minimize.
[2024-06-01 19:59:41] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 2 ms to minimize.
[2024-06-01 19:59:41] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 2 ms to minimize.
[2024-06-01 19:59:41] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
[2024-06-01 19:59:41] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:59:41] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 1 ms to minimize.
[2024-06-01 19:59:42] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 1 ms to minimize.
[2024-06-01 19:59:42] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:59:42] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 2 ms to minimize.
[2024-06-01 19:59:42] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-06-01 19:59:42] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 2 ms to minimize.
[2024-06-01 19:59:42] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-06-01 19:59:42] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 1 ms to minimize.
[2024-06-01 19:59:42] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-06-01 19:59:43] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 1 ms to minimize.
[2024-06-01 19:59:43] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 2 ms to minimize.
[2024-06-01 19:59:43] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2024-06-01 19:59:43] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 1 ms to minimize.
SMT process timed out in 30443ms, After SMT, problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 30459ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31959 ms. Remains : 707/707 places, 957/957 transitions.
[2024-06-01 19:59:43] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 10 ms.
[2024-06-01 19:59:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 707 places, 957 transitions and 4614 arcs took 13 ms.
[2024-06-01 19:59:43] [INFO ] Flatten gal took : 125 ms
Total runtime 52464 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ShieldRVs-PT-050B-ReachabilityCardinality-2023-10

BK_STOP 1717271983992

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name ShieldRVs-PT-050B-ReachabilityCardinality-2023-10
rfs formula type EF
rfs formula formula --invariant=/tmp/1012/inv_0_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldRVs-PT-050B, examination is 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 r528-tall-171683762000862"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-050B.tgz
mv ShieldRVs-PT-050B execution
cd execution
if [ "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 ;