About the Execution of ITS-Tools for ShieldIIPt-PT-100B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16202.699 | 2129486.00 | 4039837.00 | 5049.90 | TTTFFFFTTTTTFTTT | 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-171683760900350.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is ShieldIIPt-PT-100B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760900350
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 20:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 12 20:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 12 20:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 20:40 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 1.7M May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716949396212
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-100B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-29 02:23:17] [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 02:23:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 02:23:17] [INFO ] Load time of PNML (sax parser for PT used): 287 ms
[2024-05-29 02:23:18] [INFO ] Transformed 7003 places.
[2024-05-29 02:23:18] [INFO ] Transformed 6503 transitions.
[2024-05-29 02:23:18] [INFO ] Found NUPN structural information;
[2024-05-29 02:23:18] [INFO ] Parsed PT model containing 7003 places and 6503 transitions and 16206 arcs in 751 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2861 ms. (13 steps per ms) remains 10/13 properties
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-29 02:23:19] [INFO ] Flatten gal took : 450 ms
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 219 ms. (181 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 485 ms. (82 steps per ms) remains 10/10 properties
[2024-05-29 02:23:19] [INFO ] Flatten gal took : 422 ms
BEST_FIRST walk for 40004 steps (8 resets) in 536 ms. (74 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 10/10 properties
[2024-05-29 02:23:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11467775511836601134.gal : 143 ms
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 10/10 properties
[2024-05-29 02:23:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2166814559654014382.prop : 20 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/ReachabilityCardinality11467775511836601134.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2166814559654014382.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 280 ms. (142 steps per ms) remains 10/10 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40003 steps (8 resets) in 135 ms. (294 steps per ms) remains 10/10 properties
// Phase 1: matrix 6503 rows 7003 cols
[2024-05-29 02:23:20] [INFO ] Computed 901 invariants in 66 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 129/129 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Loading property file /tmp/ReachabilityCardinality2166814559654014382.prop.
At refinement iteration 2 (OVERLAPS) 3004/3133 variables, 365/494 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3133 variables, 3004/3498 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3133 variables, 0/3498 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 3870/7003 variables, 536/4034 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7003 variables, 3870/7904 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7003 variables, 0/7904 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 13506/13506 variables, and 14907 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5049 ms.
Refiners :[Domain max(s): 7003/7003 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 7003/7003 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 129/129 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 3004/3133 variables, 365/494 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3133 variables, 3004/3498 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-29 02:23:26] [INFO ] Deduced a trap composed of 23 places in 541 ms of which 64 ms to minimize.
[2024-05-29 02:23:27] [INFO ] Deduced a trap composed of 24 places in 446 ms of which 8 ms to minimize.
[2024-05-29 02:23:27] [INFO ] Deduced a trap composed of 56 places in 418 ms of which 7 ms to minimize.
[2024-05-29 02:23:28] [INFO ] Deduced a trap composed of 86 places in 396 ms of which 7 ms to minimize.
[2024-05-29 02:23:28] [INFO ] Deduced a trap composed of 66 places in 395 ms of which 7 ms to minimize.
[2024-05-29 02:23:29] [INFO ] Deduced a trap composed of 75 places in 363 ms of which 7 ms to minimize.
[2024-05-29 02:23:29] [INFO ] Deduced a trap composed of 84 places in 328 ms of which 7 ms to minimize.
[2024-05-29 02:23:29] [INFO ] Deduced a trap composed of 85 places in 329 ms of which 6 ms to minimize.
[2024-05-29 02:23:30] [INFO ] Deduced a trap composed of 99 places in 311 ms of which 6 ms to minimize.
[2024-05-29 02:23:30] [INFO ] Deduced a trap composed of 106 places in 298 ms of which 5 ms to minimize.
SMT process timed out in 10401ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 129 out of 7003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7003/7003 places, 6503/6503 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1614 transitions
Trivial Post-agglo rules discarded 1614 transitions
Performed 1614 trivial Post agglomeration. Transition count delta: 1614
Iterating post reduction 0 with 1614 rules applied. Total rules applied 1614 place count 7003 transition count 4889
Reduce places removed 1614 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1616 rules applied. Total rules applied 3230 place count 5389 transition count 4887
Reduce places removed 1 places and 0 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 2 with 24 rules applied. Total rules applied 3254 place count 5388 transition count 4864
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 3277 place count 5365 transition count 4864
Performed 414 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 414 Pre rules applied. Total rules applied 3277 place count 5365 transition count 4450
Deduced a syphon composed of 414 places in 18 ms
Reduce places removed 414 places and 0 transitions.
Iterating global reduction 4 with 828 rules applied. Total rules applied 4105 place count 4951 transition count 4450
Discarding 673 places :
Symmetric choice reduction at 4 with 673 rule applications. Total rules 4778 place count 4278 transition count 3777
Iterating global reduction 4 with 673 rules applied. Total rules applied 5451 place count 4278 transition count 3777
Performed 280 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 280 Pre rules applied. Total rules applied 5451 place count 4278 transition count 3497
Deduced a syphon composed of 280 places in 15 ms
Reduce places removed 280 places and 0 transitions.
Iterating global reduction 4 with 560 rules applied. Total rules applied 6011 place count 3998 transition count 3497
Performed 1636 Post agglomeration using F-continuation condition.Transition count delta: 1636
Deduced a syphon composed of 1636 places in 5 ms
Reduce places removed 1636 places and 0 transitions.
Iterating global reduction 4 with 3272 rules applied. Total rules applied 9283 place count 2362 transition count 1861
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 9485 place count 2261 transition count 1920
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 9687 place count 2160 transition count 1980
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: -49
Deduced a syphon composed of 81 places in 5 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 4 with 162 rules applied. Total rules applied 9849 place count 2079 transition count 2029
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 9850 place count 2079 transition count 2028
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 9855 place count 2079 transition count 2023
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 9860 place count 2074 transition count 2023
Partial Free-agglomeration rule applied 95 times.
Drop transitions (Partial Free agglomeration) removed 95 transitions
Iterating global reduction 6 with 95 rules applied. Total rules applied 9955 place count 2074 transition count 2023
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 9956 place count 2073 transition count 2022
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 9958 place count 2071 transition count 2022
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 9958 place count 2071 transition count 2021
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 9960 place count 2070 transition count 2021
Applied a total of 9960 rules in 3161 ms. Remains 2070 /7003 variables (removed 4933) and now considering 2021/6503 (removed 4482) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3172 ms. Remains : 2070/7003 places, 2021/6503 transitions.
RANDOM walk for 40000 steps (8 resets) in 1242 ms. (32 steps per ms) remains 9/10 properties
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 495 ms. (80 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 477 ms. (83 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 506 ms. (78 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 483 ms. (82 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 507 ms. (78 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 490 ms. (81 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 491 ms. (81 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 546 ms. (73 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 494 ms. (80 steps per ms) remains 9/9 properties
// Phase 1: matrix 2021 rows 2070 cols
[2024-05-29 02:23:35] [INFO ] Computed 899 invariants in 6 ms
[2024-05-29 02:23:35] [INFO ] State equation strengthened by 635 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 710/790 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/790 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 903/1693 variables, 416/726 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1693 variables, 0/726 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1698/3391 variables, 1693/2419 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3391 variables, 624/3043 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3391 variables, 0/3043 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 229/3620 variables, 114/3157 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3620 variables, 49/3206 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3620 variables, 4/3210 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3620 variables, 0/3210 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 5/3625 variables, 7/3217 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3625 variables, 5/3222 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3625 variables, 0/3222 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 9/3634 variables, 4/3226 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3634 variables, 2/3228 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3634 variables, 0/3228 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 168/3802 variables, 94/3322 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3802 variables, 35/3357 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3802 variables, 4/3361 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3802 variables, 0/3361 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (OVERLAPS) 9/3811 variables, 8/3369 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3811 variables, 5/3374 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3811 variables, 0/3374 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (OVERLAPS) 19/3830 variables, 9/3383 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3830 variables, 0/3383 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (OVERLAPS) 79/3909 variables, 59/3442 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3909 variables, 14/3456 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3909 variables, 2/3458 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3909 variables, 0/3458 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (OVERLAPS) 2/3911 variables, 4/3462 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/3911 variables, 2/3464 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/3911 variables, 0/3464 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 34 (OVERLAPS) 21/3932 variables, 12/3476 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/3932 variables, 5/3481 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/3932 variables, 0/3481 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 37 (OVERLAPS) 1/3933 variables, 1/3482 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/3933 variables, 1/3483 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/3933 variables, 0/3483 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 40 (OVERLAPS) 2/3935 variables, 1/3484 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/3935 variables, 0/3484 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 42 (OVERLAPS) 20/3955 variables, 10/3494 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/3955 variables, 3/3497 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/3955 variables, 0/3497 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 45 (OVERLAPS) 1/3956 variables, 1/3498 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/3956 variables, 1/3499 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :69 after 129
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :129 after 933
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :933 after 4.45318e+08
At refinement iteration 47 (INCLUDED_ONLY) 0/3956 variables, 0/3499 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :4.45318e+08 after 4.68295e+19
At refinement iteration 48 (OVERLAPS) 16/3972 variables, 8/3507 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/3972 variables, 3/3510 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :4.68295e+19 after 4.47767e+40
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :4.47767e+40 after 5.20516e+94
At refinement iteration 50 (INCLUDED_ONLY) 0/3972 variables, 0/3510 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 51 (OVERLAPS) 1/3973 variables, 1/3511 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/3973 variables, 1/3512 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :5.20516e+94 after 6.95315e+274
At refinement iteration 53 (INCLUDED_ONLY) 0/3973 variables, 0/3512 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 54 (OVERLAPS) 2/3975 variables, 1/3513 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/3975 variables, 0/3513 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 56 (OVERLAPS) 20/3995 variables, 10/3523 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/3995 variables, 3/3526 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/3995 variables, 0/3526 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 59 (OVERLAPS) 3/3998 variables, 1/3527 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/3998 variables, 0/3527 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 61 (OVERLAPS) 16/4014 variables, 11/3538 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/4014 variables, 3/3541 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/4014 variables, 0/3541 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 64 (OVERLAPS) 1/4015 variables, 1/3542 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/4015 variables, 1/3543 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/4015 variables, 0/3543 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 67 (OVERLAPS) 2/4017 variables, 1/3544 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/4017 variables, 0/3544 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 69 (OVERLAPS) 20/4037 variables, 10/3554 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/4037 variables, 3/3557 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/4037 variables, 0/3557 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 72 (OVERLAPS) 1/4038 variables, 1/3558 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/4038 variables, 1/3559 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/4038 variables, 0/3559 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 75 (OVERLAPS) 16/4054 variables, 8/3567 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/4054 variables, 2/3569 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/4054 variables, 0/3569 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 78 (OVERLAPS) 2/4056 variables, 2/3571 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/4056 variables, 2/3573 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/4056 variables, 0/3573 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 81 (OVERLAPS) 2/4058 variables, 1/3574 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/4058 variables, 0/3574 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 83 (OVERLAPS) 16/4074 variables, 10/3584 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/4074 variables, 4/3588 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/4074 variables, 0/3588 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 86 (OVERLAPS) 9/4083 variables, 4/3592 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/4083 variables, 1/3593 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/4083 variables, 1/3594 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/4083 variables, 0/3594 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 90 (OVERLAPS) 1/4084 variables, 1/3595 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/4084 variables, 1/3596 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/4084 variables, 0/3596 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 93 (OVERLAPS) 1/4085 variables, 1/3597 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/4085 variables, 1/3598 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/4085 variables, 0/3598 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 96 (OVERLAPS) 6/4091 variables, 4/3602 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/4091 variables, 2/3604 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/4091 variables, 0/3604 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 99 (OVERLAPS) 0/4091 variables, 0/3604 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4091/4091 variables, and 3604 constraints, problems are : Problem set: 0 solved, 9 unsolved in 36053 ms.
Refiners :[Positive P Invariants (semi-flows): 899/899 constraints, State Equation: 2070/2070 constraints, ReadFeed: 635/635 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 710/790 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 02:24:11] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2024-05-29 02:24:12] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
[2024-05-29 02:24:12] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 2 ms to minimize.
[2024-05-29 02:24:12] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2024-05-29 02:24:12] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
[2024-05-29 02:24:12] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 1 ms to minimize.
[2024-05-29 02:24:12] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
[2024-05-29 02:24:12] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 2 ms to minimize.
[2024-05-29 02:24:12] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-05-29 02:24:12] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-05-29 02:24:12] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-05-29 02:24:12] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-05-29 02:24:12] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-05-29 02:24:13] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-05-29 02:24:13] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/790 variables, 15/325 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/790 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 903/1693 variables, 416/741 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 02:24:13] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-29 02:24:13] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 2 ms to minimize.
[2024-05-29 02:24:13] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 2 ms to minimize.
[2024-05-29 02:24:13] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-05-29 02:24:13] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-29 02:24:14] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-29 02:24:14] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-29 02:24:14] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-05-29 02:24:14] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1693 variables, 9/750 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1693 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1698/3391 variables, 1693/2443 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3391 variables, 624/3067 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3391 variables, 5/3072 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 02:24:18] [INFO ] Deduced a trap composed of 3 places in 212 ms of which 4 ms to minimize.
[2024-05-29 02:24:18] [INFO ] Deduced a trap composed of 5 places in 202 ms of which 3 ms to minimize.
[2024-05-29 02:24:18] [INFO ] Deduced a trap composed of 9 places in 201 ms of which 4 ms to minimize.
[2024-05-29 02:24:19] [INFO ] Deduced a trap composed of 6 places in 200 ms of which 4 ms to minimize.
[2024-05-29 02:24:19] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/3391 variables, 5/3077 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3391 variables, 0/3077 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 229/3620 variables, 114/3191 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3620 variables, 49/3240 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3620 variables, 4/3244 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3620 variables, 4/3248 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 02:24:23] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 3 ms to minimize.
[2024-05-29 02:24:23] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 3 ms to minimize.
[2024-05-29 02:24:24] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 4 ms to minimize.
[2024-05-29 02:24:25] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 4 ms to minimize.
[2024-05-29 02:24:26] [INFO ] Deduced a trap composed of 3 places in 335 ms of which 6 ms to minimize.
[2024-05-29 02:24:27] [INFO ] Deduced a trap composed of 5 places in 346 ms of which 6 ms to minimize.
[2024-05-29 02:24:27] [INFO ] Deduced a trap composed of 7 places in 335 ms of which 5 ms to minimize.
[2024-05-29 02:24:27] [INFO ] Deduced a trap composed of 6 places in 324 ms of which 5 ms to minimize.
[2024-05-29 02:24:28] [INFO ] Deduced a trap composed of 4 places in 330 ms of which 6 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/3620 variables, 9/3257 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 02:24:31] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/3620 variables, 1/3258 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3620 variables, 0/3258 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 5/3625 variables, 7/3265 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3625 variables, 5/3270 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3625 variables, 0/3270 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (OVERLAPS) 9/3634 variables, 4/3274 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3634 variables, 2/3276 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3634 variables, 0/3276 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (OVERLAPS) 168/3802 variables, 94/3370 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3802 variables, 35/3405 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3802 variables, 4/3409 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 02:24:40] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 3 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/3802 variables, 1/3410 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3802 variables, 0/3410 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (OVERLAPS) 9/3811 variables, 8/3418 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/3811 variables, 5/3423 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/3811 variables, 0/3423 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 33 (OVERLAPS) 19/3830 variables, 9/3432 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 02:24:45] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 5 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/3830 variables, 1/3433 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/3830 variables, 0/3433 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 36 (OVERLAPS) 79/3909 variables, 59/3492 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/3909 variables, 14/3506 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/3909 variables, 2/3508 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 02:24:50] [INFO ] Deduced a trap composed of 5 places in 181 ms of which 3 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/3909 variables, 1/3509 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/3909 variables, 0/3509 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 41 (OVERLAPS) 2/3911 variables, 4/3513 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/3911 variables, 2/3515 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/3911 variables, 0/3515 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 44 (OVERLAPS) 21/3932 variables, 12/3527 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/3932 variables, 5/3532 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3932/4091 variables, and 3532 constraints, problems are : Problem set: 0 solved, 9 unsolved in 45025 ms.
Refiners :[Positive P Invariants (semi-flows): 861/899 constraints, State Equation: 1986/2070 constraints, ReadFeed: 634/635 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 42/42 constraints]
After SMT, in 81149ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 80 out of 2070 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2070/2070 places, 2021/2021 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 2070 transition count 2008
Reduce places removed 13 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 15 rules applied. Total rules applied 28 place count 2057 transition count 2006
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 30 place count 2055 transition count 2006
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 30 place count 2055 transition count 2001
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 40 place count 2050 transition count 2001
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 2049 transition count 2000
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 2049 transition count 2000
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 5 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 108 place count 2016 transition count 1967
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 118 place count 2011 transition count 1969
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 2011 transition count 1968
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 120 place count 2010 transition count 1968
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 125 place count 2010 transition count 1968
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 129 place count 2006 transition count 1964
Applied a total of 129 rules in 572 ms. Remains 2006 /2070 variables (removed 64) and now considering 1964/2021 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 572 ms. Remains : 2006/2070 places, 1964/2021 transitions.
RANDOM walk for 40000 steps (8 resets) in 1673 ms. (23 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 676 ms. (59 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 626 ms. (63 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 696 ms. (57 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 729 ms. (54 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 718 ms. (55 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 803 ms. (49 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 646 ms. (61 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 796 ms. (50 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 665 ms. (60 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 132935 steps, run timeout after 6003 ms. (steps per millisecond=22 ) properties seen :0 out of 9
Probabilistic random walk after 132935 steps, saw 118584 distinct states, run finished after 6008 ms. (steps per millisecond=22 ) properties seen :0
// Phase 1: matrix 1964 rows 2006 cols
[2024-05-29 02:25:05] [INFO ] Computed 899 invariants in 5 ms
[2024-05-29 02:25:05] [INFO ] State equation strengthened by 257 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 686/766 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 60/826 variables, 29/339 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/826 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 937/1763 variables, 826/1165 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1763 variables, 252/1417 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1763 variables, 0/1417 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 698/2461 variables, 343/1760 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2461 variables, 156/1916 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2461 variables, 3/1919 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2461 variables, 0/1919 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 11/2472 variables, 12/1931 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2472 variables, 11/1942 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2472 variables, 0/1942 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 20/2492 variables, 10/1952 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2492 variables, 0/1952 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 653/3145 variables, 358/2310 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3145 variables, 146/2456 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3145 variables, 1/2457 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3145 variables, 0/2457 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 15/3160 variables, 22/2479 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3160 variables, 15/2494 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3160 variables, 0/2494 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (OVERLAPS) 16/3176 variables, 8/2502 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3176 variables, 0/2502 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (OVERLAPS) 373/3549 variables, 204/2706 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3549 variables, 73/2779 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3549 variables, 0/2779 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (OVERLAPS) 16/3565 variables, 21/2800 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3565 variables, 16/2816 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/3565 variables, 0/2816 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 32 (OVERLAPS) 22/3587 variables, 11/2827 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/3587 variables, 0/2827 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 34 (OVERLAPS) 132/3719 variables, 98/2925 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/3719 variables, 34/2959 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/3719 variables, 0/2959 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 37 (OVERLAPS) 3/3722 variables, 4/2963 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/3722 variables, 3/2966 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/3722 variables, 0/2966 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 40 (OVERLAPS) 4/3726 variables, 2/2968 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/3726 variables, 0/2968 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 42 (OVERLAPS) 68/3794 variables, 36/3004 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/3794 variables, 13/3017 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/3794 variables, 0/3017 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 45 (OVERLAPS) 2/3796 variables, 3/3020 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/3796 variables, 2/3022 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/3796 variables, 0/3022 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 48 (OVERLAPS) 2/3798 variables, 1/3023 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/3798 variables, 0/3023 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 50 (OVERLAPS) 42/3840 variables, 24/3047 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/3840 variables, 10/3057 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/3840 variables, 0/3057 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 53 (OVERLAPS) 1/3841 variables, 1/3058 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/3841 variables, 1/3059 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/3841 variables, 0/3059 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 56 (OVERLAPS) 2/3843 variables, 1/3060 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/3843 variables, 0/3060 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 58 (OVERLAPS) 33/3876 variables, 18/3078 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/3876 variables, 6/3084 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/3876 variables, 0/3084 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 61 (OVERLAPS) 1/3877 variables, 2/3086 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/3877 variables, 1/3087 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/3877 variables, 0/3087 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 64 (OVERLAPS) 19/3896 variables, 10/3097 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/3896 variables, 4/3101 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/3896 variables, 0/3101 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 67 (OVERLAPS) 1/3897 variables, 1/3102 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/3897 variables, 1/3103 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/3897 variables, 0/3103 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 70 (OVERLAPS) 2/3899 variables, 1/3104 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/3899 variables, 0/3104 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 72 (OVERLAPS) 18/3917 variables, 10/3114 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/3917 variables, 4/3118 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/3917 variables, 0/3118 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 75 (OVERLAPS) 17/3934 variables, 8/3126 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/3934 variables, 3/3129 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/3934 variables, 0/3129 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 78 (OVERLAPS) 1/3935 variables, 1/3130 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/3935 variables, 1/3131 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/3935 variables, 0/3131 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 81 (OVERLAPS) 2/3937 variables, 1/3132 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/3937 variables, 0/3132 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 83 (OVERLAPS) 16/3953 variables, 10/3142 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/3953 variables, 4/3146 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/3953 variables, 0/3146 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 86 (OVERLAPS) 9/3962 variables, 4/3150 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/3962 variables, 1/3151 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/3962 variables, 1/3152 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/3962 variables, 0/3152 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 90 (OVERLAPS) 1/3963 variables, 1/3153 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/3963 variables, 1/3154 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/3963 variables, 0/3154 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 93 (OVERLAPS) 1/3964 variables, 1/3155 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/3964 variables, 1/3156 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/3964 variables, 0/3156 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 96 (OVERLAPS) 6/3970 variables, 4/3160 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/3970 variables, 2/3162 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/3970 variables, 0/3162 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 99 (OVERLAPS) 0/3970 variables, 0/3162 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3970/3970 variables, and 3162 constraints, problems are : Problem set: 0 solved, 9 unsolved in 22483 ms.
Refiners :[Positive P Invariants (semi-flows): 899/899 constraints, State Equation: 2006/2006 constraints, ReadFeed: 257/257 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 686/766 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 02:25:28] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2024-05-29 02:25:28] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2024-05-29 02:25:28] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-05-29 02:25:28] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 9 ms to minimize.
[2024-05-29 02:25:28] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2024-05-29 02:25:29] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-05-29 02:25:29] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2024-05-29 02:25:29] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 8/318 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/766 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 60/826 variables, 29/347 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 02:25:29] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2024-05-29 02:25:29] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 2 ms to minimize.
[2024-05-29 02:25:29] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2024-05-29 02:25:29] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/826 variables, 4/351 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/826 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 937/1763 variables, 826/1177 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1763 variables, 252/1429 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1763 variables, 1/1430 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 02:25:30] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 3 ms to minimize.
[2024-05-29 02:25:30] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 2 ms to minimize.
[2024-05-29 02:25:31] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1763 variables, 3/1433 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 02:25:31] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1763 variables, 1/1434 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1763 variables, 0/1434 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 698/2461 variables, 343/1777 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2461 variables, 156/1933 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2461 variables, 3/1936 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2461 variables, 8/1944 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 02:25:33] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 3 ms to minimize.
[2024-05-29 02:25:33] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 3 ms to minimize.
[2024-05-29 02:25:33] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 3 ms to minimize.
[2024-05-29 02:25:33] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 2 ms to minimize.
[2024-05-29 02:25:34] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 3 ms to minimize.
[2024-05-29 02:25:34] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 3 ms to minimize.
[2024-05-29 02:25:34] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 2 ms to minimize.
[2024-05-29 02:25:35] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2461 variables, 8/1952 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 02:25:35] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2461 variables, 1/1953 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2461 variables, 0/1953 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 11/2472 variables, 12/1965 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2472 variables, 11/1976 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2472 variables, 0/1976 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (OVERLAPS) 20/2492 variables, 10/1986 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2492 variables, 0/1986 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (OVERLAPS) 653/3145 variables, 358/2344 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3145 variables, 146/2490 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3145 variables, 1/2491 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 02:25:40] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 3 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/3145 variables, 1/2492 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3145 variables, 0/2492 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (OVERLAPS) 15/3160 variables, 22/2514 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/3160 variables, 15/2529 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/3160 variables, 0/2529 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 33 (OVERLAPS) 16/3176 variables, 8/2537 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/3176 variables, 0/2537 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 35 (OVERLAPS) 373/3549 variables, 204/2741 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/3549 variables, 73/2814 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/3549 variables, 0/2814 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 38 (OVERLAPS) 16/3565 variables, 21/2835 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/3565 variables, 16/2851 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/3565 variables, 0/2851 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 41 (OVERLAPS) 22/3587 variables, 11/2862 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/3587 variables, 0/2862 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 43 (OVERLAPS) 132/3719 variables, 98/2960 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/3719 variables, 34/2994 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/3719 variables, 0/2994 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 46 (OVERLAPS) 3/3722 variables, 4/2998 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/3722 variables, 3/3001 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/3722 variables, 0/3001 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 49 (OVERLAPS) 4/3726 variables, 2/3003 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/3726 variables, 0/3003 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 51 (OVERLAPS) 68/3794 variables, 36/3039 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/3794 variables, 13/3052 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/3794 variables, 0/3052 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 54 (OVERLAPS) 2/3796 variables, 3/3055 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/3796 variables, 2/3057 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/3796 variables, 0/3057 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 57 (OVERLAPS) 2/3798 variables, 1/3058 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/3798 variables, 0/3058 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 59 (OVERLAPS) 42/3840 variables, 24/3082 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/3840 variables, 10/3092 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/3840 variables, 0/3092 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 62 (OVERLAPS) 1/3841 variables, 1/3093 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/3841 variables, 1/3094 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/3841 variables, 0/3094 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 65 (OVERLAPS) 2/3843 variables, 1/3095 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/3843 variables, 0/3095 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 67 (OVERLAPS) 33/3876 variables, 18/3113 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/3876 variables, 6/3119 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/3876 variables, 0/3119 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 70 (OVERLAPS) 1/3877 variables, 2/3121 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/3877 variables, 1/3122 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/3877 variables, 0/3122 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 73 (OVERLAPS) 19/3896 variables, 10/3132 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/3896 variables, 4/3136 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/3896 variables, 0/3136 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 76 (OVERLAPS) 1/3897 variables, 1/3137 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/3897 variables, 1/3138 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/3897 variables, 0/3138 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 79 (OVERLAPS) 2/3899 variables, 1/3139 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/3899 variables, 0/3139 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 81 (OVERLAPS) 18/3917 variables, 10/3149 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/3917 variables, 4/3153 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/3917 variables, 0/3153 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 84 (OVERLAPS) 17/3934 variables, 8/3161 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/3934 variables, 3/3164 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/3934 variables, 0/3164 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 87 (OVERLAPS) 1/3935 variables, 1/3165 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/3935 variables, 1/3166 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/3935 variables, 0/3166 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 90 (OVERLAPS) 2/3937 variables, 1/3167 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/3937 variables, 0/3167 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 92 (OVERLAPS) 16/3953 variables, 10/3177 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/3953 variables, 4/3181 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/3953 variables, 0/3181 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 95 (OVERLAPS) 9/3962 variables, 4/3185 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/3962 variables, 1/3186 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/3962 variables, 1/3187 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 02:26:10] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 3 ms to minimize.
At refinement iteration 98 (INCLUDED_ONLY) 0/3962 variables, 1/3188 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/3962 variables, 0/3188 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 100 (OVERLAPS) 1/3963 variables, 1/3189 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/3963 variables, 1/3190 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/3963 variables, 0/3190 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 103 (OVERLAPS) 1/3964 variables, 1/3191 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/3964 variables, 1/3192 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/3964 variables, 0/3192 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 106 (OVERLAPS) 6/3970 variables, 4/3196 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/3970 variables, 2/3198 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/3970 variables, 0/3198 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 109 (OVERLAPS) 0/3970 variables, 0/3198 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3970/3970 variables, and 3198 constraints, problems are : Problem set: 0 solved, 9 unsolved in 49462 ms.
Refiners :[Positive P Invariants (semi-flows): 899/899 constraints, State Equation: 2006/2006 constraints, ReadFeed: 257/257 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 27/27 constraints]
After SMT, in 71999ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 11466 ms.
Support contains 80 out of 2006 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2006/2006 places, 1964/1964 transitions.
Applied a total of 0 rules in 69 ms. Remains 2006 /2006 variables (removed 0) and now considering 1964/1964 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 2006/2006 places, 1964/1964 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2006/2006 places, 1964/1964 transitions.
Applied a total of 0 rules in 58 ms. Remains 2006 /2006 variables (removed 0) and now considering 1964/1964 (removed 0) transitions.
[2024-05-29 02:26:29] [INFO ] Invariant cache hit.
[2024-05-29 02:26:30] [INFO ] Implicit Places using invariants in 1118 ms returned [1995]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1127 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2005/2006 places, 1964/1964 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 2004 transition count 1963
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2004 transition count 1963
Applied a total of 2 rules in 101 ms. Remains 2004 /2005 variables (removed 1) and now considering 1963/1964 (removed 1) transitions.
// Phase 1: matrix 1963 rows 2004 cols
[2024-05-29 02:26:30] [INFO ] Computed 898 invariants in 11 ms
[2024-05-29 02:26:31] [INFO ] Implicit Places using invariants in 1188 ms returned []
[2024-05-29 02:26:31] [INFO ] Invariant cache hit.
[2024-05-29 02:26:32] [INFO ] State equation strengthened by 256 read => feed constraints.
[2024-05-29 02:26:39] [INFO ] Implicit Places using invariants and state equation in 7717 ms returned []
Implicit Place search using SMT with State Equation took 8912 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2004/2006 places, 1963/1964 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 10198 ms. Remains : 2004/2006 places, 1963/1964 transitions.
RANDOM walk for 40000 steps (8 resets) in 960 ms. (41 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 650 ms. (61 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 701 ms. (56 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 647 ms. (61 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 646 ms. (61 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 752 ms. (53 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 627 ms. (63 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 636 ms. (62 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 711 ms. (56 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 750 ms. (53 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 142848 steps, run timeout after 6002 ms. (steps per millisecond=23 ) properties seen :0 out of 9
Probabilistic random walk after 142848 steps, saw 131906 distinct states, run finished after 6002 ms. (steps per millisecond=23 ) properties seen :0
[2024-05-29 02:26:47] [INFO ] Invariant cache hit.
[2024-05-29 02:26:47] [INFO ] State equation strengthened by 256 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 686/766 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 60/826 variables, 29/339 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/826 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 937/1763 variables, 826/1165 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1763 variables, 252/1417 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1763 variables, 0/1417 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 698/2461 variables, 343/1760 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2461 variables, 156/1916 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2461 variables, 3/1919 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2461 variables, 0/1919 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 11/2472 variables, 12/1931 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2472 variables, 11/1942 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2472 variables, 0/1942 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 20/2492 variables, 10/1952 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2492 variables, 0/1952 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 653/3145 variables, 358/2310 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3145 variables, 146/2456 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3145 variables, 1/2457 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3145 variables, 0/2457 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 15/3160 variables, 22/2479 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3160 variables, 15/2494 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3160 variables, 0/2494 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (OVERLAPS) 16/3176 variables, 8/2502 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3176 variables, 0/2502 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (OVERLAPS) 373/3549 variables, 204/2706 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3549 variables, 73/2779 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3549 variables, 0/2779 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (OVERLAPS) 16/3565 variables, 21/2800 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3565 variables, 16/2816 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/3565 variables, 0/2816 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 32 (OVERLAPS) 22/3587 variables, 11/2827 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/3587 variables, 0/2827 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 34 (OVERLAPS) 132/3719 variables, 98/2925 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/3719 variables, 34/2959 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/3719 variables, 0/2959 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 37 (OVERLAPS) 3/3722 variables, 4/2963 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/3722 variables, 3/2966 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/3722 variables, 0/2966 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 40 (OVERLAPS) 4/3726 variables, 2/2968 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/3726 variables, 0/2968 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 42 (OVERLAPS) 68/3794 variables, 36/3004 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/3794 variables, 13/3017 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/3794 variables, 0/3017 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 45 (OVERLAPS) 2/3796 variables, 3/3020 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/3796 variables, 2/3022 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/3796 variables, 0/3022 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 48 (OVERLAPS) 2/3798 variables, 1/3023 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/3798 variables, 0/3023 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 50 (OVERLAPS) 42/3840 variables, 24/3047 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/3840 variables, 10/3057 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/3840 variables, 0/3057 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 53 (OVERLAPS) 1/3841 variables, 1/3058 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/3841 variables, 1/3059 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/3841 variables, 0/3059 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 56 (OVERLAPS) 2/3843 variables, 1/3060 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/3843 variables, 0/3060 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 58 (OVERLAPS) 33/3876 variables, 18/3078 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/3876 variables, 6/3084 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/3876 variables, 0/3084 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 61 (OVERLAPS) 1/3877 variables, 2/3086 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/3877 variables, 1/3087 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/3877 variables, 0/3087 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 64 (OVERLAPS) 19/3896 variables, 10/3097 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/3896 variables, 4/3101 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/3896 variables, 0/3101 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 67 (OVERLAPS) 1/3897 variables, 1/3102 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/3897 variables, 1/3103 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/3897 variables, 0/3103 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 70 (OVERLAPS) 2/3899 variables, 1/3104 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/3899 variables, 0/3104 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 72 (OVERLAPS) 18/3917 variables, 10/3114 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/3917 variables, 4/3118 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/3917 variables, 0/3118 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 75 (OVERLAPS) 17/3934 variables, 8/3126 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/3934 variables, 3/3129 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/3934 variables, 0/3129 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 78 (OVERLAPS) 1/3935 variables, 1/3130 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/3935 variables, 1/3131 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/3935 variables, 0/3131 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 81 (OVERLAPS) 2/3937 variables, 1/3132 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/3937 variables, 0/3132 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 83 (OVERLAPS) 16/3953 variables, 10/3142 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/3953 variables, 4/3146 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/3953 variables, 0/3146 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 86 (OVERLAPS) 8/3961 variables, 4/3150 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/3961 variables, 2/3152 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/3961 variables, 0/3152 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 89 (OVERLAPS) 6/3967 variables, 4/3156 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/3967 variables, 2/3158 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/3967 variables, 0/3158 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 92 (OVERLAPS) 0/3967 variables, 0/3158 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3967/3967 variables, and 3158 constraints, problems are : Problem set: 0 solved, 9 unsolved in 21853 ms.
Refiners :[Positive P Invariants (semi-flows): 898/898 constraints, State Equation: 2004/2004 constraints, ReadFeed: 256/256 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 686/766 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 02:27:09] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-05-29 02:27:09] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-05-29 02:27:10] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2024-05-29 02:27:10] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 4/314 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/766 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 60/826 variables, 29/343 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 02:27:10] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 2 ms to minimize.
[2024-05-29 02:27:10] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 1 ms to minimize.
[2024-05-29 02:27:10] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/826 variables, 3/346 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 02:27:11] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/826 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/826 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 937/1763 variables, 826/1173 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1763 variables, 252/1425 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1763 variables, 1/1426 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 02:27:11] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1763 variables, 1/1427 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1763 variables, 0/1427 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 698/2461 variables, 343/1770 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2461 variables, 156/1926 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2461 variables, 3/1929 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2461 variables, 8/1937 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 02:27:13] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 3 ms to minimize.
[2024-05-29 02:27:13] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 2 ms to minimize.
[2024-05-29 02:27:13] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 2 ms to minimize.
[2024-05-29 02:27:13] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 3 ms to minimize.
[2024-05-29 02:27:13] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 3 ms to minimize.
[2024-05-29 02:27:14] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 2 ms to minimize.
[2024-05-29 02:27:14] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 2 ms to minimize.
[2024-05-29 02:27:14] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 3 ms to minimize.
[2024-05-29 02:27:14] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 2 ms to minimize.
[2024-05-29 02:27:14] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 2 ms to minimize.
[2024-05-29 02:27:15] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2461 variables, 11/1948 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 02:27:16] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2461 variables, 1/1949 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2461 variables, 0/1949 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 11/2472 variables, 12/1961 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2472 variables, 11/1972 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 02:27:17] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/2472 variables, 1/1973 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2472 variables, 0/1973 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (OVERLAPS) 20/2492 variables, 10/1983 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2492 variables, 0/1983 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (OVERLAPS) 653/3145 variables, 358/2341 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3145 variables, 146/2487 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3145 variables, 1/2488 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 02:27:20] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 3 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/3145 variables, 1/2489 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3145 variables, 0/2489 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (OVERLAPS) 15/3160 variables, 22/2511 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/3160 variables, 15/2526 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/3160 variables, 0/2526 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 34 (OVERLAPS) 16/3176 variables, 8/2534 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/3176 variables, 0/2534 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 36 (OVERLAPS) 373/3549 variables, 204/2738 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/3549 variables, 73/2811 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/3549 variables, 0/2811 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 39 (OVERLAPS) 16/3565 variables, 21/2832 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/3565 variables, 16/2848 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/3565 variables, 0/2848 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 42 (OVERLAPS) 22/3587 variables, 11/2859 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/3587 variables, 0/2859 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 44 (OVERLAPS) 132/3719 variables, 98/2957 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/3719 variables, 34/2991 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/3719 variables, 0/2991 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 47 (OVERLAPS) 3/3722 variables, 4/2995 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/3722 variables, 3/2998 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/3722 variables, 0/2998 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 50 (OVERLAPS) 4/3726 variables, 2/3000 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/3726 variables, 0/3000 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 52 (OVERLAPS) 68/3794 variables, 36/3036 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/3794 variables, 13/3049 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/3794 variables, 0/3049 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 55 (OVERLAPS) 2/3796 variables, 3/3052 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/3796 variables, 2/3054 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/3796 variables, 0/3054 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 58 (OVERLAPS) 2/3798 variables, 1/3055 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/3798 variables, 0/3055 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 60 (OVERLAPS) 42/3840 variables, 24/3079 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/3840 variables, 10/3089 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/3840 variables, 0/3089 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 63 (OVERLAPS) 1/3841 variables, 1/3090 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/3841 variables, 1/3091 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/3841 variables, 0/3091 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 66 (OVERLAPS) 2/3843 variables, 1/3092 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/3843 variables, 0/3092 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 68 (OVERLAPS) 33/3876 variables, 18/3110 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/3876 variables, 6/3116 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/3876 variables, 0/3116 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 71 (OVERLAPS) 1/3877 variables, 2/3118 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/3877 variables, 1/3119 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/3877 variables, 0/3119 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 74 (OVERLAPS) 19/3896 variables, 10/3129 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/3896 variables, 4/3133 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/3896 variables, 0/3133 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 77 (OVERLAPS) 1/3897 variables, 1/3134 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/3897 variables, 1/3135 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/3897 variables, 0/3135 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 80 (OVERLAPS) 2/3899 variables, 1/3136 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/3899 variables, 0/3136 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 82 (OVERLAPS) 18/3917 variables, 10/3146 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/3917 variables, 4/3150 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/3917 variables, 0/3150 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 85 (OVERLAPS) 17/3934 variables, 8/3158 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/3934 variables, 3/3161 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/3934 variables, 0/3161 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 88 (OVERLAPS) 1/3935 variables, 1/3162 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/3935 variables, 1/3163 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/3935 variables, 0/3163 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 91 (OVERLAPS) 2/3937 variables, 1/3164 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/3937 variables, 0/3164 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 93 (OVERLAPS) 16/3953 variables, 10/3174 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/3953 variables, 4/3178 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/3953 variables, 0/3178 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 96 (OVERLAPS) 8/3961 variables, 4/3182 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/3961 variables, 2/3184 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/3961 variables, 0/3184 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 99 (OVERLAPS) 6/3967 variables, 4/3188 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/3967 variables, 2/3190 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/3967 variables, 0/3190 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 102 (OVERLAPS) 0/3967 variables, 0/3190 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3967/3967 variables, and 3190 constraints, problems are : Problem set: 0 solved, 9 unsolved in 43146 ms.
Refiners :[Positive P Invariants (semi-flows): 898/898 constraints, State Equation: 2004/2004 constraints, ReadFeed: 256/256 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 23/23 constraints]
After SMT, in 65030ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 12474 ms.
Support contains 80 out of 2004 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2004/2004 places, 1963/1963 transitions.
Applied a total of 0 rules in 52 ms. Remains 2004 /2004 variables (removed 0) and now considering 1963/1963 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 2004/2004 places, 1963/1963 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2004/2004 places, 1963/1963 transitions.
Applied a total of 0 rules in 52 ms. Remains 2004 /2004 variables (removed 0) and now considering 1963/1963 (removed 0) transitions.
[2024-05-29 02:28:05] [INFO ] Invariant cache hit.
[2024-05-29 02:28:06] [INFO ] Implicit Places using invariants in 1093 ms returned []
[2024-05-29 02:28:06] [INFO ] Invariant cache hit.
[2024-05-29 02:28:07] [INFO ] State equation strengthened by 256 read => feed constraints.
[2024-05-29 02:28:14] [INFO ] Implicit Places using invariants and state equation in 8009 ms returned []
Implicit Place search using SMT with State Equation took 9105 ms to find 0 implicit places.
[2024-05-29 02:28:14] [INFO ] Redundant transitions in 99 ms returned []
Running 1937 sub problems to find dead transitions.
[2024-05-29 02:28:14] [INFO ] Invariant cache hit.
[2024-05-29 02:28:14] [INFO ] State equation strengthened by 256 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1981 variables, 599/599 constraints. Problems are: Problem set: 0 solved, 1937 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1981/3967 variables, and 599 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 599/898 constraints, State Equation: 0/2004 constraints, ReadFeed: 0/256 constraints, PredecessorRefiner: 1937/1937 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1937 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1981 variables, 599/599 constraints. Problems are: Problem set: 0 solved, 1937 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1981/3967 variables, and 599 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 599/898 constraints, State Equation: 0/2004 constraints, ReadFeed: 0/256 constraints, PredecessorRefiner: 0/1937 constraints, Known Traps: 0/0 constraints]
After SMT, in 60771ms problems are : Problem set: 0 solved, 1937 unsolved
Search for dead transitions found 0 dead transitions in 60791ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70063 ms. Remains : 2004/2004 places, 1963/1963 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 269 times.
Drop transitions (Partial Free agglomeration) removed 269 transitions
Iterating global reduction 0 with 269 rules applied. Total rules applied 269 place count 2004 transition count 1963
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 272 place count 2004 transition count 1960
Applied a total of 272 rules in 159 ms. Remains 2004 /2004 variables (removed 0) and now considering 1960/1963 (removed 3) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 1960 rows 2004 cols
[2024-05-29 02:29:15] [INFO ] Computed 898 invariants in 8 ms
[2024-05-29 02:29:16] [INFO ] After 491ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-29 02:29:16] [INFO ] [Nat]Absence check using 898 positive place invariants in 141 ms returned sat
[2024-05-29 02:29:18] [INFO ] After 1446ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-29 02:29:18] [INFO ] State equation strengthened by 249 read => feed constraints.
[2024-05-29 02:29:19] [INFO ] After 1459ms SMT Verify possible using 249 Read/Feed constraints in natural domain returned unsat :0 sat :9
TRAPS : Iteration 0
[2024-05-29 02:29:20] [INFO ] Deduced a trap composed of 3 places in 222 ms of which 5 ms to minimize.
[2024-05-29 02:29:20] [INFO ] Deduced a trap composed of 5 places in 218 ms of which 4 ms to minimize.
[2024-05-29 02:29:20] [INFO ] Deduced a trap composed of 3 places in 226 ms of which 3 ms to minimize.
[2024-05-29 02:29:21] [INFO ] Deduced a trap composed of 5 places in 252 ms of which 4 ms to minimize.
[2024-05-29 02:29:21] [INFO ] Deduced a trap composed of 4 places in 232 ms of which 5 ms to minimize.
[2024-05-29 02:29:21] [INFO ] Deduced a trap composed of 5 places in 232 ms of which 4 ms to minimize.
[2024-05-29 02:29:22] [INFO ] Deduced a trap composed of 5 places in 284 ms of which 5 ms to minimize.
[2024-05-29 02:29:22] [INFO ] Deduced a trap composed of 7 places in 239 ms of which 4 ms to minimize.
[2024-05-29 02:29:22] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 5 ms to minimize.
[2024-05-29 02:29:23] [INFO ] Deduced a trap composed of 12 places in 235 ms of which 4 ms to minimize.
[2024-05-29 02:29:23] [INFO ] Deduced a trap composed of 9 places in 231 ms of which 4 ms to minimize.
[2024-05-29 02:29:23] [INFO ] Deduced a trap composed of 7 places in 234 ms of which 5 ms to minimize.
[2024-05-29 02:29:23] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3759 ms
[2024-05-29 02:29:24] [INFO ] Deduced a trap composed of 6 places in 233 ms of which 4 ms to minimize.
[2024-05-29 02:29:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 371 ms
[2024-05-29 02:29:25] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 4 ms to minimize.
[2024-05-29 02:29:25] [INFO ] Deduced a trap composed of 8 places in 212 ms of which 4 ms to minimize.
[2024-05-29 02:29:26] [INFO ] Deduced a trap composed of 6 places in 217 ms of which 4 ms to minimize.
[2024-05-29 02:29:26] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 4 ms to minimize.
[2024-05-29 02:29:26] [INFO ] Deduced a trap composed of 7 places in 210 ms of which 4 ms to minimize.
[2024-05-29 02:29:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1543 ms
TRAPS : Iteration 1
[2024-05-29 02:29:28] [INFO ] Deduced a trap composed of 4 places in 232 ms of which 4 ms to minimize.
[2024-05-29 02:29:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 370 ms
[2024-05-29 02:29:28] [INFO ] Deduced a trap composed of 6 places in 207 ms of which 4 ms to minimize.
[2024-05-29 02:29:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 367 ms
TRAPS : Iteration 2
[2024-05-29 02:29:30] [INFO ] Deduced a trap composed of 7 places in 234 ms of which 4 ms to minimize.
[2024-05-29 02:29:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 381 ms
TRAPS : Iteration 3
[2024-05-29 02:29:32] [INFO ] Deduced a trap composed of 10 places in 243 ms of which 4 ms to minimize.
[2024-05-29 02:29:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 387 ms
TRAPS : Iteration 4
[2024-05-29 02:29:36] [INFO ] Deduced a trap composed of 4 places in 386 ms of which 6 ms to minimize.
[2024-05-29 02:29:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 694 ms
TRAPS : Iteration 5
[2024-05-29 02:29:37] [INFO ] Deduced a trap composed of 8 places in 246 ms of which 4 ms to minimize.
[2024-05-29 02:29:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 389 ms
[2024-05-29 02:29:38] [INFO ] Deduced a trap composed of 5 places in 352 ms of which 6 ms to minimize.
[2024-05-29 02:29:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 506 ms
TRAPS : Iteration 6
[2024-05-29 02:29:39] [INFO ] Deduced a trap composed of 7 places in 231 ms of which 4 ms to minimize.
[2024-05-29 02:29:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 377 ms
[2024-05-29 02:29:41] [INFO ] Deduced a trap composed of 7 places in 228 ms of which 4 ms to minimize.
[2024-05-29 02:29:41] [INFO ] Deduced a trap composed of 8 places in 231 ms of which 4 ms to minimize.
[2024-05-29 02:29:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 681 ms
TRAPS : Iteration 7
[2024-05-29 02:29:43] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 4 ms to minimize.
[2024-05-29 02:29:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 380 ms
TRAPS : Iteration 8
[2024-05-29 02:29:46] [INFO ] Deduced a trap composed of 5 places in 393 ms of which 6 ms to minimize.
[2024-05-29 02:29:46] [INFO ] Deduced a trap composed of 6 places in 391 ms of which 6 ms to minimize.
[2024-05-29 02:29:47] [INFO ] Deduced a trap composed of 4 places in 394 ms of which 7 ms to minimize.
[2024-05-29 02:29:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1510 ms
TRAPS : Iteration 9
[2024-05-29 02:29:48] [INFO ] After 30189ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
[2024-05-29 02:29:49] [INFO ] After 33584ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
[2024-05-29 02:29:49] [INFO ] Flatten gal took : 91 ms
[2024-05-29 02:29:49] [INFO ] Flatten gal took : 80 ms
[2024-05-29 02:29:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15948399084610463631.gal : 23 ms
[2024-05-29 02:29:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5719314607015503509.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/ReachabilityCardinality15948399084610463631.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5719314607015503509.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality5719314607015503509.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :8 after 14
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :14 after 38
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :38 after 110
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :110 after 330
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :330 after 17820
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :17820 after 1.34719e+07
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :1.34719e+07 after 1.96007e+13
Detected timeout of ITS tools.
[2024-05-29 02:30:05] [INFO ] Flatten gal took : 69 ms
[2024-05-29 02:30:05] [INFO ] Applying decomposition
[2024-05-29 02:30:05] [INFO ] Flatten gal took : 69 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/graph10674943344222031313.txt' '-o' '/tmp/graph10674943344222031313.bin' '-w' '/tmp/graph10674943344222031313.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10674943344222031313.bin' '-l' '-1' '-v' '-w' '/tmp/graph10674943344222031313.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:30:05] [INFO ] Decomposing Gal with order
[2024-05-29 02:30:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:30:05] [INFO ] Removed a total of 1132 redundant transitions.
[2024-05-29 02:30:06] [INFO ] Flatten gal took : 175 ms
[2024-05-29 02:30:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 165 labels/synchronizations in 84 ms.
[2024-05-29 02:30:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16657395165629757113.gal : 31 ms
[2024-05-29 02:30:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2721268966309397849.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/ReachabilityCardinality16657395165629757113.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2721268966309397849.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/ReachabilityCardinality2721268966309397849.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :6 after 6
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :6 after 12
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :12 after 12
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :12 after 24
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :24 after 24
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :24 after 330
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 65846 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-29 02:30:21] [INFO ] Flatten gal took : 165 ms
[2024-05-29 02:30:21] [INFO ] Applying decomposition
[2024-05-29 02:30:21] [INFO ] Flatten gal took : 178 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4177465107363584977.txt' '-o' '/tmp/graph4177465107363584977.bin' '-w' '/tmp/graph4177465107363584977.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4177465107363584977.bin' '-l' '-1' '-v' '-w' '/tmp/graph4177465107363584977.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:30:22] [INFO ] Decomposing Gal with order
[2024-05-29 02:30:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:30:25] [INFO ] Removed a total of 600 redundant transitions.
[2024-05-29 02:30:25] [INFO ] Flatten gal took : 292 ms
[2024-05-29 02:30:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 25 ms.
[2024-05-29 02:30:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17208921857936510337.gal : 124 ms
[2024-05-29 02:30:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18169366708850833150.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/ReachabilityCardinality17208921857936510337.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18169366708850833150.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality18169366708850833150.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :1 after 9042
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :9042 after 5.03527e+24
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :5.03527e+24 after 3.37558e+56
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :3.37558e+56 after 4.18229e+294
ITS-tools command line returned an error code 137
[2024-05-29 02:39:19] [INFO ] Flatten gal took : 67 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5766864277791325342
[2024-05-29 02:39:19] [INFO ] Too many transitions (1963) to apply POR reductions. Disabling POR matrices.
[2024-05-29 02:39:19] [INFO ] Applying decomposition
[2024-05-29 02:39:19] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5766864277791325342
Running compilation step : cd /tmp/ltsmin5766864277791325342;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '80' '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 02:39:19] [INFO ] Flatten gal took : 70 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/graph5518179110506630571.txt' '-o' '/tmp/graph5518179110506630571.bin' '-w' '/tmp/graph5518179110506630571.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5518179110506630571.bin' '-l' '-1' '-v' '-w' '/tmp/graph5518179110506630571.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:39:20] [INFO ] Decomposing Gal with order
[2024-05-29 02:39:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:39:20] [INFO ] Removed a total of 1965 redundant transitions.
[2024-05-29 02:39:20] [INFO ] Flatten gal took : 96 ms
[2024-05-29 02:39:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 822 labels/synchronizations in 57 ms.
[2024-05-29 02:39:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15566833047453846416.gal : 33 ms
[2024-05-29 02:39:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7701461596538261955.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/ReachabilityCardinality15566833047453846416.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7701461596538261955.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/ReachabilityCardinality7701461596538261955.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :3 after 3
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :3 after 3
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :3 after 4
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :4 after 110
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :110 after 320760
Compilation finished in 5775 ms.
Running link step : cd /tmp/ltsmin5766864277791325342;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin5766864277791325342;'/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' 'ShieldIIPtPT100BReachabilityCardinality202403==true'
Reachability property ShieldIIPt-PT-100B-ReachabilityCardinality-2024-15 is true.
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldIIPt-PT-100B-ReachabilityCardinality-2024-13 is true.
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldIIPt-PT-100B-ReachabilityCardinality-2024-12 does not hold.
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldIIPt-PT-100B-ReachabilityCardinality-2024-11 is true.
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldIIPt-PT-100B-ReachabilityCardinality-2024-08 is true.
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldIIPt-PT-100B-ReachabilityCardinality-2024-06 does not hold.
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldIIPt-PT-100B-ReachabilityCardinality-2024-05 does not hold.
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldIIPt-PT-100B-ReachabilityCardinality-2024-03 does not hold.
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.75068e+19 after 9.42671e+183
WARNING : LTSmin timed out (>44 s) on command cd /tmp/ltsmin5766864277791325342;'/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' 'ShieldIIPtPT100BReachabilityCardinality202403==true'
Running LTSmin : cd /tmp/ltsmin5766864277791325342;'/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' 'ShieldIIPtPT100BReachabilityCardinality202407==true'
WARNING : LTSmin timed out (>44 s) on command cd /tmp/ltsmin5766864277791325342;'/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' 'ShieldIIPtPT100BReachabilityCardinality202407==true'
Retrying LTSmin with larger timeout 3200 s
Running LTSmin : cd /tmp/ltsmin5766864277791325342;'/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' 'ShieldIIPtPT100BReachabilityCardinality202407==true'
WARNING : LTSmin timed out (>355 s) on command cd /tmp/ltsmin5766864277791325342;'/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' 'ShieldIIPtPT100BReachabilityCardinality202407==true'
ITS-tools command line returned an error code 137
[2024-05-29 02:58:15] [INFO ] Applying decomposition
[2024-05-29 02:58:15] [INFO ] Flatten gal took : 80 ms
[2024-05-29 02:58:15] [INFO ] Decomposing Gal with order
[2024-05-29 02:58:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:58:16] [INFO ] Removed a total of 2119 redundant transitions.
[2024-05-29 02:58:16] [INFO ] Flatten gal took : 91 ms
[2024-05-29 02:58:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 1166 labels/synchronizations in 71 ms.
[2024-05-29 02:58:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9670892818712543279.gal : 23 ms
[2024-05-29 02:58:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16596104196010153491.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/ReachabilityCardinality9670892818712543279.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16596104196010153491.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/ReachabilityCardinality16596104196010153491.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 6
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :6 after 12
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :12 after 24
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :24 after 24
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :24 after 330
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :330 after 320760
Reachability property ShieldIIPt-PT-100B-ReachabilityCardinality-2024-07 is true.
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 513 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.23745e+175,29.0777,761668,6662,429,1.3757e+06,4807,2709,4.33386e+06,213,59567,0
Total reachable state count : 2.237445666762296216322734563341061176718e+175
Verifying 1 reachability properties.
Reachability property ShieldIIPt-PT-100B-ReachabilityCardinality-2024-07 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldIIPt-PT-100B-ReachabilityCardinality-2024-07,2.23532e+145,29.3291,761668,3926,367,1.3757e+06,4807,2712,4.33386e+06,216,59567,0
Total runtime 2128238 ms.
BK_STOP 1716951525698
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-100B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ShieldIIPt-PT-100B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r356-tall-171683760900350"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-100B.tgz
mv ShieldIIPt-PT-100B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;