fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r356-tall-171683761200510
Last Updated
July 7, 2024

About the Execution of ITS-Tools for ShieldPPPs-PT-050B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16207.067 3600000.00 12224263.00 4763.90 FTTTTFT?F?TTTTFF normal

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-171683761200510.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 ShieldPPPs-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-171683761200510
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.8K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 19 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 13 11:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 13 11:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 13 11:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 13 11:47 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 888K 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 ShieldPPPs-PT-050B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716993190219

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-050B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-29 14:33:11] [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 14:33:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 14:33:11] [INFO ] Load time of PNML (sax parser for PT used): 213 ms
[2024-05-29 14:33:11] [INFO ] Transformed 3403 places.
[2024-05-29 14:33:11] [INFO ] Transformed 3153 transitions.
[2024-05-29 14:33:11] [INFO ] Found NUPN structural information;
[2024-05-29 14:33:11] [INFO ] Parsed PT model containing 3403 places and 3153 transitions and 8706 arcs in 486 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 14:33:12] [INFO ] Flatten gal took : 397 ms
RANDOM walk for 40000 steps (8 resets) in 3746 ms. (10 steps per ms) remains 6/15 properties
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-29 14:33:13] [INFO ] Flatten gal took : 322 ms
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 6/6 properties
[2024-05-29 14:33:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12614516958704242245.gal : 91 ms
[2024-05-29 14:33:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1824491296239693998.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/ReachabilityCardinality12614516958704242245.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1824491296239693998.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

BEST_FIRST walk for 40004 steps (8 resets) in 659 ms. (60 steps per ms) remains 6/6 properties
/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
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 326 ms. (122 steps per ms) remains 6/6 properties
// Phase 1: matrix 3153 rows 3403 cols
[2024-05-29 14:33:13] [INFO ] Computed 551 invariants in 51 ms
Loading property file /tmp/ReachabilityCardinality1824491296239693998.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1649/1736 variables, 261/348 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1736 variables, 1649/1997 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1736 variables, 0/1997 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1667/3403 variables, 290/2287 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3403 variables, 1667/3954 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3403 variables, 0/3954 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 3153/6556 variables, 3403/7357 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/6556 variables, 0/7357 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/6556 variables, 0/7357 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6556/6556 variables, and 7357 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4017 ms.
Refiners :[Domain max(s): 3403/3403 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 3403/3403 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1649/1736 variables, 261/348 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1736 variables, 1649/1997 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 14:33:18] [INFO ] Deduced a trap composed of 24 places in 535 ms of which 63 ms to minimize.
[2024-05-29 14:33:19] [INFO ] Deduced a trap composed of 23 places in 463 ms of which 15 ms to minimize.
[2024-05-29 14:33:19] [INFO ] Deduced a trap composed of 43 places in 392 ms of which 6 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :36 after 82
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :82 after 432
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :432 after 616
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :616 after 1.09756e+08
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :1.09756e+08 after 1.05906e+16
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :1.05906e+16 after 9.91011e+32
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :9.91011e+32 after 6.62489e+68
[2024-05-29 14:33:20] [INFO ] Deduced a trap composed of 56 places in 738 ms of which 5 ms to minimize.
Reachability property ShieldPPPs-PT-050B-ReachabilityCardinality-2024-03 is true.
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property ShieldPPPs-PT-050B-ReachabilityCardinality-2024-01 is true.
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :6.62489e+68 after 1.20154e+138
[2024-05-29 14:33:21] [INFO ] Deduced a trap composed of 52 places in 943 ms of which 9 ms to minimize.
[2024-05-29 14:33:22] [INFO ] Deduced a trap composed of 54 places in 774 ms of which 5 ms to minimize.
[2024-05-29 14:33:22] [INFO ] Deduced a trap composed of 50 places in 251 ms of which 6 ms to minimize.
[2024-05-29 14:33:23] [INFO ] Deduced a trap composed of 53 places in 278 ms of which 5 ms to minimize.
SMT process timed out in 9382ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 82 out of 3403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3403/3403 places, 3153/3153 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 319 transitions
Trivial Post-agglo rules discarded 319 transitions
Performed 319 trivial Post agglomeration. Transition count delta: 319
Iterating post reduction 0 with 319 rules applied. Total rules applied 319 place count 3403 transition count 2834
Reduce places removed 319 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 327 rules applied. Total rules applied 646 place count 3084 transition count 2826
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 654 place count 3076 transition count 2826
Performed 256 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 256 Pre rules applied. Total rules applied 654 place count 3076 transition count 2570
Deduced a syphon composed of 256 places in 6 ms
Reduce places removed 256 places and 0 transitions.
Iterating global reduction 3 with 512 rules applied. Total rules applied 1166 place count 2820 transition count 2570
Discarding 331 places :
Symmetric choice reduction at 3 with 331 rule applications. Total rules 1497 place count 2489 transition count 2239
Iterating global reduction 3 with 331 rules applied. Total rules applied 1828 place count 2489 transition count 2239
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 132 Pre rules applied. Total rules applied 1828 place count 2489 transition count 2107
Deduced a syphon composed of 132 places in 16 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 264 rules applied. Total rules applied 2092 place count 2357 transition count 2107
Performed 710 Post agglomeration using F-continuation condition.Transition count delta: 710
Deduced a syphon composed of 710 places in 4 ms
Reduce places removed 710 places and 0 transitions.
Iterating global reduction 3 with 1420 rules applied. Total rules applied 3512 place count 1647 transition count 1397
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 419 times.
Drop transitions (Partial Free agglomeration) removed 419 transitions
Iterating global reduction 3 with 419 rules applied. Total rules applied 3931 place count 1647 transition count 1397
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3932 place count 1646 transition count 1396
Applied a total of 3932 rules in 1866 ms. Remains 1646 /3403 variables (removed 1757) and now considering 1396/3153 (removed 1757) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1878 ms. Remains : 1646/3403 places, 1396/3153 transitions.
RANDOM walk for 40000 steps (8 resets) in 1940 ms. (20 steps per ms) remains 3/4 properties
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 572 ms. (69 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 321 ms. (124 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 422 ms. (94 steps per ms) remains 3/3 properties
// Phase 1: matrix 1396 rows 1646 cols
[2024-05-29 14:33:26] [INFO ] Computed 551 invariants in 163 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 714/795 variables, 244/244 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/795 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 125/920 variables, 47/291 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/920 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 30/950 variables, 15/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/950 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 973/1923 variables, 950/1256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1923 variables, 0/1256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 521/2444 variables, 308/1564 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2444 variables, 86/1650 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2444 variables, 3/1653 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2444 variables, 0/1653 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 12/2456 variables, 14/1667 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2456 variables, 12/1679 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2456 variables, 0/1679 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 12/2468 variables, 6/1685 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2468 variables, 10/1695 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2468 variables, 0/1695 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 8/2476 variables, 4/1699 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2476 variables, 4/1703 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2476 variables, 0/1703 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 333/2809 variables, 192/1895 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2809 variables, 45/1940 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2809 variables, 3/1943 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2809 variables, 0/1943 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 16/2825 variables, 22/1965 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2825 variables, 16/1981 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2825 variables, 0/1981 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 18/2843 variables, 9/1990 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2843 variables, 16/2006 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2843 variables, 0/2006 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 4/2847 variables, 2/2008 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2847 variables, 2/2010 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2847 variables, 0/2010 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 1/2848 variables, 1/2011 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2848 variables, 1/2012 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2848 variables, 0/2012 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (OVERLAPS) 139/2987 variables, 92/2104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2987 variables, 29/2133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2987 variables, 1/2134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/2987 variables, 0/2134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (OVERLAPS) 2/2989 variables, 3/2137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2989 variables, 2/2139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/2989 variables, 0/2139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (OVERLAPS) 2/2991 variables, 1/2140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/2991 variables, 0/2140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (OVERLAPS) 43/3034 variables, 33/2173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/3034 variables, 9/2182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/3034 variables, 0/2182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (OVERLAPS) 2/3036 variables, 4/2186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/3036 variables, 2/2188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/3036 variables, 0/2188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (OVERLAPS) 6/3042 variables, 6/2194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/3042 variables, 3/2197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/3042 variables, 0/2197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (OVERLAPS) 0/3042 variables, 0/2197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3042/3042 variables, and 2197 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3327 ms.
Refiners :[Positive P Invariants (semi-flows): 523/523 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 1646/1646 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 714/795 variables, 244/244 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 14:33:29] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 2 ms to minimize.
[2024-05-29 14:33:29] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 3 ms to minimize.
[2024-05-29 14:33:30] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 2 ms to minimize.
[2024-05-29 14:33:30] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 2 ms to minimize.
[2024-05-29 14:33:30] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 2 ms to minimize.
[2024-05-29 14:33:30] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 3 ms to minimize.
[2024-05-29 14:33:30] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 3 ms to minimize.
[2024-05-29 14:33:30] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 2 ms to minimize.
[2024-05-29 14:33:30] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 2 ms to minimize.
[2024-05-29 14:33:30] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 2 ms to minimize.
[2024-05-29 14:33:31] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 2 ms to minimize.
[2024-05-29 14:33:31] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 2 ms to minimize.
[2024-05-29 14:33:31] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 5 ms to minimize.
[2024-05-29 14:33:31] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 2 ms to minimize.
[2024-05-29 14:33:31] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 2 ms to minimize.
[2024-05-29 14:33:31] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 2 ms to minimize.
[2024-05-29 14:33:31] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 2 ms to minimize.
[2024-05-29 14:33:31] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
[2024-05-29 14:33:32] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 2 ms to minimize.
[2024-05-29 14:33:32] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/795 variables, 20/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 14:33:32] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 4 ms to minimize.
[2024-05-29 14:33:32] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 2 ms to minimize.
[2024-05-29 14:33:32] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 2 ms to minimize.
[2024-05-29 14:33:32] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 7 ms to minimize.
[2024-05-29 14:33:32] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 2 ms to minimize.
[2024-05-29 14:33:32] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 5 ms to minimize.
[2024-05-29 14:33:32] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 5 ms to minimize.
[2024-05-29 14:33:33] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 3 ms to minimize.
[2024-05-29 14:33:33] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 2 ms to minimize.
[2024-05-29 14:33:33] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 3 ms to minimize.
[2024-05-29 14:33:33] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 2 ms to minimize.
[2024-05-29 14:33:33] [INFO ] Deduced a trap composed of 6 places in 187 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/795 variables, 12/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 14:33:33] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/795 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 14:33:33] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 2 ms to minimize.
[2024-05-29 14:33:34] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/795 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 14:33:34] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 2 ms to minimize.
[2024-05-29 14:33:34] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/795 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 14:33:34] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 2 ms to minimize.
[2024-05-29 14:33:34] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 2 ms to minimize.
[2024-05-29 14:33:34] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 1 ms to minimize.
[2024-05-29 14:33:34] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 2 ms to minimize.
[2024-05-29 14:33:34] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 2 ms to minimize.
[2024-05-29 14:33:34] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 2 ms to minimize.
[2024-05-29 14:33:35] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/795 variables, 7/288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/795 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 125/920 variables, 47/335 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 14:33:35] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 2 ms to minimize.
[2024-05-29 14:33:35] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 2 ms to minimize.
[2024-05-29 14:33:35] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2024-05-29 14:33:35] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 9 ms to minimize.
[2024-05-29 14:33:35] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 2 ms to minimize.
[2024-05-29 14:33:35] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 2 ms to minimize.
[2024-05-29 14:33:35] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 2 ms to minimize.
[2024-05-29 14:33:36] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/920 variables, 8/343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 14:33:36] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/920 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/920 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 30/950 variables, 15/359 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 14:33:36] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 2 ms to minimize.
[2024-05-29 14:33:36] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 2 ms to minimize.
[2024-05-29 14:33:36] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 2 ms to minimize.
[2024-05-29 14:33:36] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 2 ms to minimize.
[2024-05-29 14:33:36] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 2 ms to minimize.
[2024-05-29 14:33:37] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 1 ms to minimize.
[2024-05-29 14:33:37] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 2 ms to minimize.
[2024-05-29 14:33:37] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 2 ms to minimize.
[2024-05-29 14:33:37] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/950 variables, 9/368 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 14:33:37] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 2 ms to minimize.
[2024-05-29 14:33:37] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/950 variables, 2/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 14:33:37] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/950 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/950 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 973/1923 variables, 950/1321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1923 variables, 1/1322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 14:33:38] [INFO ] Deduced a trap composed of 6 places in 160 ms of which 2 ms to minimize.
[2024-05-29 14:33:38] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 3 ms to minimize.
[2024-05-29 14:33:38] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 3 ms to minimize.
[2024-05-29 14:33:38] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 2 ms to minimize.
[2024-05-29 14:33:39] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 3 ms to minimize.
[2024-05-29 14:33:39] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 3 ms to minimize.
[2024-05-29 14:33:39] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 3 ms to minimize.
[2024-05-29 14:33:39] [INFO ] Deduced a trap composed of 45 places in 142 ms of which 3 ms to minimize.
[2024-05-29 14:33:39] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 3 ms to minimize.
[2024-05-29 14:33:39] [INFO ] Deduced a trap composed of 48 places in 149 ms of which 2 ms to minimize.
[2024-05-29 14:33:40] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 2 ms to minimize.
[2024-05-29 14:33:40] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1923 variables, 12/1334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1923 variables, 0/1334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 521/2444 variables, 308/1642 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2444 variables, 86/1728 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2444 variables, 3/1731 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2444 variables, 2/1733 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 14:33:42] [INFO ] Deduced a trap composed of 5 places in 211 ms of which 4 ms to minimize.
[2024-05-29 14:33:43] [INFO ] Deduced a trap composed of 8 places in 193 ms of which 4 ms to minimize.
[2024-05-29 14:33:43] [INFO ] Deduced a trap composed of 5 places in 188 ms of which 3 ms to minimize.
[2024-05-29 14:33:43] [INFO ] Deduced a trap composed of 3 places in 200 ms of which 3 ms to minimize.
[2024-05-29 14:33:44] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 4 ms to minimize.
[2024-05-29 14:33:44] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 4 ms to minimize.
[2024-05-29 14:33:44] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 4 ms to minimize.
[2024-05-29 14:33:44] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 4 ms to minimize.
[2024-05-29 14:33:45] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 3 ms to minimize.
[2024-05-29 14:33:45] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 3 ms to minimize.
[2024-05-29 14:33:45] [INFO ] Deduced a trap composed of 3 places in 188 ms of which 4 ms to minimize.
[2024-05-29 14:33:45] [INFO ] Deduced a trap composed of 5 places in 188 ms of which 4 ms to minimize.
[2024-05-29 14:33:46] [INFO ] Deduced a trap composed of 5 places in 170 ms of which 3 ms to minimize.
[2024-05-29 14:33:46] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 4 ms to minimize.
[2024-05-29 14:33:46] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 3 ms to minimize.
[2024-05-29 14:33:46] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 3 ms to minimize.
[2024-05-29 14:33:47] [INFO ] Deduced a trap composed of 5 places in 190 ms of which 4 ms to minimize.
[2024-05-29 14:33:47] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 3 ms to minimize.
[2024-05-29 14:33:47] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 3 ms to minimize.
[2024-05-29 14:33:47] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 4 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/2444 variables, 20/1753 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 14:33:48] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 3 ms to minimize.
[2024-05-29 14:33:48] [INFO ] Deduced a trap composed of 7 places in 195 ms of which 3 ms to minimize.
[2024-05-29 14:33:48] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 3 ms to minimize.
[2024-05-29 14:33:49] [INFO ] Deduced a trap composed of 3 places in 172 ms of which 3 ms to minimize.
[2024-05-29 14:33:49] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 4 ms to minimize.
[2024-05-29 14:33:49] [INFO ] Deduced a trap composed of 5 places in 172 ms of which 3 ms to minimize.
[2024-05-29 14:33:49] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 3 ms to minimize.
[2024-05-29 14:33:49] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 3 ms to minimize.
[2024-05-29 14:33:50] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 3 ms to minimize.
[2024-05-29 14:33:50] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 3 ms to minimize.
[2024-05-29 14:33:50] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 3 ms to minimize.
[2024-05-29 14:33:50] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 3 ms to minimize.
[2024-05-29 14:33:51] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 2 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/2444 variables, 13/1766 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 14:33:51] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 3 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/2444 variables, 1/1767 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2444 variables, 0/1767 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 12/2456 variables, 14/1781 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2456 variables, 12/1793 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 14:33:52] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 3 ms to minimize.
[2024-05-29 14:33:52] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 3 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/2456 variables, 2/1795 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2456 variables, 0/1795 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 12/2468 variables, 6/1801 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2468 variables, 10/1811 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2468 variables, 0/1811 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 8/2476 variables, 4/1815 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2476 variables, 4/1819 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 14:33:53] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 3 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/2476 variables, 1/1820 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2476 variables, 0/1820 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (OVERLAPS) 333/2809 variables, 192/2012 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2809 variables, 45/2057 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2809 variables, 3/2060 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 14:33:54] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 3 ms to minimize.
[2024-05-29 14:33:54] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 3 ms to minimize.
[2024-05-29 14:33:55] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 3 ms to minimize.
[2024-05-29 14:33:55] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 3 ms to minimize.
[2024-05-29 14:33:55] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 3 ms to minimize.
At refinement iteration 44 (INCLUDED_ONLY) 0/2809 variables, 5/2065 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/2809 variables, 0/2065 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (OVERLAPS) 16/2825 variables, 22/2087 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/2825 variables, 16/2103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/2825 variables, 0/2103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (OVERLAPS) 18/2843 variables, 9/2112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/2843 variables, 16/2128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 14:33:56] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 3 ms to minimize.
[2024-05-29 14:33:57] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 2 ms to minimize.
At refinement iteration 51 (INCLUDED_ONLY) 0/2843 variables, 2/2130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/2843 variables, 0/2130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (OVERLAPS) 4/2847 variables, 2/2132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/2847 variables, 2/2134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 14:33:57] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 3 ms to minimize.
At refinement iteration 55 (INCLUDED_ONLY) 0/2847 variables, 1/2135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 14:33:58] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 2 ms to minimize.
At refinement iteration 56 (INCLUDED_ONLY) 0/2847 variables, 1/2136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/2847 variables, 0/2136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (OVERLAPS) 1/2848 variables, 1/2137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/2848 variables, 1/2138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/2848 variables, 0/2138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (OVERLAPS) 139/2987 variables, 92/2230 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/2987 variables, 29/2259 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/2987 variables, 1/2260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 14:34:00] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 3 ms to minimize.
[2024-05-29 14:34:00] [INFO ] Deduced a trap composed of 5 places in 172 ms of which 3 ms to minimize.
[2024-05-29 14:34:00] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 4 ms to minimize.
[2024-05-29 14:34:00] [INFO ] Deduced a trap composed of 6 places in 160 ms of which 3 ms to minimize.
[2024-05-29 14:34:00] [INFO ] Deduced a trap composed of 18 places in 152 ms of which 3 ms to minimize.
[2024-05-29 14:34:01] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 3 ms to minimize.
[2024-05-29 14:34:01] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 3 ms to minimize.
[2024-05-29 14:34:01] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 3 ms to minimize.
[2024-05-29 14:34:01] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 3 ms to minimize.
[2024-05-29 14:34:02] [INFO ] Deduced a trap composed of 8 places in 156 ms of which 3 ms to minimize.
[2024-05-29 14:34:02] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 4 ms to minimize.
At refinement iteration 64 (INCLUDED_ONLY) 0/2987 variables, 11/2271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/2987 variables, 0/2271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (OVERLAPS) 2/2989 variables, 3/2274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/2989 variables, 2/2276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/2989 variables, 0/2276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (OVERLAPS) 2/2991 variables, 1/2277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/2991 variables, 0/2277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (OVERLAPS) 43/3034 variables, 33/2310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/3034 variables, 9/2319 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 14:34:03] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 3 ms to minimize.
[2024-05-29 14:34:04] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 3 ms to minimize.
[2024-05-29 14:34:04] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 3 ms to minimize.
[2024-05-29 14:34:04] [INFO ] Deduced a trap composed of 9 places in 168 ms of which 4 ms to minimize.
[2024-05-29 14:34:04] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 3 ms to minimize.
[2024-05-29 14:34:05] [INFO ] Deduced a trap composed of 6 places in 168 ms of which 4 ms to minimize.
[2024-05-29 14:34:05] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 3 ms to minimize.
[2024-05-29 14:34:05] [INFO ] Deduced a trap composed of 5 places in 172 ms of which 4 ms to minimize.
[2024-05-29 14:34:05] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 3 ms to minimize.
At refinement iteration 73 (INCLUDED_ONLY) 0/3034 variables, 9/2328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/3034 variables, 0/2328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 75 (OVERLAPS) 2/3036 variables, 4/2332 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/3036 variables, 2/2334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/3036 variables, 0/2334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 78 (OVERLAPS) 6/3042 variables, 6/2340 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/3042 variables, 3/2343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 14:34:07] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 4 ms to minimize.
[2024-05-29 14:34:07] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 3 ms to minimize.
At refinement iteration 80 (INCLUDED_ONLY) 0/3042 variables, 2/2345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/3042 variables, 0/2345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 82 (OVERLAPS) 0/3042 variables, 0/2345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3042/3042 variables, and 2345 constraints, problems are : Problem set: 0 solved, 3 unsolved in 39119 ms.
Refiners :[Positive P Invariants (semi-flows): 523/523 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 1646/1646 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 145/145 constraints]
After SMT, in 42671ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 881 ms.
Support contains 81 out of 1646 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1646/1646 places, 1396/1396 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1646 transition count 1396
Applied a total of 1 rules in 113 ms. Remains 1646 /1646 variables (removed 0) and now considering 1396/1396 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 1646/1646 places, 1396/1396 transitions.
RANDOM walk for 40000 steps (8 resets) in 938 ms. (42 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 617 ms. (64 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 558 ms. (71 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 774 ms. (51 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 125816 steps, run timeout after 3019 ms. (steps per millisecond=41 ) properties seen :0 out of 3
Probabilistic random walk after 125816 steps, saw 116983 distinct states, run finished after 3023 ms. (steps per millisecond=41 ) properties seen :0
// Phase 1: matrix 1396 rows 1646 cols
[2024-05-29 14:34:13] [INFO ] Computed 551 invariants in 58 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 712/793 variables, 243/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/793 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 125/918 variables, 47/290 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/918 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 32/950 variables, 16/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/950 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 973/1923 variables, 950/1256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1923 variables, 0/1256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 521/2444 variables, 308/1564 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2444 variables, 86/1650 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2444 variables, 3/1653 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2444 variables, 0/1653 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 12/2456 variables, 14/1667 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2456 variables, 12/1679 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2456 variables, 0/1679 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 12/2468 variables, 6/1685 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2468 variables, 10/1695 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2468 variables, 0/1695 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 8/2476 variables, 4/1699 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2476 variables, 4/1703 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2476 variables, 0/1703 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 333/2809 variables, 192/1895 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2809 variables, 45/1940 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2809 variables, 3/1943 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2809 variables, 0/1943 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 16/2825 variables, 22/1965 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2825 variables, 16/1981 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2825 variables, 0/1981 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 18/2843 variables, 9/1990 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2843 variables, 16/2006 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2843 variables, 0/2006 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 4/2847 variables, 2/2008 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2847 variables, 2/2010 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2847 variables, 0/2010 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 1/2848 variables, 1/2011 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2848 variables, 1/2012 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2848 variables, 0/2012 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (OVERLAPS) 139/2987 variables, 92/2104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2987 variables, 29/2133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2987 variables, 1/2134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/2987 variables, 0/2134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (OVERLAPS) 2/2989 variables, 3/2137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2989 variables, 2/2139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/2989 variables, 0/2139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (OVERLAPS) 2/2991 variables, 1/2140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/2991 variables, 0/2140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (OVERLAPS) 43/3034 variables, 33/2173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/3034 variables, 9/2182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/3034 variables, 0/2182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (OVERLAPS) 2/3036 variables, 4/2186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/3036 variables, 2/2188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/3036 variables, 0/2188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (OVERLAPS) 6/3042 variables, 6/2194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/3042 variables, 3/2197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/3042 variables, 0/2197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (OVERLAPS) 0/3042 variables, 0/2197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3042/3042 variables, and 2197 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3179 ms.
Refiners :[Positive P Invariants (semi-flows): 522/522 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 1646/1646 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 712/793 variables, 243/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 14:34:17] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 3 ms to minimize.
[2024-05-29 14:34:17] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 4 ms to minimize.
[2024-05-29 14:34:17] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 2 ms to minimize.
[2024-05-29 14:34:17] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 2 ms to minimize.
[2024-05-29 14:34:17] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 2 ms to minimize.
[2024-05-29 14:34:17] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 2 ms to minimize.
[2024-05-29 14:34:18] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 3 ms to minimize.
[2024-05-29 14:34:18] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 2 ms to minimize.
[2024-05-29 14:34:18] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 2 ms to minimize.
[2024-05-29 14:34:18] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 2 ms to minimize.
[2024-05-29 14:34:18] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 2 ms to minimize.
[2024-05-29 14:34:18] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 3 ms to minimize.
[2024-05-29 14:34:18] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 2 ms to minimize.
[2024-05-29 14:34:18] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 2 ms to minimize.
[2024-05-29 14:34:19] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 3 ms to minimize.
[2024-05-29 14:34:19] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 2 ms to minimize.
[2024-05-29 14:34:19] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 2 ms to minimize.
[2024-05-29 14:34:19] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 2 ms to minimize.
[2024-05-29 14:34:19] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 2 ms to minimize.
[2024-05-29 14:34:19] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/793 variables, 20/263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 14:34:19] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 1 ms to minimize.
[2024-05-29 14:34:19] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 1 ms to minimize.
[2024-05-29 14:34:20] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 2 ms to minimize.
[2024-05-29 14:34:20] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 2 ms to minimize.
[2024-05-29 14:34:20] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 2 ms to minimize.
[2024-05-29 14:34:20] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-29 14:34:20] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 2 ms to minimize.
[2024-05-29 14:34:20] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 2 ms to minimize.
[2024-05-29 14:34:20] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 2 ms to minimize.
[2024-05-29 14:34:20] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 2 ms to minimize.
[2024-05-29 14:34:20] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
[2024-05-29 14:34:21] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/793 variables, 12/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/793 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 125/918 variables, 47/322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 14:34:21] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 2 ms to minimize.
[2024-05-29 14:34:21] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 2 ms to minimize.
[2024-05-29 14:34:21] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 2 ms to minimize.
[2024-05-29 14:34:21] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 2 ms to minimize.
[2024-05-29 14:34:21] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 2 ms to minimize.
[2024-05-29 14:34:21] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 2 ms to minimize.
[2024-05-29 14:34:21] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 2 ms to minimize.
[2024-05-29 14:34:22] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/918 variables, 8/330 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 14:34:22] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2024-05-29 14:34:22] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 2 ms to minimize.
[2024-05-29 14:34:22] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/918 variables, 3/333 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/918 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 32/950 variables, 16/349 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 14:34:22] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 2 ms to minimize.
[2024-05-29 14:34:22] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 2 ms to minimize.
[2024-05-29 14:34:22] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 2 ms to minimize.
[2024-05-29 14:34:23] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 2 ms to minimize.
[2024-05-29 14:34:23] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/950 variables, 5/354 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/950 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 973/1923 variables, 950/1304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1923 variables, 1/1305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 14:34:23] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 2 ms to minimize.
[2024-05-29 14:34:23] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 2 ms to minimize.
[2024-05-29 14:34:24] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 2 ms to minimize.
[2024-05-29 14:34:24] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 3 ms to minimize.
[2024-05-29 14:34:24] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 3 ms to minimize.
[2024-05-29 14:34:24] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 3 ms to minimize.
[2024-05-29 14:34:24] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 3 ms to minimize.
[2024-05-29 14:34:24] [INFO ] Deduced a trap composed of 6 places in 161 ms of which 3 ms to minimize.
[2024-05-29 14:34:25] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 3 ms to minimize.
[2024-05-29 14:34:25] [INFO ] Deduced a trap composed of 25 places in 153 ms of which 3 ms to minimize.
[2024-05-29 14:34:25] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 3 ms to minimize.
[2024-05-29 14:34:25] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 3 ms to minimize.
[2024-05-29 14:34:25] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 3 ms to minimize.
[2024-05-29 14:34:25] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 3 ms to minimize.
[2024-05-29 14:34:26] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 3 ms to minimize.
[2024-05-29 14:34:26] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 2 ms to minimize.
[2024-05-29 14:34:26] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1923 variables, 17/1322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1923 variables, 0/1322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 521/2444 variables, 308/1630 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2444 variables, 86/1716 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2444 variables, 3/1719 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2444 variables, 2/1721 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 14:34:29] [INFO ] Deduced a trap composed of 5 places in 231 ms of which 4 ms to minimize.
[2024-05-29 14:34:29] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 4 ms to minimize.
[2024-05-29 14:34:29] [INFO ] Deduced a trap composed of 8 places in 245 ms of which 3 ms to minimize.
[2024-05-29 14:34:30] [INFO ] Deduced a trap composed of 7 places in 231 ms of which 4 ms to minimize.
[2024-05-29 14:34:30] [INFO ] Deduced a trap composed of 4 places in 224 ms of which 4 ms to minimize.
[2024-05-29 14:34:30] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 4 ms to minimize.
[2024-05-29 14:34:30] [INFO ] Deduced a trap composed of 3 places in 227 ms of which 4 ms to minimize.
[2024-05-29 14:34:31] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 4 ms to minimize.
[2024-05-29 14:34:31] [INFO ] Deduced a trap composed of 5 places in 243 ms of which 3 ms to minimize.
[2024-05-29 14:34:31] [INFO ] Deduced a trap composed of 7 places in 228 ms of which 3 ms to minimize.
[2024-05-29 14:34:32] [INFO ] Deduced a trap composed of 5 places in 225 ms of which 4 ms to minimize.
[2024-05-29 14:34:32] [INFO ] Deduced a trap composed of 7 places in 204 ms of which 4 ms to minimize.
[2024-05-29 14:34:32] [INFO ] Deduced a trap composed of 6 places in 209 ms of which 4 ms to minimize.
[2024-05-29 14:34:32] [INFO ] Deduced a trap composed of 7 places in 202 ms of which 4 ms to minimize.
[2024-05-29 14:34:33] [INFO ] Deduced a trap composed of 7 places in 201 ms of which 4 ms to minimize.
[2024-05-29 14:34:33] [INFO ] Deduced a trap composed of 3 places in 195 ms of which 3 ms to minimize.
[2024-05-29 14:34:34] [INFO ] Deduced a trap composed of 8 places in 199 ms of which 4 ms to minimize.
[2024-05-29 14:34:34] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 4 ms to minimize.
[2024-05-29 14:34:34] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 4 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/2444 variables, 19/1740 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2444 variables, 0/1740 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 12/2456 variables, 14/1754 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2456 variables, 12/1766 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 14:34:35] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 3 ms to minimize.
[2024-05-29 14:34:35] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 4 ms to minimize.
[2024-05-29 14:34:36] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 3 ms to minimize.
[2024-05-29 14:34:36] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 4 ms to minimize.
[2024-05-29 14:34:36] [INFO ] Deduced a trap composed of 5 places in 188 ms of which 3 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/2456 variables, 5/1771 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2456 variables, 0/1771 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 12/2468 variables, 6/1777 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2468 variables, 10/1787 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2468 variables, 0/1787 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 8/2476 variables, 4/1791 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2476 variables, 4/1795 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2476 variables, 0/1795 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 333/2809 variables, 192/1987 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2809 variables, 45/2032 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2809 variables, 3/2035 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 14:34:38] [INFO ] Deduced a trap composed of 8 places in 235 ms of which 4 ms to minimize.
[2024-05-29 14:34:38] [INFO ] Deduced a trap composed of 6 places in 227 ms of which 4 ms to minimize.
[2024-05-29 14:34:39] [INFO ] Deduced a trap composed of 8 places in 208 ms of which 4 ms to minimize.
[2024-05-29 14:34:39] [INFO ] Deduced a trap composed of 11 places in 209 ms of which 3 ms to minimize.
[2024-05-29 14:34:39] [INFO ] Deduced a trap composed of 7 places in 210 ms of which 3 ms to minimize.
[2024-05-29 14:34:39] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 4 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/2809 variables, 6/2041 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2809 variables, 0/2041 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 16/2825 variables, 22/2063 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2825 variables, 16/2079 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 14:34:40] [INFO ] Deduced a trap composed of 6 places in 204 ms of which 5 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/2825 variables, 1/2080 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2825 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (OVERLAPS) 18/2843 variables, 9/2089 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2843 variables, 16/2105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2843 variables, 0/2105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (OVERLAPS) 4/2847 variables, 2/2107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/2847 variables, 2/2109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/2847 variables, 0/2109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (OVERLAPS) 1/2848 variables, 1/2110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/2848 variables, 1/2111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 14:34:42] [INFO ] Deduced a trap composed of 6 places in 223 ms of which 4 ms to minimize.
At refinement iteration 49 (INCLUDED_ONLY) 0/2848 variables, 1/2112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/2848 variables, 0/2112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (OVERLAPS) 139/2987 variables, 92/2204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/2987 variables, 29/2233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/2987 variables, 1/2234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 14:34:43] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 4 ms to minimize.
[2024-05-29 14:34:43] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 3 ms to minimize.
[2024-05-29 14:34:44] [INFO ] Deduced a trap composed of 9 places in 200 ms of which 4 ms to minimize.
[2024-05-29 14:34:44] [INFO ] Deduced a trap composed of 5 places in 190 ms of which 3 ms to minimize.
[2024-05-29 14:34:44] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 3 ms to minimize.
[2024-05-29 14:34:44] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 6 ms to minimize.
At refinement iteration 54 (INCLUDED_ONLY) 0/2987 variables, 6/2240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 14:34:45] [INFO ] Deduced a trap composed of 5 places in 178 ms of which 3 ms to minimize.
[2024-05-29 14:34:45] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 3 ms to minimize.
[2024-05-29 14:34:45] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 3 ms to minimize.
[2024-05-29 14:34:46] [INFO ] Deduced a trap composed of 6 places in 168 ms of which 4 ms to minimize.
At refinement iteration 55 (INCLUDED_ONLY) 0/2987 variables, 4/2244 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/2987 variables, 0/2244 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (OVERLAPS) 2/2989 variables, 3/2247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/2989 variables, 2/2249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/2989 variables, 0/2249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (OVERLAPS) 2/2991 variables, 1/2250 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/2991 variables, 0/2250 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (OVERLAPS) 43/3034 variables, 33/2283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/3034 variables, 9/2292 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/3034 variables, 0/2292 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (OVERLAPS) 2/3036 variables, 4/2296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/3036 variables, 2/2298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/3036 variables, 0/2298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (OVERLAPS) 6/3042 variables, 6/2304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/3042 variables, 3/2307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 14:34:48] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 3 ms to minimize.
At refinement iteration 70 (INCLUDED_ONLY) 0/3042 variables, 1/2308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/3042 variables, 0/2308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (OVERLAPS) 0/3042 variables, 0/2308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3042/3042 variables, and 2308 constraints, problems are : Problem set: 0 solved, 3 unsolved in 32829 ms.
Refiners :[Positive P Invariants (semi-flows): 522/522 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 1646/1646 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 108/108 constraints]
After SMT, in 36122ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3146 ms.
Support contains 81 out of 1646 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1646/1646 places, 1396/1396 transitions.
Applied a total of 0 rules in 59 ms. Remains 1646 /1646 variables (removed 0) and now considering 1396/1396 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 1646/1646 places, 1396/1396 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1646/1646 places, 1396/1396 transitions.
Applied a total of 0 rules in 55 ms. Remains 1646 /1646 variables (removed 0) and now considering 1396/1396 (removed 0) transitions.
[2024-05-29 14:34:53] [INFO ] Invariant cache hit.
[2024-05-29 14:34:53] [INFO ] Implicit Places using invariants in 827 ms returned []
[2024-05-29 14:34:53] [INFO ] Invariant cache hit.
[2024-05-29 14:34:55] [INFO ] Implicit Places using invariants and state equation in 1960 ms returned []
Implicit Place search using SMT with State Equation took 2794 ms to find 0 implicit places.
[2024-05-29 14:34:55] [INFO ] Redundant transitions in 81 ms returned []
Running 1371 sub problems to find dead transitions.
[2024-05-29 14:34:55] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1623 variables, 268/268 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
SMT process timed out in 30405ms, After SMT, problems are : Problem set: 0 solved, 1371 unsolved
Search for dead transitions found 0 dead transitions in 30420ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33372 ms. Remains : 1646/1646 places, 1396/1396 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-29 14:35:26] [INFO ] Flatten gal took : 111 ms
[2024-05-29 14:35:26] [INFO ] Applying decomposition
[2024-05-29 14:35:26] [INFO ] Flatten gal took : 102 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/graph17758334109052267624.txt' '-o' '/tmp/graph17758334109052267624.bin' '-w' '/tmp/graph17758334109052267624.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17758334109052267624.bin' '-l' '-1' '-v' '-w' '/tmp/graph17758334109052267624.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:35:27] [INFO ] Decomposing Gal with order
[2024-05-29 14:35:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:35:27] [INFO ] Removed a total of 450 redundant transitions.
[2024-05-29 14:35:28] [INFO ] Flatten gal took : 424 ms
[2024-05-29 14:35:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 25 ms.
[2024-05-29 14:35:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18156759755238799527.gal : 112 ms
[2024-05-29 14:35:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8771386228191123743.prop : 18 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/ReachabilityCardinality18156759755238799527.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8771386228191123743.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/ReachabilityCardinality8771386228191123743.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1 after 1.6435e+12
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :3.15307e+139 after 8.45848e+139
Reachability property ShieldPPPs-PT-050B-ReachabilityCardinality-2024-11 is true.
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :8.45848e+139 after 5.79136e+140
ITS-tools command line returned an error code 137
[2024-05-29 14:46:03] [INFO ] Flatten gal took : 51 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11331265029173260700
[2024-05-29 14:46:03] [INFO ] Computing symmetric may disable matrix : 1396 transitions.
[2024-05-29 14:46:03] [INFO ] Applying decomposition
[2024-05-29 14:46:04] [INFO ] Computation of Complete disable matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:46:04] [INFO ] Computing symmetric may enable matrix : 1396 transitions.
[2024-05-29 14:46:04] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:46:04] [INFO ] Flatten gal took : 55 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/graph8489211429890672795.txt' '-o' '/tmp/graph8489211429890672795.bin' '-w' '/tmp/graph8489211429890672795.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8489211429890672795.bin' '-l' '-1' '-v' '-w' '/tmp/graph8489211429890672795.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:46:04] [INFO ] Decomposing Gal with order
[2024-05-29 14:46:04] [INFO ] Computing Do-Not-Accords matrix : 1396 transitions.
[2024-05-29 14:46:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:46:04] [INFO ] Computation of Completed DNA matrix. took 55 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:46:04] [INFO ] Built C files in 765ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11331265029173260700
Running compilation step : cd /tmp/ltsmin11331265029173260700;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-29 14:46:04] [INFO ] Removed a total of 667 redundant transitions.
[2024-05-29 14:46:04] [INFO ] Flatten gal took : 77 ms
[2024-05-29 14:46:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 1193 labels/synchronizations in 110 ms.
[2024-05-29 14:46:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6253453117483134135.gal : 24 ms
[2024-05-29 14:46:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9746880124664368342.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/ReachabilityCardinality6253453117483134135.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9746880124664368342.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality9746880124664368342.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 55
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :55 after 480
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :480 after 2730
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :2730 after 147420
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :147420 after 4.83611e+09
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.07864e+18 after 1.39104e+21
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.39104e+21 after 1.19948e+57
Compilation finished in 6621 ms.
Running link step : cd /tmp/ltsmin11331265029173260700;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 89 ms.
Running LTSmin : cd /tmp/ltsmin11331265029173260700;'/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' 'ShieldPPPsPT050BReachabilityCardinality202407==true'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin11331265029173260700;'/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' 'ShieldPPPsPT050BReachabilityCardinality202407==true'
Running LTSmin : cd /tmp/ltsmin11331265029173260700;'/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' 'ShieldPPPsPT050BReachabilityCardinality202409==true'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin11331265029173260700;'/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' 'ShieldPPPsPT050BReachabilityCardinality202409==true'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin11331265029173260700;'/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' 'ShieldPPPsPT050BReachabilityCardinality202407==true'
Detected timeout of ITS tools.
[2024-05-29 15:10:23] [INFO ] Applying decomposition
[2024-05-29 15:10:23] [INFO ] Flatten gal took : 113 ms
[2024-05-29 15:10:23] [INFO ] Decomposing Gal with order
[2024-05-29 15:10:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 15:10:24] [INFO ] Removed a total of 1065 redundant transitions.
[2024-05-29 15:10:24] [INFO ] Flatten gal took : 298 ms
[2024-05-29 15:10:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 1608 labels/synchronizations in 329 ms.
[2024-05-29 15:10:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1144130100604048059.gal : 72 ms
[2024-05-29 15:10:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality568424698726612725.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/ReachabilityCardinality1144130100604048059.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality568424698726612725.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/ReachabilityCardinality568424698726612725.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 20
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :20 after 2730
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :2730 after 4.7007e+13
ITS-tools command line returned an error code 137
[2024-05-29 15:28:39] [INFO ] Flatten gal took : 122 ms
[2024-05-29 15:28:39] [INFO ] Input system was already deterministic with 1396 transitions.
[2024-05-29 15:28:39] [INFO ] Transformed 1646 places.
[2024-05-29 15:28:39] [INFO ] Transformed 1396 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-29 15:28:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7728613113768121061.gal : 7 ms
[2024-05-29 15:28:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3342814524025844982.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/ReachabilityCardinality7728613113768121061.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3342814524025844982.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...373
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityCardinality3342814524025844982.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 15
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :15 after 18
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :18 after 195
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :195 after 597
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :597 after 4392
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :4392 after 7229
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :7229 after 41373
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :41373 after 7.1346e+06
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :7.1346e+06 after 1.35915e+07
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.35915e+07 after 8.24301e+07
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :8.24301e+07 after 5.10673e+10
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :5.10673e+10 after 6.43604e+10
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :6.43604e+10 after 1.58113e+14
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :1.58113e+14 after 2.61601e+14
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :2.61601e+14 after 1.56381e+18
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :1.56381e+18 after 1.60138e+18

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-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 ShieldPPPs-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-171683761200510"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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