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.r355-tall-171683758500319.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 greatspnxred
Input is ShieldIIPt-PT-040B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683758500319
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.8K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 20:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 184K Apr 12 20:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 20:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 20:33 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 686K 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-040B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716941603183

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-040B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 00:13:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 00:13:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 00:13:24] [INFO ] Load time of PNML (sax parser for PT used): 191 ms
[2024-05-29 00:13:24] [INFO ] Transformed 2803 places.
[2024-05-29 00:13:24] [INFO ] Transformed 2603 transitions.
[2024-05-29 00:13:24] [INFO ] Found NUPN structural information;
[2024-05-29 00:13:24] [INFO ] Parsed PT model containing 2803 places and 2603 transitions and 6486 arcs in 397 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 2293 ms. (17 steps per ms) remains 9/16 properties
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 402 ms. (99 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 294 ms. (135 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 264 ms. (150 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 9/9 properties
// Phase 1: matrix 2603 rows 2803 cols
[2024-05-29 00:13:26] [INFO ] Computed 361 invariants in 46 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 212/212 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1903/2115 variables, 247/459 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2115 variables, 1903/2362 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2115 variables, 0/2362 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 688/2803 variables, 114/2476 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2803 variables, 688/3164 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2803 variables, 0/3164 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 2603/5406 variables, 2803/5967 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5406 variables, 0/5967 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/5406 variables, 0/5967 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5406/5406 variables, and 5967 constraints, problems are : Problem set: 0 solved, 9 unsolved in 4227 ms.
Refiners :[Domain max(s): 2803/2803 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 2803/2803 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/212 variables, 212/212 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1903/2115 variables, 247/459 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2115 variables, 1903/2362 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 00:13:31] [INFO ] Deduced a trap composed of 19 places in 447 ms of which 62 ms to minimize.
[2024-05-29 00:13:32] [INFO ] Deduced a trap composed of 21 places in 355 ms of which 7 ms to minimize.
[2024-05-29 00:13:32] [INFO ] Deduced a trap composed of 33 places in 307 ms of which 6 ms to minimize.
[2024-05-29 00:13:32] [INFO ] Deduced a trap composed of 25 places in 294 ms of which 6 ms to minimize.
[2024-05-29 00:13:33] [INFO ] Deduced a trap composed of 26 places in 305 ms of which 6 ms to minimize.
[2024-05-29 00:13:33] [INFO ] Deduced a trap composed of 30 places in 298 ms of which 7 ms to minimize.
[2024-05-29 00:13:33] [INFO ] Deduced a trap composed of 20 places in 296 ms of which 6 ms to minimize.
[2024-05-29 00:13:34] [INFO ] Deduced a trap composed of 34 places in 299 ms of which 6 ms to minimize.
[2024-05-29 00:13:34] [INFO ] Deduced a trap composed of 36 places in 274 ms of which 6 ms to minimize.
[2024-05-29 00:13:34] [INFO ] Deduced a trap composed of 34 places in 280 ms of which 5 ms to minimize.
[2024-05-29 00:13:35] [INFO ] Deduced a trap composed of 50 places in 254 ms of which 5 ms to minimize.
[2024-05-29 00:13:35] [INFO ] Deduced a trap composed of 43 places in 261 ms of which 5 ms to minimize.
[2024-05-29 00:13:35] [INFO ] Deduced a trap composed of 25 places in 243 ms of which 5 ms to minimize.
[2024-05-29 00:13:36] [INFO ] Deduced a trap composed of 25 places in 248 ms of which 5 ms to minimize.
SMT process timed out in 9593ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 212 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 2603/2603 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 513 transitions
Trivial Post-agglo rules discarded 513 transitions
Performed 513 trivial Post agglomeration. Transition count delta: 513
Iterating post reduction 0 with 513 rules applied. Total rules applied 513 place count 2803 transition count 2090
Reduce places removed 513 places and 0 transitions.
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Iterating post reduction 1 with 578 rules applied. Total rules applied 1091 place count 2290 transition count 2025
Reduce places removed 65 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 66 rules applied. Total rules applied 1157 place count 2225 transition count 2024
Performed 166 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 166 Pre rules applied. Total rules applied 1157 place count 2225 transition count 1858
Deduced a syphon composed of 166 places in 5 ms
Reduce places removed 166 places and 0 transitions.
Iterating global reduction 3 with 332 rules applied. Total rules applied 1489 place count 2059 transition count 1858
Discarding 241 places :
Symmetric choice reduction at 3 with 241 rule applications. Total rules 1730 place count 1818 transition count 1617
Iterating global reduction 3 with 241 rules applied. Total rules applied 1971 place count 1818 transition count 1617
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 70 Pre rules applied. Total rules applied 1971 place count 1818 transition count 1547
Deduced a syphon composed of 70 places in 10 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 2111 place count 1748 transition count 1547
Performed 600 Post agglomeration using F-continuation condition.Transition count delta: 600
Deduced a syphon composed of 600 places in 3 ms
Reduce places removed 600 places and 0 transitions.
Iterating global reduction 3 with 1200 rules applied. Total rules applied 3311 place count 1148 transition count 947
Renaming transitions due to excessive name length > 1024 char.
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 77 places in 4 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 3465 place count 1071 transition count 973
Free-agglomeration rule applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 3474 place count 1071 transition count 964
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 3483 place count 1062 transition count 964
Partial Free-agglomeration rule applied 37 times.
Drop transitions (Partial Free agglomeration) removed 37 transitions
Iterating global reduction 4 with 37 rules applied. Total rules applied 3520 place count 1062 transition count 964
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 3521 place count 1062 transition count 964
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3522 place count 1061 transition count 963
Applied a total of 3522 rules in 905 ms. Remains 1061 /2803 variables (removed 1742) and now considering 963/2603 (removed 1640) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 915 ms. Remains : 1061/2803 places, 963/2603 transitions.
RANDOM walk for 40000 steps (8 resets) in 761 ms. (52 steps per ms) remains 7/9 properties
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 318 ms. (125 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 302 ms. (132 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 253 ms. (157 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 291 ms. (137 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 537 ms. (74 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 342 ms. (116 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 344 ms. (115 steps per ms) remains 7/7 properties
// Phase 1: matrix 963 rows 1061 cols
[2024-05-29 00:13:38] [INFO ] Computed 361 invariants in 5 ms
[2024-05-29 00:13:38] [INFO ] State equation strengthened by 106 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 611/821 variables, 247/247 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/821 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 86/907 variables, 40/287 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/907 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 906/1813 variables, 907/1194 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1813 variables, 102/1296 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1813 variables, 0/1296 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 181/1994 variables, 133/1429 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1994 variables, 62/1491 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1994 variables, 4/1495 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1994 variables, 0/1495 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 2/1996 variables, 3/1498 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1996 variables, 2/1500 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1996 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 2/1998 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1998 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 25/2023 variables, 18/1519 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2023 variables, 6/1525 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2023 variables, 0/1525 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 1/2024 variables, 2/1527 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2024 variables, 1/1528 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2024 variables, 0/1528 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 0/2024 variables, 0/1528 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2024/2024 variables, and 1528 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3186 ms.
Refiners :[Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 1061/1061 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 611/821 variables, 247/247 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 00:13:41] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 2 ms to minimize.
[2024-05-29 00:13:41] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 2 ms to minimize.
[2024-05-29 00:13:41] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 2 ms to minimize.
[2024-05-29 00:13:41] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 3 ms to minimize.
[2024-05-29 00:13:42] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 2 ms to minimize.
[2024-05-29 00:13:42] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 2 ms to minimize.
[2024-05-29 00:13:42] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 2 ms to minimize.
[2024-05-29 00:13:42] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 2 ms to minimize.
[2024-05-29 00:13:42] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 2 ms to minimize.
[2024-05-29 00:13:42] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 1 ms to minimize.
[2024-05-29 00:13:42] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 1 ms to minimize.
[2024-05-29 00:13:42] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 4 ms to minimize.
[2024-05-29 00:13:42] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 2 ms to minimize.
[2024-05-29 00:13:42] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 2 ms to minimize.
[2024-05-29 00:13:43] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 2 ms to minimize.
[2024-05-29 00:13:43] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
[2024-05-29 00:13:43] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-29 00:13:43] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 2 ms to minimize.
[2024-05-29 00:13:43] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 2 ms to minimize.
[2024-05-29 00:13:43] [INFO ] Deduced a trap composed of 8 places in 173 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/821 variables, 20/267 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 00:13:43] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-05-29 00:13:43] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 2 ms to minimize.
[2024-05-29 00:13:43] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 2 ms to minimize.
[2024-05-29 00:13:44] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
[2024-05-29 00:13:44] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 1 ms to minimize.
[2024-05-29 00:13:44] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 4 ms to minimize.
[2024-05-29 00:13:44] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
[2024-05-29 00:13:44] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 2 ms to minimize.
[2024-05-29 00:13:44] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 14 ms to minimize.
[2024-05-29 00:13:44] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 2 ms to minimize.
[2024-05-29 00:13:44] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2024-05-29 00:13:44] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-05-29 00:13:44] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-05-29 00:13:44] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-29 00:13:45] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-29 00:13:45] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-29 00:13:45] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 2 ms to minimize.
[2024-05-29 00:13:45] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 2 ms to minimize.
[2024-05-29 00:13:45] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-05-29 00:13:45] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/821 variables, 20/287 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 00:13:45] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/821 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 00:13:45] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 9 ms to minimize.
[2024-05-29 00:13:45] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 2 ms to minimize.
[2024-05-29 00:13:45] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-05-29 00:13:46] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/821 variables, 4/292 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 00:13:46] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-29 00:13:46] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/821 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 00:13:46] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 2 ms to minimize.
[2024-05-29 00:13:46] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 2 ms to minimize.
[2024-05-29 00:13:46] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 2 ms to minimize.
[2024-05-29 00:13:46] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-05-29 00:13:46] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 2 ms to minimize.
[2024-05-29 00:13:46] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2024-05-29 00:13:47] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-29 00:13:47] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-29 00:13:47] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/821 variables, 9/303 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 00:13:47] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2024-05-29 00:13:47] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/821 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 00:13:47] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/821 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 00:13:47] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/821 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/821 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 86/907 variables, 40/347 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 00:13:48] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2024-05-29 00:13:48] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-29 00:13:48] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 2 ms to minimize.
[2024-05-29 00:13:48] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-05-29 00:13:48] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 2 ms to minimize.
[2024-05-29 00:13:48] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/907 variables, 6/353 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/907 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 906/1813 variables, 907/1260 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1813 variables, 102/1362 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1813 variables, 1/1363 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 00:13:49] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 2 ms to minimize.
[2024-05-29 00:13:49] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 3 ms to minimize.
[2024-05-29 00:13:49] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 3 ms to minimize.
[2024-05-29 00:13:49] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 2 ms to minimize.
[2024-05-29 00:13:50] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 3 ms to minimize.
[2024-05-29 00:13:50] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 2 ms to minimize.
[2024-05-29 00:13:50] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1813 variables, 7/1370 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1813 variables, 0/1370 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 181/1994 variables, 133/1503 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1994 variables, 62/1565 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1994 variables, 4/1569 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1994 variables, 6/1575 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 00:13:52] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 3 ms to minimize.
[2024-05-29 00:13:53] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 2 ms to minimize.
[2024-05-29 00:13:53] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 2 ms to minimize.
[2024-05-29 00:13:53] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1994 variables, 4/1579 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1994 variables, 0/1579 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (OVERLAPS) 2/1996 variables, 3/1582 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1996 variables, 2/1584 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 00:13:54] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 2 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/1996 variables, 1/1585 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1996 variables, 0/1585 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (OVERLAPS) 2/1998 variables, 1/1586 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1998 variables, 0/1586 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (OVERLAPS) 25/2023 variables, 18/1604 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2023 variables, 6/1610 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2023 variables, 0/1610 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (OVERLAPS) 1/2024 variables, 2/1612 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2024 variables, 1/1613 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2024 variables, 0/1613 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 38 (OVERLAPS) 0/2024 variables, 0/1613 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2024/2024 variables, and 1613 constraints, problems are : Problem set: 0 solved, 7 unsolved in 18576 ms.
Refiners :[Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 1061/1061 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 78/78 constraints]
After SMT, in 21842ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 9942 ms.
Support contains 210 out of 1061 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1061/1061 places, 963/963 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1061 transition count 962
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1060 transition count 962
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 1060 transition count 960
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 1058 transition count 960
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 1057 transition count 959
Applied a total of 8 rules in 57 ms. Remains 1057 /1061 variables (removed 4) and now considering 959/963 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 1057/1061 places, 959/963 transitions.
RANDOM walk for 40000 steps (8 resets) in 614 ms. (65 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 248 ms. (160 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 311 ms. (128 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 210 ms. (189 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 116803 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 7
Probabilistic random walk after 116803 steps, saw 77913 distinct states, run finished after 3006 ms. (steps per millisecond=38 ) properties seen :0
// Phase 1: matrix 959 rows 1057 cols
[2024-05-29 00:14:13] [INFO ] Computed 361 invariants in 4 ms
[2024-05-29 00:14:13] [INFO ] State equation strengthened by 107 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 607/817 variables, 247/247 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/817 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 86/903 variables, 40/287 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/903 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 902/1805 variables, 903/1190 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1805 variables, 103/1293 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1805 variables, 0/1293 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 181/1986 variables, 133/1426 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1986 variables, 62/1488 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1986 variables, 4/1492 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1986 variables, 0/1492 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 2/1988 variables, 3/1495 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1988 variables, 2/1497 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1988 variables, 0/1497 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 2/1990 variables, 1/1498 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1990 variables, 0/1498 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 25/2015 variables, 18/1516 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2015 variables, 6/1522 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2015 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 1/2016 variables, 2/1524 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2016 variables, 1/1525 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2016 variables, 0/1525 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 0/2016 variables, 0/1525 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2016/2016 variables, and 1525 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3054 ms.
Refiners :[Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 1057/1057 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 607/817 variables, 247/247 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 00:14:17] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 2 ms to minimize.
[2024-05-29 00:14:17] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 2 ms to minimize.
[2024-05-29 00:14:17] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 2 ms to minimize.
[2024-05-29 00:14:17] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 2 ms to minimize.
[2024-05-29 00:14:17] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-05-29 00:14:17] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 1 ms to minimize.
[2024-05-29 00:14:17] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 2 ms to minimize.
[2024-05-29 00:14:17] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 2 ms to minimize.
[2024-05-29 00:14:17] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 2 ms to minimize.
[2024-05-29 00:14:17] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 2 ms to minimize.
[2024-05-29 00:14:18] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 8 ms to minimize.
[2024-05-29 00:14:18] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 2 ms to minimize.
[2024-05-29 00:14:18] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 2 ms to minimize.
[2024-05-29 00:14:18] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 2 ms to minimize.
[2024-05-29 00:14:18] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 2 ms to minimize.
[2024-05-29 00:14:18] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 2 ms to minimize.
[2024-05-29 00:14:18] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 2 ms to minimize.
[2024-05-29 00:14:18] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 2 ms to minimize.
[2024-05-29 00:14:18] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
[2024-05-29 00:14:18] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/817 variables, 20/267 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 00:14:19] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 3 ms to minimize.
[2024-05-29 00:14:19] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 3 ms to minimize.
[2024-05-29 00:14:19] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 3 ms to minimize.
[2024-05-29 00:14:19] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
[2024-05-29 00:14:19] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
[2024-05-29 00:14:19] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-29 00:14:19] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 2 ms to minimize.
[2024-05-29 00:14:19] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 2 ms to minimize.
[2024-05-29 00:14:19] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-29 00:14:20] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-05-29 00:14:20] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 2 ms to minimize.
[2024-05-29 00:14:20] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 2 ms to minimize.
[2024-05-29 00:14:20] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-29 00:14:20] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-29 00:14:20] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-29 00:14:20] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-29 00:14:20] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 2 ms to minimize.
[2024-05-29 00:14:20] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-29 00:14:20] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-29 00:14:20] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/817 variables, 20/287 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 00:14:20] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 2 ms to minimize.
[2024-05-29 00:14:21] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2024-05-29 00:14:21] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 2 ms to minimize.
[2024-05-29 00:14:21] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 2 ms to minimize.
[2024-05-29 00:14:21] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 2 ms to minimize.
[2024-05-29 00:14:21] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2024-05-29 00:14:21] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 2 ms to minimize.
[2024-05-29 00:14:21] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 2 ms to minimize.
[2024-05-29 00:14:21] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 2 ms to minimize.
[2024-05-29 00:14:21] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 2 ms to minimize.
[2024-05-29 00:14:21] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 2 ms to minimize.
[2024-05-29 00:14:21] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-29 00:14:22] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 2 ms to minimize.
[2024-05-29 00:14:22] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-29 00:14:22] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/817 variables, 15/302 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 00:14:22] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-29 00:14:22] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 2 ms to minimize.
[2024-05-29 00:14:22] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/817 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/817 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 86/903 variables, 40/345 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 00:14:22] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2024-05-29 00:14:22] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-05-29 00:14:23] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 2 ms to minimize.
[2024-05-29 00:14:23] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-29 00:14:23] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-29 00:14:23] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-05-29 00:14:23] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-05-29 00:14:23] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-29 00:14:23] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
[2024-05-29 00:14:23] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2024-05-29 00:14:23] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-29 00:14:23] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/903 variables, 12/357 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/903 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 902/1805 variables, 903/1260 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1805 variables, 103/1363 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1805 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 00:14:24] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1805 variables, 1/1365 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 00:14:24] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 2 ms to minimize.
[2024-05-29 00:14:25] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 2 ms to minimize.
[2024-05-29 00:14:25] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1805 variables, 3/1368 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 00:14:25] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 2 ms to minimize.
[2024-05-29 00:14:25] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1805 variables, 2/1370 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 00:14:26] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1805 variables, 1/1371 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1805 variables, 0/1371 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 181/1986 variables, 133/1504 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1986 variables, 62/1566 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1986 variables, 4/1570 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1986 variables, 6/1576 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 00:14:28] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 3 ms to minimize.
[2024-05-29 00:14:29] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 3 ms to minimize.
[2024-05-29 00:14:29] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1986 variables, 3/1579 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 00:14:30] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1986 variables, 1/1580 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1986 variables, 0/1580 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (OVERLAPS) 2/1988 variables, 3/1583 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1988 variables, 2/1585 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1988 variables, 0/1585 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (OVERLAPS) 2/1990 variables, 1/1586 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1990 variables, 0/1586 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (OVERLAPS) 25/2015 variables, 18/1604 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2015 variables, 6/1610 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 00:14:33] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 2 ms to minimize.
[2024-05-29 00:14:34] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 2 ms to minimize.
[2024-05-29 00:14:34] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 2 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/2015 variables, 3/1613 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2015 variables, 0/1613 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 34 (OVERLAPS) 1/2016 variables, 2/1615 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2016 variables, 1/1616 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2016 variables, 0/1616 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 37 (OVERLAPS) 0/2016 variables, 0/1616 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2016/2016 variables, and 1616 constraints, problems are : Problem set: 0 solved, 7 unsolved in 20993 ms.
Refiners :[Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 1057/1057 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 84/84 constraints]
After SMT, in 24088ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 8896 ms.
Support contains 210 out of 1057 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 959/959 transitions.
Applied a total of 0 rules in 28 ms. Remains 1057 /1057 variables (removed 0) and now considering 959/959 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 1057/1057 places, 959/959 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 959/959 transitions.
Applied a total of 0 rules in 22 ms. Remains 1057 /1057 variables (removed 0) and now considering 959/959 (removed 0) transitions.
[2024-05-29 00:14:46] [INFO ] Invariant cache hit.
[2024-05-29 00:14:47] [INFO ] Implicit Places using invariants in 463 ms returned []
[2024-05-29 00:14:47] [INFO ] Invariant cache hit.
[2024-05-29 00:14:47] [INFO ] State equation strengthened by 107 read => feed constraints.
[2024-05-29 00:14:48] [INFO ] Implicit Places using invariants and state equation in 1809 ms returned []
Implicit Place search using SMT with State Equation took 2282 ms to find 0 implicit places.
[2024-05-29 00:14:49] [INFO ] Redundant transitions in 63 ms returned []
Running 924 sub problems to find dead transitions.
[2024-05-29 00:14:49] [INFO ] Invariant cache hit.
[2024-05-29 00:14:49] [INFO ] State equation strengthened by 107 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1022 variables, 113/113 constraints. Problems are: Problem set: 0 solved, 924 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1022 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 924 unsolved
At refinement iteration 2 (OVERLAPS) 35/1057 variables, 248/361 constraints. Problems are: Problem set: 0 solved, 924 unsolved
[2024-05-29 00:15:17] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-29 00:15:17] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-29 00:15:17] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-29 00:15:17] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-29 00:15:18] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-29 00:15:18] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 00:15:18] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-05-29 00:15:18] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2024-05-29 00:15:18] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2024-05-29 00:15:18] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-05-29 00:15:18] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1057/2016 variables, and 372 constraints, problems are : Problem set: 0 solved, 924 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1057 constraints, ReadFeed: 0/107 constraints, PredecessorRefiner: 924/924 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 924 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1022 variables, 113/113 constraints. Problems are: Problem set: 0 solved, 924 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1022 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 924 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1022 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 924 unsolved
At refinement iteration 3 (OVERLAPS) 35/1057 variables, 248/365 constraints. Problems are: Problem set: 0 solved, 924 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1057 variables, 7/372 constraints. Problems are: Problem set: 0 solved, 924 unsolved
[2024-05-29 00:15:35] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-05-29 00:15:36] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-29 00:15:36] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-29 00:15:36] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-29 00:15:36] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-29 00:15:36] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-29 00:15:36] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-29 00:15:36] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 00:15:36] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-29 00:15:37] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-29 00:15:37] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-29 00:15:37] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-29 00:15:37] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-29 00:15:37] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-29 00:15:37] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-29 00:15:37] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-29 00:15:37] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-29 00:15:37] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2024-05-29 00:15:37] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-29 00:15:37] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1057 variables, 20/392 constraints. Problems are: Problem set: 0 solved, 924 unsolved
[2024-05-29 00:15:38] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-29 00:15:40] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-29 00:15:40] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-29 00:15:40] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-05-29 00:15:40] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2024-05-29 00:15:40] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-29 00:15:40] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-05-29 00:15:40] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2024-05-29 00:15:40] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-29 00:15:40] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-05-29 00:15:41] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-29 00:15:41] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-29 00:15:41] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-29 00:15:42] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-29 00:15:43] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-05-29 00:15:43] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
[2024-05-29 00:15:43] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-05-29 00:15:43] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-29 00:15:43] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-29 00:15:43] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1057 variables, 20/412 constraints. Problems are: Problem set: 0 solved, 924 unsolved
[2024-05-29 00:15:47] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-05-29 00:15:48] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-05-29 00:15:48] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-05-29 00:15:48] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2024-05-29 00:15:48] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 2 ms to minimize.
[2024-05-29 00:15:48] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-29 00:15:48] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 2 ms to minimize.
[2024-05-29 00:15:48] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2024-05-29 00:15:49] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 2 ms to minimize.
[2024-05-29 00:15:49] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1057/2016 variables, and 422 constraints, problems are : Problem set: 0 solved, 924 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1057 constraints, ReadFeed: 0/107 constraints, PredecessorRefiner: 0/924 constraints, Known Traps: 61/61 constraints]
After SMT, in 60287ms problems are : Problem set: 0 solved, 924 unsolved
Search for dead transitions found 0 dead transitions in 60298ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62682 ms. Remains : 1057/1057 places, 959/959 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 71 times.
Drop transitions (Partial Free agglomeration) removed 71 transitions
Iterating global reduction 0 with 71 rules applied. Total rules applied 71 place count 1057 transition count 959
Applied a total of 71 rules in 41 ms. Remains 1057 /1057 variables (removed 0) and now considering 959/959 (removed 0) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 959 rows 1057 cols
[2024-05-29 00:15:49] [INFO ] Computed 361 invariants in 6 ms
[2024-05-29 00:15:49] [INFO ] After 242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 00:15:49] [INFO ] [Nat]Absence check using 361 positive place invariants in 55 ms returned sat
[2024-05-29 00:15:51] [INFO ] After 972ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 00:15:51] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-29 00:15:51] [INFO ] After 811ms SMT Verify possible using 62 Read/Feed constraints in natural domain returned unsat :0 sat :7
TRAPS : Iteration 0
[2024-05-29 00:15:52] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 4 ms to minimize.
[2024-05-29 00:15:52] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 4 ms to minimize.
[2024-05-29 00:15:52] [INFO ] Deduced a trap composed of 5 places in 166 ms of which 3 ms to minimize.
[2024-05-29 00:15:52] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 3 ms to minimize.
[2024-05-29 00:15:52] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 3 ms to minimize.
[2024-05-29 00:15:53] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 3 ms to minimize.
[2024-05-29 00:15:53] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 3 ms to minimize.
[2024-05-29 00:15:53] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 3 ms to minimize.
[2024-05-29 00:15:53] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 3 ms to minimize.
[2024-05-29 00:15:53] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 3 ms to minimize.
[2024-05-29 00:15:54] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 3 ms to minimize.
[2024-05-29 00:15:54] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 3 ms to minimize.
[2024-05-29 00:15:54] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 3 ms to minimize.
[2024-05-29 00:15:54] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 3 ms to minimize.
[2024-05-29 00:15:54] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 3 ms to minimize.
[2024-05-29 00:15:54] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 3 ms to minimize.
[2024-05-29 00:15:55] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 3 ms to minimize.
[2024-05-29 00:15:55] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 3 ms to minimize.
[2024-05-29 00:15:55] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3405 ms
[2024-05-29 00:15:55] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 2 ms to minimize.
[2024-05-29 00:15:55] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 3 ms to minimize.
[2024-05-29 00:15:55] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 2 ms to minimize.
[2024-05-29 00:15:55] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 2 ms to minimize.
[2024-05-29 00:15:56] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 2 ms to minimize.
[2024-05-29 00:15:56] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 4 ms to minimize.
[2024-05-29 00:15:56] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 890 ms
[2024-05-29 00:15:56] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 2 ms to minimize.
[2024-05-29 00:15:56] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 2 ms to minimize.
[2024-05-29 00:15:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 311 ms
[2024-05-29 00:15:57] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 3 ms to minimize.
[2024-05-29 00:15:57] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 3 ms to minimize.
[2024-05-29 00:15:57] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 2 ms to minimize.
[2024-05-29 00:15:57] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 2 ms to minimize.
[2024-05-29 00:15:57] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 2 ms to minimize.
[2024-05-29 00:15:57] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 2 ms to minimize.
[2024-05-29 00:15:57] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 2 ms to minimize.
[2024-05-29 00:15:58] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1141 ms
[2024-05-29 00:15:58] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 2 ms to minimize.
[2024-05-29 00:15:58] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 3 ms to minimize.
[2024-05-29 00:15:58] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 3 ms to minimize.
[2024-05-29 00:15:58] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 3 ms to minimize.
[2024-05-29 00:15:58] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 2 ms to minimize.
[2024-05-29 00:15:59] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 3 ms to minimize.
[2024-05-29 00:15:59] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 3 ms to minimize.
[2024-05-29 00:15:59] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 3 ms to minimize.
[2024-05-29 00:15:59] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 2 ms to minimize.
[2024-05-29 00:15:59] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 3 ms to minimize.
[2024-05-29 00:15:59] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 3 ms to minimize.
[2024-05-29 00:16:00] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 2 ms to minimize.
[2024-05-29 00:16:00] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 3 ms to minimize.
[2024-05-29 00:16:00] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2183 ms
[2024-05-29 00:16:00] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 3 ms to minimize.
[2024-05-29 00:16:00] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 3 ms to minimize.
[2024-05-29 00:16:00] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 2 ms to minimize.
[2024-05-29 00:16:01] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 3 ms to minimize.
[2024-05-29 00:16:01] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 2 ms to minimize.
[2024-05-29 00:16:01] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 3 ms to minimize.
[2024-05-29 00:16:01] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 3 ms to minimize.
[2024-05-29 00:16:01] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1183 ms
TRAPS : Iteration 1
[2024-05-29 00:16:01] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 3 ms to minimize.
[2024-05-29 00:16:01] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 3 ms to minimize.
[2024-05-29 00:16:02] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 3 ms to minimize.
[2024-05-29 00:16:02] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 2 ms to minimize.
[2024-05-29 00:16:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 772 ms
[2024-05-29 00:16:02] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 3 ms to minimize.
[2024-05-29 00:16:02] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 3 ms to minimize.
[2024-05-29 00:16:02] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 2 ms to minimize.
[2024-05-29 00:16:03] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 3 ms to minimize.
[2024-05-29 00:16:03] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 3 ms to minimize.
[2024-05-29 00:16:03] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 2 ms to minimize.
[2024-05-29 00:16:03] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 3 ms to minimize.
[2024-05-29 00:16:03] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 3 ms to minimize.
[2024-05-29 00:16:03] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 2 ms to minimize.
[2024-05-29 00:16:04] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 2 ms to minimize.
[2024-05-29 00:16:04] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1593 ms
[2024-05-29 00:16:04] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 3 ms to minimize.
[2024-05-29 00:16:04] [INFO ] Deduced a trap composed of 5 places in 218 ms of which 4 ms to minimize.
[2024-05-29 00:16:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 507 ms
[2024-05-29 00:16:05] [INFO ] Deduced a trap composed of 10 places in 260 ms of which 8 ms to minimize.
[2024-05-29 00:16:05] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 3 ms to minimize.
[2024-05-29 00:16:05] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 3 ms to minimize.
[2024-05-29 00:16:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 762 ms
[2024-05-29 00:16:06] [INFO ] Deduced a trap composed of 9 places in 223 ms of which 5 ms to minimize.
[2024-05-29 00:16:06] [INFO ] Deduced a trap composed of 10 places in 211 ms of which 4 ms to minimize.
[2024-05-29 00:16:06] [INFO ] Deduced a trap composed of 8 places in 217 ms of which 5 ms to minimize.
[2024-05-29 00:16:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 821 ms
[2024-05-29 00:16:07] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 3 ms to minimize.
[2024-05-29 00:16:07] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 3 ms to minimize.
[2024-05-29 00:16:07] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 2 ms to minimize.
[2024-05-29 00:16:07] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 2 ms to minimize.
[2024-05-29 00:16:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 700 ms
TRAPS : Iteration 2
[2024-05-29 00:16:07] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 3 ms to minimize.
[2024-05-29 00:16:08] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 3 ms to minimize.
[2024-05-29 00:16:08] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 3 ms to minimize.
[2024-05-29 00:16:08] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 3 ms to minimize.
[2024-05-29 00:16:08] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 3 ms to minimize.
[2024-05-29 00:16:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 884 ms
[2024-05-29 00:16:08] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 3 ms to minimize.
[2024-05-29 00:16:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2024-05-29 00:16:09] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 2 ms to minimize.
[2024-05-29 00:16:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2024-05-29 00:16:09] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 2 ms to minimize.
[2024-05-29 00:16:09] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 3 ms to minimize.
[2024-05-29 00:16:10] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 3 ms to minimize.
[2024-05-29 00:16:10] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 2 ms to minimize.
[2024-05-29 00:16:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 705 ms
[2024-05-29 00:16:10] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 2 ms to minimize.
[2024-05-29 00:16:10] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 3 ms to minimize.
[2024-05-29 00:16:10] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 2 ms to minimize.
[2024-05-29 00:16:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 544 ms
TRAPS : Iteration 3
[2024-05-29 00:16:11] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 3 ms to minimize.
[2024-05-29 00:16:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 247 ms
[2024-05-29 00:16:11] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 3 ms to minimize.
[2024-05-29 00:16:12] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 3 ms to minimize.
[2024-05-29 00:16:12] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 2 ms to minimize.
[2024-05-29 00:16:12] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 2 ms to minimize.
[2024-05-29 00:16:12] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 2 ms to minimize.
[2024-05-29 00:16:12] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 904 ms
[2024-05-29 00:16:13] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 2 ms to minimize.
[2024-05-29 00:16:13] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 2 ms to minimize.
[2024-05-29 00:16:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 349 ms
TRAPS : Iteration 4
[2024-05-29 00:16:13] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 2 ms to minimize.
[2024-05-29 00:16:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2024-05-29 00:16:13] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 3 ms to minimize.
[2024-05-29 00:16:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2024-05-29 00:16:14] [INFO ] Deduced a trap composed of 6 places in 201 ms of which 5 ms to minimize.
[2024-05-29 00:16:15] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 4 ms to minimize.
[2024-05-29 00:16:15] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 4 ms to minimize.
[2024-05-29 00:16:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 771 ms
[2024-05-29 00:16:15] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 3 ms to minimize.
[2024-05-29 00:16:15] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 3 ms to minimize.
[2024-05-29 00:16:16] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 3 ms to minimize.
[2024-05-29 00:16:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 593 ms
TRAPS : Iteration 5
[2024-05-29 00:16:16] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 3 ms to minimize.
[2024-05-29 00:16:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2024-05-29 00:16:16] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 2 ms to minimize.
[2024-05-29 00:16:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2024-05-29 00:16:17] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 3 ms to minimize.
[2024-05-29 00:16:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2024-05-29 00:16:17] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 3 ms to minimize.
[2024-05-29 00:16:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
TRAPS : Iteration 6
[2024-05-29 00:16:18] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 2 ms to minimize.
[2024-05-29 00:16:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2024-05-29 00:16:18] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 2 ms to minimize.
[2024-05-29 00:16:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2024-05-29 00:16:19] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 3 ms to minimize.
[2024-05-29 00:16:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2024-05-29 00:16:19] [INFO ] Deduced a trap composed of 5 places in 167 ms of which 4 ms to minimize.
[2024-05-29 00:16:19] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 4 ms to minimize.
[2024-05-29 00:16:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 446 ms
TRAPS : Iteration 7
[2024-05-29 00:16:21] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 3 ms to minimize.
[2024-05-29 00:16:21] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 3 ms to minimize.
[2024-05-29 00:16:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 365 ms
TRAPS : Iteration 8
[2024-05-29 00:16:22] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 3 ms to minimize.
[2024-05-29 00:16:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2024-05-29 00:16:22] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 3 ms to minimize.
[2024-05-29 00:16:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
TRAPS : Iteration 9
[2024-05-29 00:16:23] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 3 ms to minimize.
[2024-05-29 00:16:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2024-05-29 00:16:23] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 2 ms to minimize.
[2024-05-29 00:16:24] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 2 ms to minimize.
[2024-05-29 00:16:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 369 ms
[2024-05-29 00:16:24] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 3 ms to minimize.
[2024-05-29 00:16:24] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 3 ms to minimize.
[2024-05-29 00:16:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 505 ms
TRAPS : Iteration 10
[2024-05-29 00:16:25] [INFO ] Deduced a trap composed of 5 places in 218 ms of which 5 ms to minimize.
[2024-05-29 00:16:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 297 ms
[2024-05-29 00:16:26] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 3 ms to minimize.
[2024-05-29 00:16:26] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 3 ms to minimize.
[2024-05-29 00:16:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 386 ms
TRAPS : Iteration 11
[2024-05-29 00:16:28] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 2 ms to minimize.
[2024-05-29 00:16:28] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 2 ms to minimize.
[2024-05-29 00:16:28] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 2 ms to minimize.
[2024-05-29 00:16:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 540 ms
TRAPS : Iteration 12
[2024-05-29 00:16:30] [INFO ] After 39080ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
[2024-05-29 00:16:31] [INFO ] After 41408ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Over-approximation ignoring read arcs solved 0 properties in 41758 ms.
[2024-05-29 00:16:31] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-05-29 00:16:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1057 places, 959 transitions and 3785 arcs took 12 ms.
[2024-05-29 00:16:31] [INFO ] Flatten gal took : 109 ms
Total runtime 187012 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldIIPt-PT-040B

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1057
TRANSITIONS: 959
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.028s, Sys 0.002s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.003s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1706
MODEL NAME: /home/mcc/execution/413/model
1057 places, 959 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-2024-01 CANNOT_COMPUTE
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-2024-02 CANNOT_COMPUTE
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-2024-03 CANNOT_COMPUTE
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-2024-06 CANNOT_COMPUTE
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-2024-10 CANNOT_COMPUTE
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-2024-14 CANNOT_COMPUTE
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-2024-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716944293552

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-040B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is ShieldIIPt-PT-040B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r355-tall-171683758500319"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-040B.tgz
mv ShieldIIPt-PT-040B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;