Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r356-tall-171683760900334.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 ShieldIIPt-PT-050B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760900334
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 20:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 20:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 12 20:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 12 20:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 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 860K 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 ShieldIIPt-PT-050B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716945275125

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-050B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-29 01:14:36] [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-29 01:14:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 01:14:36] [INFO ] Load time of PNML (sax parser for PT used): 193 ms
[2024-05-29 01:14:36] [INFO ] Transformed 3503 places.
[2024-05-29 01:14:36] [INFO ] Transformed 3253 transitions.
[2024-05-29 01:14:36] [INFO ] Found NUPN structural information;
[2024-05-29 01:14:36] [INFO ] Parsed PT model containing 3503 places and 3253 transitions and 8106 arcs in 427 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2326 ms. (17 steps per ms) remains 7/14 properties
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-29 01:14:37] [INFO ] Flatten gal took : 373 ms
[2024-05-29 01:14:37] [INFO ] Flatten gal took : 179 ms
BEST_FIRST walk for 40004 steps (8 resets) in 968 ms. (41 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 177 ms. (224 steps per ms) remains 7/7 properties
[2024-05-29 01:14:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15506412677063941297.gal : 128 ms
[2024-05-29 01:14:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16100534912899040223.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/ReachabilityCardinality15506412677063941297.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16100534912899040223.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 ...330
BEST_FIRST walk for 40004 steps (8 resets) in 1604 ms. (24 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 195 ms. (204 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 7/7 properties
Loading property file /tmp/ReachabilityCardinality16100534912899040223.prop.
// Phase 1: matrix 3253 rows 3503 cols
[2024-05-29 01:14:38] [INFO ] Computed 451 invariants in 93 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 3328/3448 variables, 443/563 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3448 variables, 3328/3891 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3448 variables, 0/3891 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 55/3503 variables, 8/3899 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3503 variables, 55/3954 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3503 variables, 0/3954 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SMT process timed out in 5466ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 120 out of 3503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3503/3503 places, 3253/3253 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 760 transitions
Trivial Post-agglo rules discarded 760 transitions
Performed 760 trivial Post agglomeration. Transition count delta: 760
Iterating post reduction 0 with 760 rules applied. Total rules applied 760 place count 3503 transition count 2493
Reduce places removed 760 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 762 rules applied. Total rules applied 1522 place count 2743 transition count 2491
Reduce places removed 1 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 2 with 31 rules applied. Total rules applied 1553 place count 2742 transition count 2461
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 1583 place count 2712 transition count 2461
Performed 210 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 210 Pre rules applied. Total rules applied 1583 place count 2712 transition count 2251
Deduced a syphon composed of 210 places in 5 ms
Reduce places removed 210 places and 0 transitions.
Iterating global reduction 4 with 420 rules applied. Total rules applied 2003 place count 2502 transition count 2251
Discarding 322 places :
Symmetric choice reduction at 4 with 322 rule applications. Total rules 2325 place count 2180 transition count 1929
Iterating global reduction 4 with 322 rules applied. Total rules applied 2647 place count 2180 transition count 1929
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 131 Pre rules applied. Total rules applied 2647 place count 2180 transition count 1798
Deduced a syphon composed of 131 places in 12 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 4 with 262 rules applied. Total rules applied 2909 place count 2049 transition count 1798
Performed 798 Post agglomeration using F-continuation condition.Transition count delta: 798
Deduced a syphon composed of 798 places in 20 ms
Reduce places removed 798 places and 0 transitions.
Iterating global reduction 4 with 1596 rules applied. Total rules applied 4505 place count 1251 transition count 1000
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -53
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4707 place count 1150 transition count 1053
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 4755 place count 1126 transition count 1066
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4756 place count 1126 transition count 1065
Free-agglomeration rule applied 9 times.
Iterating global reduction 5 with 9 rules applied. Total rules applied 4765 place count 1126 transition count 1056
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 4774 place count 1117 transition count 1056
Partial Free-agglomeration rule applied 46 times.
Drop transitions (Partial Free agglomeration) removed 46 transitions
Iterating global reduction 6 with 46 rules applied. Total rules applied 4820 place count 1117 transition count 1056
Applied a total of 4820 rules in 2308 ms. Remains 1117 /3503 variables (removed 2386) and now considering 1056/3253 (removed 2197) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2323 ms. Remains : 1117/3503 places, 1056/3253 transitions.
RANDOM walk for 40000 steps (8 resets) in 1769 ms. (22 steps per ms) remains 6/7 properties
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 670 ms. (59 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 747 ms. (53 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 673 ms. (59 steps per ms) remains 5/6 properties
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 558 ms. (71 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 405 ms. (98 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 411 ms. (97 steps per ms) remains 5/5 properties
// Phase 1: matrix 1056 rows 1117 cols
[2024-05-29 01:14:48] [INFO ] Computed 451 invariants in 5 ms
[2024-05-29 01:14:48] [INFO ] State equation strengthened by 352 read => feed constraints.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :19 after 36
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :36 after 63
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :63 after 643
At refinement iteration 1 (OVERLAPS) 281/355 variables, 107/107 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :643 after 9223
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :9223 after 5.67589e+08
Invariant property ShieldIIPt-PT-050B-ReachabilityCardinality-2024-09 does not hold.
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :5.67589e+08 after 4.34846e+18
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :4.34846e+18 after 4.96889e+28
At refinement iteration 3 (OVERLAPS) 762/1117 variables, 344/451 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :4.96889e+28 after 2.90022e+49
At refinement iteration 4 (INCLUDED_ONLY) 0/1117 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :2.90022e+49 after 1.5587e+93
At refinement iteration 5 (OVERLAPS) 1056/2173 variables, 1117/1568 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2173 variables, 352/1920 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2173 variables, 0/1920 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/2173 variables, 0/1920 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2173/2173 variables, and 1920 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1771 ms.
Refiners :[Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 1117/1117 constraints, ReadFeed: 352/352 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 281/355 variables, 107/107 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 01:14:50] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 13 ms to minimize.
[2024-05-29 01:14:50] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 1 ms to minimize.
[2024-05-29 01:14:50] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-29 01:14:50] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-29 01:14:50] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-29 01:14:50] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-05-29 01:14:50] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-29 01:14:50] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 8/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 762/1117 variables, 344/459 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 01:14:51] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 2 ms to minimize.
[2024-05-29 01:14:51] [INFO ] Deduced a trap composed of 5 places in 277 ms of which 9 ms to minimize.
[2024-05-29 01:14:52] [INFO ] Deduced a trap composed of 7 places in 593 ms of which 3 ms to minimize.
[2024-05-29 01:14:52] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 4 ms to minimize.
[2024-05-29 01:14:52] [INFO ] Deduced a trap composed of 8 places in 515 ms of which 25 ms to minimize.
[2024-05-29 01:14:52] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 2 ms to minimize.
[2024-05-29 01:14:52] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-29 01:14:53] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 2 ms to minimize.
[2024-05-29 01:14:53] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 2 ms to minimize.
[2024-05-29 01:14:53] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 1 ms to minimize.
[2024-05-29 01:14:53] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 2 ms to minimize.
[2024-05-29 01:14:53] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 2 ms to minimize.
[2024-05-29 01:14:53] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 2 ms to minimize.
[2024-05-29 01:14:53] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 2 ms to minimize.
[2024-05-29 01:14:54] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 2 ms to minimize.
[2024-05-29 01:14:54] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 2 ms to minimize.
[2024-05-29 01:14:54] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 2 ms to minimize.
[2024-05-29 01:14:54] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 2 ms to minimize.
[2024-05-29 01:14:54] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-29 01:14:54] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1117 variables, 20/479 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 01:14:54] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 2 ms to minimize.
[2024-05-29 01:14:54] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-05-29 01:14:54] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 2 ms to minimize.
[2024-05-29 01:14:55] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 2 ms to minimize.
[2024-05-29 01:14:55] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
[2024-05-29 01:14:55] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 2 ms to minimize.
[2024-05-29 01:14:55] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1117 variables, 7/486 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1117 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1056/2173 variables, 1117/1603 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2173 variables, 352/1955 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2173 variables, 5/1960 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 01:14:58] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 2 ms to minimize.
[2024-05-29 01:14:58] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 3 ms to minimize.
[2024-05-29 01:14:58] [INFO ] Deduced a trap composed of 9 places in 384 ms of which 1 ms to minimize.
[2024-05-29 01:14:58] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 4 ms to minimize.
[2024-05-29 01:14:59] [INFO ] Deduced a trap composed of 6 places in 239 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2173 variables, 5/1965 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 01:15:00] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 2 ms to minimize.
[2024-05-29 01:15:00] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2173 variables, 2/1967 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2173 variables, 0/1967 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/2173 variables, 0/1967 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2173/2173 variables, and 1967 constraints, problems are : Problem set: 0 solved, 5 unsolved in 12249 ms.
Refiners :[Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 1117/1117 constraints, ReadFeed: 352/352 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 42/42 constraints]
After SMT, in 14097ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 5452 ms.
Support contains 74 out of 1117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1117/1117 places, 1056/1056 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1117 transition count 1046
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 1107 transition count 1045
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 1106 transition count 1045
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 22 place count 1106 transition count 1034
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 44 place count 1095 transition count 1034
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 45 place count 1094 transition count 1033
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 1094 transition count 1033
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 112 place count 1061 transition count 1000
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 126 place count 1054 transition count 1007
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 1054 transition count 1006
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 128 place count 1053 transition count 1006
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 131 place count 1053 transition count 1006
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 132 place count 1052 transition count 1005
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 134 place count 1050 transition count 1005
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 134 place count 1050 transition count 1004
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 136 place count 1049 transition count 1004
Applied a total of 136 rules in 199 ms. Remains 1049 /1117 variables (removed 68) and now considering 1004/1056 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 1049/1117 places, 1004/1056 transitions.
RANDOM walk for 40000 steps (8 resets) in 666 ms. (59 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 548 ms. (72 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 412 ms. (96 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 322 ms. (123 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 335 ms. (119 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 310 ms. (128 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 58570 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 5
Probabilistic random walk after 58570 steps, saw 40724 distinct states, run finished after 3009 ms. (steps per millisecond=19 ) properties seen :0
// Phase 1: matrix 1004 rows 1049 cols
[2024-05-29 01:15:11] [INFO ] Computed 449 invariants in 8 ms
[2024-05-29 01:15:11] [INFO ] State equation strengthened by 142 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 257/331 variables, 107/107 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 207/538 variables, 99/206 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 588/1126 variables, 538/744 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1126 variables, 135/879 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1126 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 389/1515 variables, 202/1081 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1515 variables, 91/1172 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1515 variables, 7/1179 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1515 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 7/1522 variables, 8/1187 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1522 variables, 7/1194 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1522 variables, 0/1194 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 12/1534 variables, 6/1200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1534 variables, 0/1200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 301/1835 variables, 173/1373 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1835 variables, 72/1445 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1835 variables, 0/1445 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 5/1840 variables, 8/1453 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1840 variables, 5/1458 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1840 variables, 0/1458 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 4/1844 variables, 2/1460 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1844 variables, 0/1460 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 127/1971 variables, 68/1528 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1971 variables, 23/1551 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1971 variables, 0/1551 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (OVERLAPS) 7/1978 variables, 9/1560 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1978 variables, 7/1567 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1978 variables, 0/1567 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (OVERLAPS) 10/1988 variables, 5/1572 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1988 variables, 0/1572 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (OVERLAPS) 50/2038 variables, 40/1612 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2038 variables, 15/1627 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2038 variables, 0/1627 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (OVERLAPS) 12/2050 variables, 6/1633 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2050 variables, 1/1634 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2050 variables, 0/1634 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (OVERLAPS) 1/2051 variables, 2/1636 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2051 variables, 1/1637 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/2051 variables, 0/1637 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 42 (OVERLAPS) 2/2053 variables, 2/1639 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2053 variables, 1/1640 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/2053 variables, 0/1640 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 45 (OVERLAPS) 0/2053 variables, 0/1640 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2053/2053 variables, and 1640 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3728 ms.
Refiners :[Positive P Invariants (semi-flows): 449/449 constraints, State Equation: 1049/1049 constraints, ReadFeed: 142/142 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 257/331 variables, 107/107 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 01:15:15] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-29 01:15:15] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-29 01:15:15] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-29 01:15:15] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-05-29 01:15:15] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-29 01:15:15] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-29 01:15:15] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-29 01:15:16] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 8/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 207/538 variables, 99/214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 01:15:16] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 2 ms to minimize.
[2024-05-29 01:15:16] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-05-29 01:15:16] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-29 01:15:16] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2024-05-29 01:15:16] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-29 01:15:16] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-29 01:15:16] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 7/221 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 01:15:16] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 588/1126 variables, 538/760 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1126 variables, 135/895 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1126 variables, 1/896 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 01:15:17] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2024-05-29 01:15:17] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 0 ms to minimize.
[2024-05-29 01:15:17] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 2 ms to minimize.
[2024-05-29 01:15:17] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1126 variables, 4/900 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 01:15:17] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1126 variables, 1/901 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1126 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 389/1515 variables, 202/1103 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1515 variables, 91/1194 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1515 variables, 7/1201 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1515 variables, 4/1205 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 01:15:18] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 2 ms to minimize.
[2024-05-29 01:15:18] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 8 ms to minimize.
[2024-05-29 01:15:18] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1515 variables, 3/1208 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1515 variables, 0/1208 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 7/1522 variables, 8/1216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1522 variables, 7/1223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1522 variables, 0/1223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 12/1534 variables, 6/1229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1534 variables, 0/1229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 301/1835 variables, 173/1402 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1835 variables, 72/1474 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1835 variables, 0/1474 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (OVERLAPS) 5/1840 variables, 8/1482 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1840 variables, 5/1487 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1840 variables, 0/1487 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (OVERLAPS) 4/1844 variables, 2/1489 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1844 variables, 0/1489 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (OVERLAPS) 127/1971 variables, 68/1557 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1971 variables, 23/1580 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1971 variables, 0/1580 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (OVERLAPS) 7/1978 variables, 9/1589 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1978 variables, 7/1596 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1978 variables, 0/1596 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (OVERLAPS) 10/1988 variables, 5/1601 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 01:15:21] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
At refinement iteration 40 (INCLUDED_ONLY) 0/1988 variables, 1/1602 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1988 variables, 0/1602 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 42 (OVERLAPS) 50/2038 variables, 40/1642 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2038 variables, 15/1657 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/2038 variables, 0/1657 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 45 (OVERLAPS) 12/2050 variables, 6/1663 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/2050 variables, 1/1664 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/2050 variables, 0/1664 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 48 (OVERLAPS) 1/2051 variables, 2/1666 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/2051 variables, 1/1667 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/2051 variables, 0/1667 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 51 (OVERLAPS) 2/2053 variables, 2/1669 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/2053 variables, 1/1670 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/2053 variables, 0/1670 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 54 (OVERLAPS) 0/2053 variables, 0/1670 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2053/2053 variables, and 1670 constraints, problems are : Problem set: 0 solved, 5 unsolved in 9424 ms.
Refiners :[Positive P Invariants (semi-flows): 449/449 constraints, State Equation: 1049/1049 constraints, ReadFeed: 142/142 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 25/25 constraints]
After SMT, in 13200ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3444 ms.
Support contains 74 out of 1049 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1049/1049 places, 1004/1004 transitions.
Applied a total of 0 rules in 25 ms. Remains 1049 /1049 variables (removed 0) and now considering 1004/1004 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 1049/1049 places, 1004/1004 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1049/1049 places, 1004/1004 transitions.
Applied a total of 0 rules in 25 ms. Remains 1049 /1049 variables (removed 0) and now considering 1004/1004 (removed 0) transitions.
[2024-05-29 01:15:28] [INFO ] Invariant cache hit.
[2024-05-29 01:15:29] [INFO ] Implicit Places using invariants in 538 ms returned [1037]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 549 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1048/1049 places, 1004/1004 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1047 transition count 1003
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1047 transition count 1003
Applied a total of 2 rules in 37 ms. Remains 1047 /1048 variables (removed 1) and now considering 1003/1004 (removed 1) transitions.
// Phase 1: matrix 1003 rows 1047 cols
[2024-05-29 01:15:29] [INFO ] Computed 448 invariants in 3 ms
[2024-05-29 01:15:29] [INFO ] Implicit Places using invariants in 531 ms returned []
[2024-05-29 01:15:29] [INFO ] Invariant cache hit.
[2024-05-29 01:15:30] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-29 01:15:32] [INFO ] Implicit Places using invariants and state equation in 2733 ms returned []
Implicit Place search using SMT with State Equation took 3266 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1047/1049 places, 1003/1004 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3878 ms. Remains : 1047/1049 places, 1003/1004 transitions.
RANDOM walk for 40000 steps (8 resets) in 649 ms. (61 steps per ms) remains 4/5 properties
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 378 ms. (105 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 333 ms. (119 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 317 ms. (125 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 321 ms. (124 steps per ms) remains 4/4 properties
[2024-05-29 01:15:33] [INFO ] Invariant cache hit.
[2024-05-29 01:15:33] [INFO ] State equation strengthened by 141 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 253/325 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 207/532 variables, 99/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 580/1112 variables, 532/736 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1112 variables, 134/870 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1112 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 376/1488 variables, 194/1064 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1488 variables, 87/1151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1488 variables, 7/1158 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1488 variables, 0/1158 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 7/1495 variables, 8/1166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1495 variables, 7/1173 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1495 variables, 0/1173 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 12/1507 variables, 6/1179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1507 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 298/1805 variables, 169/1348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1805 variables, 70/1418 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1805 variables, 0/1418 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 5/1810 variables, 8/1426 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1810 variables, 5/1431 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1810 variables, 0/1431 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 4/1814 variables, 2/1433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1814 variables, 0/1433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 146/1960 variables, 78/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1960 variables, 27/1538 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1960 variables, 0/1538 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 9/1969 variables, 10/1548 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1969 variables, 7/1555 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1969 variables, 0/1555 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 12/1981 variables, 6/1561 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1981 variables, 0/1561 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 54/2035 variables, 46/1607 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2035 variables, 16/1623 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2035 variables, 0/1623 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (OVERLAPS) 12/2047 variables, 6/1629 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2047 variables, 1/1630 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2047 variables, 0/1630 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 1/2048 variables, 2/1632 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2048 variables, 1/1633 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/2048 variables, 0/1633 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (OVERLAPS) 2/2050 variables, 2/1635 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2050 variables, 1/1636 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/2050 variables, 0/1636 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (OVERLAPS) 0/2050 variables, 0/1636 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2050/2050 variables, and 1636 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3048 ms.
Refiners :[Positive P Invariants (semi-flows): 448/448 constraints, State Equation: 1047/1047 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 253/325 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 01:15:36] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 0 ms to minimize.
[2024-05-29 01:15:36] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 01:15:36] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 01:15:36] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-29 01:15:36] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 5/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/325 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 207/532 variables, 99/209 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 580/1112 variables, 532/741 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1112 variables, 134/875 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1112 variables, 1/876 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 01:15:36] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2024-05-29 01:15:36] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-05-29 01:15:37] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 2 ms to minimize.
[2024-05-29 01:15:37] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2024-05-29 01:15:37] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-29 01:15:37] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2024-05-29 01:15:37] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1112 variables, 7/883 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1112 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 376/1488 variables, 194/1077 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1488 variables, 87/1164 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1488 variables, 7/1171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1488 variables, 3/1174 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 01:15:38] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 2 ms to minimize.
[2024-05-29 01:15:38] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 2 ms to minimize.
[2024-05-29 01:15:38] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2024-05-29 01:15:38] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1488 variables, 4/1178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1488 variables, 0/1178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 7/1495 variables, 8/1186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1495 variables, 7/1193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1495 variables, 0/1193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 12/1507 variables, 6/1199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1507 variables, 0/1199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 298/1805 variables, 169/1368 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1805 variables, 70/1438 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 01:15:40] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 2 ms to minimize.
[2024-05-29 01:15:40] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1805 variables, 2/1440 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1805 variables, 0/1440 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 5/1810 variables, 8/1448 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1810 variables, 5/1453 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1810 variables, 0/1453 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 4/1814 variables, 2/1455 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1814 variables, 0/1455 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 146/1960 variables, 78/1533 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1960 variables, 27/1560 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1960 variables, 0/1560 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (OVERLAPS) 9/1969 variables, 10/1570 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1969 variables, 7/1577 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1969 variables, 0/1577 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 12/1981 variables, 6/1583 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1981 variables, 0/1583 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 54/2035 variables, 46/1629 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2035 variables, 16/1645 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/2035 variables, 0/1645 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (OVERLAPS) 12/2047 variables, 6/1651 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2047 variables, 1/1652 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/2047 variables, 0/1652 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (OVERLAPS) 1/2048 variables, 2/1654 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/2048 variables, 1/1655 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/2048 variables, 0/1655 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (OVERLAPS) 2/2050 variables, 2/1657 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/2050 variables, 1/1658 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/2050 variables, 0/1658 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (OVERLAPS) 0/2050 variables, 0/1658 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2050/2050 variables, and 1658 constraints, problems are : Problem set: 0 solved, 4 unsolved in 8639 ms.
Refiners :[Positive P Invariants (semi-flows): 448/448 constraints, State Equation: 1047/1047 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 18/18 constraints]
After SMT, in 11724ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 5595 ms.
Support contains 72 out of 1047 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1047/1047 places, 1003/1003 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1047 transition count 1002
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1046 transition count 1002
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 2 with 2 rules applied. Total rules applied 4 place count 1045 transition count 1001
Applied a total of 4 rules in 51 ms. Remains 1045 /1047 variables (removed 2) and now considering 1001/1003 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 1045/1047 places, 1001/1003 transitions.
RANDOM walk for 40000 steps (8 resets) in 784 ms. (50 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 648 ms. (61 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 456 ms. (87 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 382 ms. (104 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 438 ms. (91 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 94765 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :0 out of 4
Probabilistic random walk after 94765 steps, saw 66113 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
// Phase 1: matrix 1001 rows 1045 cols
[2024-05-29 01:15:54] [INFO ] Computed 448 invariants in 3 ms
[2024-05-29 01:15:54] [INFO ] State equation strengthened by 141 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 252/324 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/324 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 207/531 variables, 99/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 579/1110 variables, 531/735 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1110 variables, 134/869 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1110 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 376/1486 variables, 194/1063 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1486 variables, 87/1150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1486 variables, 7/1157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1486 variables, 0/1157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 7/1493 variables, 8/1165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1493 variables, 7/1172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1493 variables, 0/1172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 12/1505 variables, 6/1178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1505 variables, 0/1178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 298/1803 variables, 169/1347 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1803 variables, 70/1417 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1803 variables, 0/1417 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 5/1808 variables, 8/1425 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1808 variables, 5/1430 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1808 variables, 0/1430 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 4/1812 variables, 2/1432 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1812 variables, 0/1432 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 146/1958 variables, 78/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1958 variables, 27/1537 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1958 variables, 0/1537 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 8/1966 variables, 10/1547 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1966 variables, 8/1555 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1966 variables, 0/1555 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 12/1978 variables, 6/1561 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1978 variables, 0/1561 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 53/2031 variables, 44/1605 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2031 variables, 16/1621 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2031 variables, 0/1621 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (OVERLAPS) 12/2043 variables, 6/1627 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2043 variables, 1/1628 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2043 variables, 0/1628 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 1/2044 variables, 2/1630 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2044 variables, 1/1631 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/2044 variables, 0/1631 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (OVERLAPS) 2/2046 variables, 2/1633 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2046 variables, 1/1634 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/2046 variables, 0/1634 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (OVERLAPS) 0/2046 variables, 0/1634 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2046/2046 variables, and 1634 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2713 ms.
Refiners :[Positive P Invariants (semi-flows): 448/448 constraints, State Equation: 1045/1045 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 252/324 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 01:15:57] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-29 01:15:57] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-05-29 01:15:57] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-29 01:15:57] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
[2024-05-29 01:15:57] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-05-29 01:15:57] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 01:15:57] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-29 01:15:57] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/324 variables, 8/113 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/324 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 207/531 variables, 99/212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 01:15:57] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2024-05-29 01:15:57] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2024-05-29 01:15:57] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-29 01:15:57] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-29 01:15:57] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-29 01:15:58] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-29 01:15:58] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-05-29 01:15:58] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-29 01:15:58] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 9/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 579/1110 variables, 531/752 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1110 variables, 134/886 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1110 variables, 1/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 01:15:58] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 2 ms to minimize.
[2024-05-29 01:15:58] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2024-05-29 01:15:58] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1110 variables, 3/890 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1110 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 376/1486 variables, 194/1084 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1486 variables, 87/1171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1486 variables, 7/1178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1486 variables, 3/1181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 01:15:59] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-29 01:15:59] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-05-29 01:15:59] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 2 ms to minimize.
[2024-05-29 01:15:59] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-29 01:15:59] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1486 variables, 5/1186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1486 variables, 0/1186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 7/1493 variables, 8/1194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1493 variables, 7/1201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1493 variables, 0/1201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 12/1505 variables, 6/1207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1505 variables, 0/1207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 298/1803 variables, 169/1376 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1803 variables, 70/1446 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1803 variables, 0/1446 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 5/1808 variables, 8/1454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1808 variables, 5/1459 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1808 variables, 0/1459 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 4/1812 variables, 2/1461 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1812 variables, 0/1461 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 146/1958 variables, 78/1539 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1958 variables, 27/1566 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1958 variables, 0/1566 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (OVERLAPS) 8/1966 variables, 10/1576 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1966 variables, 8/1584 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1966 variables, 0/1584 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 12/1978 variables, 6/1590 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1978 variables, 0/1590 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 53/2031 variables, 44/1634 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2031 variables, 16/1650 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/2031 variables, 0/1650 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (OVERLAPS) 12/2043 variables, 6/1656 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2043 variables, 1/1657 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/2043 variables, 0/1657 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (OVERLAPS) 1/2044 variables, 2/1659 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/2044 variables, 1/1660 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/2044 variables, 0/1660 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (OVERLAPS) 2/2046 variables, 2/1662 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/2046 variables, 1/1663 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/2046 variables, 0/1663 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (OVERLAPS) 0/2046 variables, 0/1663 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2046/2046 variables, and 1663 constraints, problems are : Problem set: 0 solved, 4 unsolved in 7267 ms.
Refiners :[Positive P Invariants (semi-flows): 448/448 constraints, State Equation: 1045/1045 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 25/25 constraints]
After SMT, in 10004ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4063 ms.
Support contains 72 out of 1045 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1045/1045 places, 1001/1001 transitions.
Applied a total of 0 rules in 22 ms. Remains 1045 /1045 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 1045/1045 places, 1001/1001 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1045/1045 places, 1001/1001 transitions.
Applied a total of 0 rules in 22 ms. Remains 1045 /1045 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
[2024-05-29 01:16:08] [INFO ] Invariant cache hit.
[2024-05-29 01:16:09] [INFO ] Implicit Places using invariants in 499 ms returned []
[2024-05-29 01:16:09] [INFO ] Invariant cache hit.
[2024-05-29 01:16:09] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-29 01:16:11] [INFO ] Implicit Places using invariants and state equation in 2586 ms returned []
Implicit Place search using SMT with State Equation took 3089 ms to find 0 implicit places.
[2024-05-29 01:16:11] [INFO ] Redundant transitions in 60 ms returned []
Running 984 sub problems to find dead transitions.
[2024-05-29 01:16:11] [INFO ] Invariant cache hit.
[2024-05-29 01:16:11] [INFO ] State equation strengthened by 141 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1031 variables, 270/270 constraints. Problems are: Problem set: 0 solved, 984 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1031 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 984 unsolved
At refinement iteration 2 (OVERLAPS) 14/1045 variables, 178/448 constraints. Problems are: Problem set: 0 solved, 984 unsolved
[2024-05-29 01:16:41] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 01:16:41] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
SMT process timed out in 30291ms, After SMT, problems are : Problem set: 0 solved, 984 unsolved
Search for dead transitions found 0 dead transitions in 30302ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33485 ms. Remains : 1045/1045 places, 1001/1001 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 127 times.
Drop transitions (Partial Free agglomeration) removed 127 transitions
Iterating global reduction 0 with 127 rules applied. Total rules applied 127 place count 1045 transition count 1001
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 130 place count 1045 transition count 998
Applied a total of 130 rules in 95 ms. Remains 1045 /1045 variables (removed 0) and now considering 998/1001 (removed 3) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 998 rows 1045 cols
[2024-05-29 01:16:42] [INFO ] Computed 448 invariants in 3 ms
[2024-05-29 01:16:42] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 01:16:42] [INFO ] [Nat]Absence check using 448 positive place invariants in 56 ms returned sat
[2024-05-29 01:16:43] [INFO ] After 536ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 01:16:43] [INFO ] State equation strengthened by 105 read => feed constraints.
[2024-05-29 01:16:43] [INFO ] After 408ms SMT Verify possible using 105 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-29 01:16:43] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 2 ms to minimize.
[2024-05-29 01:16:43] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 2 ms to minimize.
[2024-05-29 01:16:44] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 2 ms to minimize.
[2024-05-29 01:16:44] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 2 ms to minimize.
[2024-05-29 01:16:44] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2024-05-29 01:16:44] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 2 ms to minimize.
[2024-05-29 01:16:44] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 2 ms to minimize.
[2024-05-29 01:16:44] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 2 ms to minimize.
[2024-05-29 01:16:44] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
[2024-05-29 01:16:44] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 2 ms to minimize.
[2024-05-29 01:16:45] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 2 ms to minimize.
[2024-05-29 01:16:45] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 2 ms to minimize.
[2024-05-29 01:16:45] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 2 ms to minimize.
[2024-05-29 01:16:45] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1875 ms
[2024-05-29 01:16:45] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 1 ms to minimize.
[2024-05-29 01:16:45] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 2 ms to minimize.
[2024-05-29 01:16:45] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 2 ms to minimize.
[2024-05-29 01:16:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 405 ms
[2024-05-29 01:16:46] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 2 ms to minimize.
[2024-05-29 01:16:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
TRAPS : Iteration 1
[2024-05-29 01:16:46] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 2 ms to minimize.
[2024-05-29 01:16:46] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 2 ms to minimize.
[2024-05-29 01:16:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 324 ms
[2024-05-29 01:16:46] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2024-05-29 01:16:46] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 1 ms to minimize.
[2024-05-29 01:16:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 289 ms
TRAPS : Iteration 2
[2024-05-29 01:16:47] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 2 ms to minimize.
[2024-05-29 01:16:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
TRAPS : Iteration 3
[2024-05-29 01:16:47] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 2 ms to minimize.
[2024-05-29 01:16:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2024-05-29 01:16:48] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2024-05-29 01:16:48] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 2 ms to minimize.
[2024-05-29 01:16:48] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 1 ms to minimize.
[2024-05-29 01:16:48] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 2 ms to minimize.
[2024-05-29 01:16:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 536 ms
TRAPS : Iteration 4
[2024-05-29 01:16:49] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 2 ms to minimize.
[2024-05-29 01:16:49] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 2 ms to minimize.
[2024-05-29 01:16:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 312 ms
[2024-05-29 01:16:49] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 3 ms to minimize.
[2024-05-29 01:16:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
TRAPS : Iteration 5
[2024-05-29 01:16:50] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 2 ms to minimize.
[2024-05-29 01:16:50] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 2 ms to minimize.
[2024-05-29 01:16:50] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-05-29 01:16:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 424 ms
[2024-05-29 01:16:50] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 2 ms to minimize.
[2024-05-29 01:16:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
TRAPS : Iteration 6
[2024-05-29 01:16:51] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 2 ms to minimize.
[2024-05-29 01:16:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2024-05-29 01:16:51] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 2 ms to minimize.
[2024-05-29 01:16:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2024-05-29 01:16:51] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 3 ms to minimize.
[2024-05-29 01:16:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
TRAPS : Iteration 7
[2024-05-29 01:16:52] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 2 ms to minimize.
[2024-05-29 01:16:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
TRAPS : Iteration 8
[2024-05-29 01:16:53] [INFO ] After 10075ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-29 01:16:53] [INFO ] After 11338ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2024-05-29 01:16:53] [INFO ] Flatten gal took : 47 ms
[2024-05-29 01:16:53] [INFO ] Flatten gal took : 42 ms
[2024-05-29 01:16:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13659083482783572049.gal : 9 ms
[2024-05-29 01:16:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4972233237495802006.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13659083482783572049.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4972233237495802006.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 ...329
Loading property file /tmp/ReachabilityCardinality4972233237495802006.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 16
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :16 after 22
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :22 after 64
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :64 after 379
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :379 after 3790
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :3790 after 2.0466e+06
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :2.0466e+06 after 8.54251e+09
Detected timeout of ITS tools.
[2024-05-29 01:17:08] [INFO ] Flatten gal took : 37 ms
[2024-05-29 01:17:08] [INFO ] Applying decomposition
[2024-05-29 01:17:08] [INFO ] Flatten gal took : 36 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/graph934237530536846574.txt' '-o' '/tmp/graph934237530536846574.bin' '-w' '/tmp/graph934237530536846574.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph934237530536846574.bin' '-l' '-1' '-v' '-w' '/tmp/graph934237530536846574.weights' '-q' '0' '-e' '0.001'
[2024-05-29 01:17:09] [INFO ] Decomposing Gal with order
[2024-05-29 01:17:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 01:17:09] [INFO ] Removed a total of 540 redundant transitions.
[2024-05-29 01:17:09] [INFO ] Flatten gal took : 238 ms
[2024-05-29 01:17:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 87 labels/synchronizations in 93 ms.
[2024-05-29 01:17:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15981971804216165877.gal : 24 ms
[2024-05-29 01:17:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16120739895752208438.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15981971804216165877.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16120739895752208438.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality16120739895752208438.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :3 after 3
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :3 after 3
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :3 after 3
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :3 after 3
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :3 after 3
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :3 after 379
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :379 after 2.45592e+08
Invariant property ShieldIIPt-PT-050B-ReachabilityCardinality-2024-11 does not hold.
Reachability property ShieldIIPt-PT-050B-ReachabilityCardinality-2024-06 is true.
Invariant property ShieldIIPt-PT-050B-ReachabilityCardinality-2024-02 does not hold.
Invariant property ShieldIIPt-PT-050B-ReachabilityCardinality-2024-00 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 513 fixpoint passes
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,2.82888e+77,5.32202,164700,4656,589,292065,6703,1827,837965,264,57054,0
Total reachable state count : 2.828882631949244313720497188921796083959e+77

Verifying 4 reachability properties.
Invariant property ShieldIIPt-PT-050B-ReachabilityCardinality-2024-00 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldIIPt-PT-050B-ReachabilityCardinality-2024-00,5.1093e+76,5.47876,164700,3349,492,292065,6703,2023,837965,289,57054,0
Invariant property ShieldIIPt-PT-050B-ReachabilityCardinality-2024-02 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldIIPt-PT-050B-ReachabilityCardinality-2024-02,1.60856e+75,5.50753,164700,2901,478,292065,6703,2110,837965,290,57054,0
Reachability property ShieldIIPt-PT-050B-ReachabilityCardinality-2024-06 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
ShieldIIPt-PT-050B-ReachabilityCardinality-2024-06,7.46538e+26,5.51031,164700,752,126,292065,6703,2154,837965,292,57054,0
Invariant property ShieldIIPt-PT-050B-ReachabilityCardinality-2024-11 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldIIPt-PT-050B-ReachabilityCardinality-2024-11,7.04153e+76,5.51942,164700,3112,516,292065,6703,2161,837965,292,57054,0
Over-approximation ignoring read arcs solved 0 properties in 33788 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-29 01:17:15] [INFO ] Flatten gal took : 73 ms
[2024-05-29 01:17:15] [INFO ] Applying decomposition
[2024-05-29 01:17:15] [INFO ] Flatten gal took : 73 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/graph12843140185855836816.txt' '-o' '/tmp/graph12843140185855836816.bin' '-w' '/tmp/graph12843140185855836816.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12843140185855836816.bin' '-l' '-1' '-v' '-w' '/tmp/graph12843140185855836816.weights' '-q' '0' '-e' '0.001'
[2024-05-29 01:17:16] [INFO ] Decomposing Gal with order
[2024-05-29 01:17:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 01:17:16] [INFO ] Removed a total of 300 redundant transitions.
[2024-05-29 01:17:16] [INFO ] Flatten gal took : 167 ms
[2024-05-29 01:17:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2024-05-29 01:17:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12890976398498707457.gal : 33 ms
[2024-05-29 01:17:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5040006711051705180.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/ReachabilityCardinality12890976398498707457.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5040006711051705180.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/ReachabilityCardinality5040006711051705180.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :1 after 58281
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :58281 after 1.12746e+116
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :1.12746e+116 after 3.88297e+148
Invariant property ShieldIIPt-PT-050B-ReachabilityCardinality-2024-11 does not hold.
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldIIPt-PT-050B-ReachabilityCardinality-2024-06 is true.
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldIIPt-PT-050B-ReachabilityCardinality-2024-00 does not hold.
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3.88297e+148 after 8.72099e+171
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :8.72099e+171 after 8.72099e+171
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :8.72099e+171 after 3.18305e+173
ITS-tools command line returned an error code 137
[2024-05-29 01:36:15] [INFO ] Flatten gal took : 33 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin263429388351019588
[2024-05-29 01:36:15] [INFO ] Applying decomposition
[2024-05-29 01:36:15] [INFO ] Computing symmetric may disable matrix : 1001 transitions.
[2024-05-29 01:36:15] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:36:15] [INFO ] Computing symmetric may enable matrix : 1001 transitions.
[2024-05-29 01:36:15] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:36:15] [INFO ] Flatten gal took : 33 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/graph3567807917722924068.txt' '-o' '/tmp/graph3567807917722924068.bin' '-w' '/tmp/graph3567807917722924068.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3567807917722924068.bin' '-l' '-1' '-v' '-w' '/tmp/graph3567807917722924068.weights' '-q' '0' '-e' '0.001'
[2024-05-29 01:36:15] [INFO ] Decomposing Gal with order
[2024-05-29 01:36:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 01:36:15] [INFO ] Removed a total of 847 redundant transitions.
[2024-05-29 01:36:15] [INFO ] Flatten gal took : 49 ms
[2024-05-29 01:36:15] [INFO ] Computing Do-Not-Accords matrix : 1001 transitions.
[2024-05-29 01:36:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 336 labels/synchronizations in 15 ms.
[2024-05-29 01:36:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5428756540863267807.gal : 10 ms
[2024-05-29 01:36:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12087395784171677871.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/ReachabilityCardinality5428756540863267807.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12087395784171677871.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
[2024-05-29 01:36:15] [INFO ] Computation of Completed DNA matrix. took 49 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:36:15] [INFO ] Built C files in 349ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin263429388351019588
Running compilation step : cd /tmp/ltsmin263429388351019588;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Loading property file /tmp/ReachabilityCardinality12087395784171677871.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2 after 64
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :64 after 758
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :758 after 4.59748e+11
Compilation finished in 3829 ms.
Running link step : cd /tmp/ltsmin263429388351019588;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin263429388351019588;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPtPT050BReachabilityCardinality202402==true'
Invariant property ShieldIIPt-PT-050B-ReachabilityCardinality-2024-02 does not hold.
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
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,2.0878e+98,36.5478,827124,4463,159,1.54401e+06,1237,1520,4.99293e+06,141,7785,0
Total reachable state count : 2.087803841542145992335297315965482752875e+98

Verifying 1 reachability properties.
Invariant property ShieldIIPt-PT-050B-ReachabilityCardinality-2024-02 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldIIPt-PT-050B-ReachabilityCardinality-2024-02,2.10765e+96,36.8051,827124,3923,161,1.54401e+06,1237,1622,4.99293e+06,154,7785,0
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1376549 ms.

BK_STOP 1716946652930

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-050B"
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 ShieldIIPt-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 r356-tall-171683760900334"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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