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.r476-tall-171620505000023.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is CANConstruction-PT-020, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505000023
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 19:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 12 19:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 19:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 12 19:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 641K May 18 16:42 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 CANConstruction-PT-020-ReachabilityFireability-2024-00
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-2024-01
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-2024-02
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-2024-03
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-2024-04
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-2024-05
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-2024-06
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-2024-07
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-2024-08
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-2024-09
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-2024-10
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-2024-11
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-2024-12
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-2024-13
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-2024-14
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717178224220

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-020
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 17:57:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 17:57:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 17:57:05] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2024-05-31 17:57:05] [INFO ] Transformed 1042 places.
[2024-05-31 17:57:05] [INFO ] Transformed 1760 transitions.
[2024-05-31 17:57:05] [INFO ] Parsed PT model containing 1042 places and 1760 transitions and 5200 arcs in 247 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (113 resets) in 1456 ms. (27 steps per ms) remains 6/16 properties
FORMULA CANConstruction-PT-020-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 301 ms. (132 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 5/6 properties
FORMULA CANConstruction-PT-020-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 409 ms. (97 steps per ms) remains 4/5 properties
FORMULA CANConstruction-PT-020-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 86 ms. (459 steps per ms) remains 4/4 properties
// Phase 1: matrix 1760 rows 1042 cols
[2024-05-31 17:57:06] [INFO ] Computed 41 invariants in 38 ms
[2024-05-31 17:57:06] [INFO ] State equation strengthened by 780 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem CANConstruction-PT-020-ReachabilityFireability-2024-00 is UNSAT
FORMULA CANConstruction-PT-020-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-020-ReachabilityFireability-2024-02 is UNSAT
FORMULA CANConstruction-PT-020-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 928/1025 variables, 20/20 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1025 variables, 4/24 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1025 variables, 0/24 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/1026 variables, 1/25 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 0/25 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 16/1042 variables, 16/41 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1042 variables, 0/41 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1760/2802 variables, 1042/1083 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2802 variables, 780/1863 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2802 variables, 0/1863 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2802 variables, 0/1863 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2802/2802 variables, and 1863 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1343 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 1042/1042 constraints, ReadFeed: 780/780 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 949/1024 variables, 20/20 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 3/23 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-31 17:57:08] [INFO ] Deduced a trap composed of 5 places in 390 ms of which 46 ms to minimize.
[2024-05-31 17:57:09] [INFO ] Deduced a trap composed of 45 places in 284 ms of which 4 ms to minimize.
[2024-05-31 17:57:09] [INFO ] Deduced a trap composed of 45 places in 223 ms of which 9 ms to minimize.
[2024-05-31 17:57:09] [INFO ] Deduced a trap composed of 44 places in 152 ms of which 6 ms to minimize.
[2024-05-31 17:57:09] [INFO ] Deduced a trap composed of 47 places in 170 ms of which 3 ms to minimize.
[2024-05-31 17:57:09] [INFO ] Deduced a trap composed of 49 places in 147 ms of which 3 ms to minimize.
[2024-05-31 17:57:09] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 7 ms to minimize.
[2024-05-31 17:57:10] [INFO ] Deduced a trap composed of 46 places in 136 ms of which 4 ms to minimize.
[2024-05-31 17:57:10] [INFO ] Deduced a trap composed of 45 places in 142 ms of which 3 ms to minimize.
[2024-05-31 17:57:10] [INFO ] Deduced a trap composed of 43 places in 146 ms of which 3 ms to minimize.
[2024-05-31 17:57:10] [INFO ] Deduced a trap composed of 44 places in 174 ms of which 3 ms to minimize.
[2024-05-31 17:57:10] [INFO ] Deduced a trap composed of 41 places in 158 ms of which 3 ms to minimize.
[2024-05-31 17:57:11] [INFO ] Deduced a trap composed of 48 places in 153 ms of which 4 ms to minimize.
[2024-05-31 17:57:11] [INFO ] Deduced a trap composed of 43 places in 159 ms of which 3 ms to minimize.
[2024-05-31 17:57:11] [INFO ] Deduced a trap composed of 42 places in 144 ms of which 3 ms to minimize.
[2024-05-31 17:57:11] [INFO ] Deduced a trap composed of 42 places in 145 ms of which 3 ms to minimize.
[2024-05-31 17:57:11] [INFO ] Deduced a trap composed of 47 places in 137 ms of which 2 ms to minimize.
[2024-05-31 17:57:11] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 2 ms to minimize.
[2024-05-31 17:57:12] [INFO ] Deduced a trap composed of 49 places in 150 ms of which 4 ms to minimize.
[2024-05-31 17:57:12] [INFO ] Deduced a trap composed of 45 places in 132 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 20/43 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-31 17:57:12] [INFO ] Deduced a trap composed of 48 places in 150 ms of which 3 ms to minimize.
[2024-05-31 17:57:12] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 3 ms to minimize.
[2024-05-31 17:57:12] [INFO ] Deduced a trap composed of 42 places in 135 ms of which 3 ms to minimize.
[2024-05-31 17:57:12] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 3 ms to minimize.
[2024-05-31 17:57:12] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 3 ms to minimize.
[2024-05-31 17:57:13] [INFO ] Deduced a trap composed of 48 places in 151 ms of which 4 ms to minimize.
SMT process timed out in 6708ms, After SMT, problems are : Problem set: 2 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 75 out of 1042 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1042/1042 places, 1760/1760 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 1042 transition count 1676
Reduce places removed 84 places and 0 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 1 with 107 rules applied. Total rules applied 191 place count 958 transition count 1653
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 214 place count 935 transition count 1653
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 214 place count 935 transition count 1644
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 232 place count 926 transition count 1644
Discarding 331 places :
Symmetric choice reduction at 3 with 331 rule applications. Total rules 563 place count 595 transition count 982
Iterating global reduction 3 with 331 rules applied. Total rules applied 894 place count 595 transition count 982
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 914 place count 585 transition count 972
Free-agglomeration rule applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 923 place count 585 transition count 963
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 932 place count 576 transition count 963
Partial Free-agglomeration rule applied 35 times.
Drop transitions (Partial Free agglomeration) removed 35 transitions
Iterating global reduction 4 with 35 rules applied. Total rules applied 967 place count 576 transition count 963
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 971 place count 576 transition count 963
Applied a total of 971 rules in 327 ms. Remains 576 /1042 variables (removed 466) and now considering 963/1760 (removed 797) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 342 ms. Remains : 576/1042 places, 963/1760 transitions.
RANDOM walk for 40000 steps (254 resets) in 549 ms. (72 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (12 resets) in 256 ms. (155 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (12 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 493453 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :1 out of 2
Probabilistic random walk after 493453 steps, saw 105571 distinct states, run finished after 3005 ms. (steps per millisecond=164 ) properties seen :1
FORMULA CANConstruction-PT-020-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 963 rows 576 cols
[2024-05-31 17:57:16] [INFO ] Computed 41 invariants in 5 ms
[2024-05-31 17:57:16] [INFO ] State equation strengthened by 810 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 485/558 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/558 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/558 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/559 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 17/576 variables, 17/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 963/1539 variables, 576/617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1539 variables, 810/1427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1539 variables, 0/1427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1539 variables, 0/1427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1539/1539 variables, and 1427 constraints, problems are : Problem set: 0 solved, 1 unsolved in 547 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 576/576 constraints, ReadFeed: 810/810 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 485/558 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/558 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 17:57:17] [INFO ] Deduced a trap composed of 3 places in 147 ms of which 3 ms to minimize.
[2024-05-31 17:57:17] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 3 ms to minimize.
[2024-05-31 17:57:17] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 2 ms to minimize.
[2024-05-31 17:57:18] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 2 ms to minimize.
[2024-05-31 17:57:18] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-05-31 17:57:18] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 3 ms to minimize.
[2024-05-31 17:57:18] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 3 ms to minimize.
[2024-05-31 17:57:18] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/558 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 17:57:18] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 4 ms to minimize.
[2024-05-31 17:57:18] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 2 ms to minimize.
[2024-05-31 17:57:18] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2024-05-31 17:57:18] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 2 ms to minimize.
[2024-05-31 17:57:19] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/558 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/559 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 17:57:19] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 3 ms to minimize.
[2024-05-31 17:57:19] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 3 ms to minimize.
[2024-05-31 17:57:19] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 3 ms to minimize.
[2024-05-31 17:57:19] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 2 ms to minimize.
[2024-05-31 17:57:19] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 3 ms to minimize.
[2024-05-31 17:57:19] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 2 ms to minimize.
[2024-05-31 17:57:19] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 3 ms to minimize.
[2024-05-31 17:57:20] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/559 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/559 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 17/576 variables, 17/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/576 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 963/1539 variables, 576/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1539 variables, 810/1448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1539 variables, 1/1449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1539 variables, 0/1449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1539 variables, 0/1449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1539/1539 variables, and 1449 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3180 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 576/576 constraints, ReadFeed: 810/810 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 21/21 constraints]
After SMT, in 3797ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 73 out of 576 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 963/963 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 575 transition count 962
Applied a total of 2 rules in 62 ms. Remains 575 /576 variables (removed 1) and now considering 962/963 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 575/576 places, 962/963 transitions.
RANDOM walk for 40000 steps (253 resets) in 324 ms. (123 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (12 resets) in 263 ms. (151 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 516627 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :0 out of 1
Probabilistic random walk after 516627 steps, saw 114374 distinct states, run finished after 3001 ms. (steps per millisecond=172 ) properties seen :0
// Phase 1: matrix 962 rows 575 cols
[2024-05-31 17:57:23] [INFO ] Computed 41 invariants in 6 ms
[2024-05-31 17:57:23] [INFO ] State equation strengthened by 811 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 484/557 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/558 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 17/575 variables, 17/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/575 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 962/1537 variables, 575/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1537 variables, 811/1427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1537 variables, 0/1427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1537 variables, 0/1427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1537/1537 variables, and 1427 constraints, problems are : Problem set: 0 solved, 1 unsolved in 418 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 575/575 constraints, ReadFeed: 811/811 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 484/557 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 17:57:24] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 3 ms to minimize.
[2024-05-31 17:57:24] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 3 ms to minimize.
[2024-05-31 17:57:24] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 3 ms to minimize.
[2024-05-31 17:57:25] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 4 ms to minimize.
[2024-05-31 17:57:25] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 3 ms to minimize.
[2024-05-31 17:57:25] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 3 ms to minimize.
[2024-05-31 17:57:25] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 3 ms to minimize.
[2024-05-31 17:57:25] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 3 ms to minimize.
[2024-05-31 17:57:25] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 4 ms to minimize.
[2024-05-31 17:57:25] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 3 ms to minimize.
[2024-05-31 17:57:26] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 3 ms to minimize.
[2024-05-31 17:57:26] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 2 ms to minimize.
[2024-05-31 17:57:26] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 2 ms to minimize.
[2024-05-31 17:57:26] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 2 ms to minimize.
[2024-05-31 17:57:26] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 3 ms to minimize.
[2024-05-31 17:57:26] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 2 ms to minimize.
[2024-05-31 17:57:26] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 3 ms to minimize.
[2024-05-31 17:57:26] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 3 ms to minimize.
[2024-05-31 17:57:27] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 3 ms to minimize.
[2024-05-31 17:57:27] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 17:57:27] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 2 ms to minimize.
[2024-05-31 17:57:27] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 2 ms to minimize.
[2024-05-31 17:57:27] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 3 ms to minimize.
[2024-05-31 17:57:27] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 2 ms to minimize.
[2024-05-31 17:57:27] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
[2024-05-31 17:57:27] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 17:57:28] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/558 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 17:57:28] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 3 ms to minimize.
[2024-05-31 17:57:28] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 3 ms to minimize.
[2024-05-31 17:57:28] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 2 ms to minimize.
[2024-05-31 17:57:28] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 3 ms to minimize.
[2024-05-31 17:57:28] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 3 ms to minimize.
[2024-05-31 17:57:28] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 3 ms to minimize.
[2024-05-31 17:57:29] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 3 ms to minimize.
[2024-05-31 17:57:29] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 3 ms to minimize.
[2024-05-31 17:57:29] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 3 ms to minimize.
[2024-05-31 17:57:29] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 3 ms to minimize.
[2024-05-31 17:57:29] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 2 ms to minimize.
[2024-05-31 17:57:29] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 3 ms to minimize.
[2024-05-31 17:57:29] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 3 ms to minimize.
[2024-05-31 17:57:30] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 2 ms to minimize.
[2024-05-31 17:57:30] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 3 ms to minimize.
[2024-05-31 17:57:30] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 3 ms to minimize.
[2024-05-31 17:57:30] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 3 ms to minimize.
[2024-05-31 17:57:30] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 3 ms to minimize.
[2024-05-31 17:57:30] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 2 ms to minimize.
[2024-05-31 17:57:30] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 17:57:31] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 3 ms to minimize.
[2024-05-31 17:57:31] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 2 ms to minimize.
[2024-05-31 17:57:31] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 2 ms to minimize.
[2024-05-31 17:57:31] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 2 ms to minimize.
[2024-05-31 17:57:31] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/558 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 17/575 variables, 17/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/575 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 962/1537 variables, 575/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1537 variables, 811/1479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1537 variables, 1/1480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1537 variables, 0/1480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1537 variables, 0/1480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1537/1537 variables, and 1480 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7759 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 575/575 constraints, ReadFeed: 811/811 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 52/52 constraints]
After SMT, in 8231ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 73 out of 575 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 962/962 transitions.
Applied a total of 0 rules in 25 ms. Remains 575 /575 variables (removed 0) and now considering 962/962 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 575/575 places, 962/962 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 962/962 transitions.
Applied a total of 0 rules in 20 ms. Remains 575 /575 variables (removed 0) and now considering 962/962 (removed 0) transitions.
[2024-05-31 17:57:32] [INFO ] Invariant cache hit.
[2024-05-31 17:57:32] [INFO ] Implicit Places using invariants in 354 ms returned [7, 13, 20, 28, 52, 60, 67, 74, 81, 89, 97, 102, 118, 125, 132, 139, 144]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 369 ms to find 17 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 558/575 places, 962/962 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 558 transition count 959
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 555 transition count 959
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 23 place count 538 transition count 942
Iterating global reduction 2 with 17 rules applied. Total rules applied 40 place count 538 transition count 942
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 52 place count 532 transition count 936
Applied a total of 52 rules in 45 ms. Remains 532 /558 variables (removed 26) and now considering 936/962 (removed 26) transitions.
// Phase 1: matrix 936 rows 532 cols
[2024-05-31 17:57:32] [INFO ] Computed 24 invariants in 4 ms
[2024-05-31 17:57:32] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-05-31 17:57:32] [INFO ] Invariant cache hit.
[2024-05-31 17:57:33] [INFO ] State equation strengthened by 781 read => feed constraints.
[2024-05-31 17:57:34] [INFO ] Implicit Places using invariants and state equation in 1584 ms returned []
Implicit Place search using SMT with State Equation took 1858 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 532/575 places, 936/962 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2293 ms. Remains : 532/575 places, 936/962 transitions.
RANDOM walk for 40000 steps (250 resets) in 198 ms. (201 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (12 resets) in 158 ms. (251 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 569156 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :0 out of 1
Probabilistic random walk after 569156 steps, saw 125348 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :0
[2024-05-31 17:57:37] [INFO ] Invariant cache hit.
[2024-05-31 17:57:37] [INFO ] State equation strengthened by 781 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 458/531 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/531 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/532 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 936/1468 variables, 532/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1468 variables, 781/1337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1468 variables, 0/1337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1468 variables, 0/1337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1468/1468 variables, and 1337 constraints, problems are : Problem set: 0 solved, 1 unsolved in 348 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 532/532 constraints, ReadFeed: 781/781 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 458/531 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 17:57:38] [INFO ] Deduced a trap composed of 3 places in 160 ms of which 3 ms to minimize.
[2024-05-31 17:57:38] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 3 ms to minimize.
[2024-05-31 17:57:38] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 3 ms to minimize.
[2024-05-31 17:57:38] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 2 ms to minimize.
[2024-05-31 17:57:38] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 3 ms to minimize.
[2024-05-31 17:57:38] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 2 ms to minimize.
[2024-05-31 17:57:39] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 3 ms to minimize.
[2024-05-31 17:57:39] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 2 ms to minimize.
[2024-05-31 17:57:39] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 2 ms to minimize.
[2024-05-31 17:57:39] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 2 ms to minimize.
[2024-05-31 17:57:39] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 2 ms to minimize.
[2024-05-31 17:57:39] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 3 ms to minimize.
[2024-05-31 17:57:39] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 3 ms to minimize.
[2024-05-31 17:57:39] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 3 ms to minimize.
[2024-05-31 17:57:40] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 2 ms to minimize.
[2024-05-31 17:57:40] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
[2024-05-31 17:57:40] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 3 ms to minimize.
[2024-05-31 17:57:40] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 2 ms to minimize.
[2024-05-31 17:57:40] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 2 ms to minimize.
[2024-05-31 17:57:40] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/531 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 17:57:40] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 2 ms to minimize.
[2024-05-31 17:57:40] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 3 ms to minimize.
[2024-05-31 17:57:41] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 2 ms to minimize.
[2024-05-31 17:57:41] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 3 ms to minimize.
[2024-05-31 17:57:41] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-05-31 17:57:41] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
[2024-05-31 17:57:41] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 3 ms to minimize.
[2024-05-31 17:57:41] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 2 ms to minimize.
[2024-05-31 17:57:41] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 2 ms to minimize.
[2024-05-31 17:57:41] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2024-05-31 17:57:41] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 2 ms to minimize.
[2024-05-31 17:57:42] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 3 ms to minimize.
[2024-05-31 17:57:42] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 2 ms to minimize.
[2024-05-31 17:57:42] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 2 ms to minimize.
[2024-05-31 17:57:42] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 2 ms to minimize.
[2024-05-31 17:57:42] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 2 ms to minimize.
[2024-05-31 17:57:42] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-05-31 17:57:42] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-05-31 17:57:42] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2024-05-31 17:57:42] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/532 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 17:57:42] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 3 ms to minimize.
[2024-05-31 17:57:43] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 2 ms to minimize.
[2024-05-31 17:57:43] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 3 ms to minimize.
[2024-05-31 17:57:43] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 936/1468 variables, 532/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1468 variables, 781/1381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1468 variables, 1/1382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1468 variables, 0/1382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1468 variables, 0/1382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1468/1468 variables, and 1382 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5926 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 532/532 constraints, ReadFeed: 781/781 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 44/44 constraints]
After SMT, in 6311ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 73 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 936/936 transitions.
Applied a total of 0 rules in 16 ms. Remains 532 /532 variables (removed 0) and now considering 936/936 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 532/532 places, 936/936 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 936/936 transitions.
Applied a total of 0 rules in 15 ms. Remains 532 /532 variables (removed 0) and now considering 936/936 (removed 0) transitions.
[2024-05-31 17:57:43] [INFO ] Invariant cache hit.
[2024-05-31 17:57:44] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-05-31 17:57:44] [INFO ] Invariant cache hit.
[2024-05-31 17:57:44] [INFO ] State equation strengthened by 781 read => feed constraints.
[2024-05-31 17:57:45] [INFO ] Implicit Places using invariants and state equation in 1615 ms returned []
Implicit Place search using SMT with State Equation took 1822 ms to find 0 implicit places.
[2024-05-31 17:57:45] [INFO ] Redundant transitions in 59 ms returned []
Running 916 sub problems to find dead transitions.
[2024-05-31 17:57:45] [INFO ] Invariant cache hit.
[2024-05-31 17:57:45] [INFO ] State equation strengthened by 781 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 916 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 916 unsolved
[2024-05-31 17:57:53] [INFO ] Deduced a trap composed of 30 places in 152 ms of which 3 ms to minimize.
[2024-05-31 17:57:53] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 3 ms to minimize.
[2024-05-31 17:57:53] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 3 ms to minimize.
[2024-05-31 17:57:53] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 2 ms to minimize.
[2024-05-31 17:57:54] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 3 ms to minimize.
[2024-05-31 17:57:54] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 3 ms to minimize.
[2024-05-31 17:57:54] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 3 ms to minimize.
[2024-05-31 17:57:54] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 3 ms to minimize.
[2024-05-31 17:57:54] [INFO ] Deduced a trap composed of 28 places in 151 ms of which 3 ms to minimize.
[2024-05-31 17:57:54] [INFO ] Deduced a trap composed of 28 places in 150 ms of which 3 ms to minimize.
[2024-05-31 17:57:55] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 3 ms to minimize.
[2024-05-31 17:57:55] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 3 ms to minimize.
[2024-05-31 17:57:55] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 3 ms to minimize.
[2024-05-31 17:57:55] [INFO ] Deduced a trap composed of 28 places in 144 ms of which 3 ms to minimize.
[2024-05-31 17:57:55] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 3 ms to minimize.
[2024-05-31 17:57:55] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 3 ms to minimize.
[2024-05-31 17:57:55] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 3 ms to minimize.
[2024-05-31 17:57:56] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 2 ms to minimize.
[2024-05-31 17:57:56] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 2 ms to minimize.
[2024-05-31 17:57:56] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 916 unsolved
[2024-05-31 17:57:56] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 3 ms to minimize.
[2024-05-31 17:57:56] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 3 ms to minimize.
[2024-05-31 17:57:57] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 3 ms to minimize.
[2024-05-31 17:57:57] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 2 ms to minimize.
[2024-05-31 17:57:57] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 3 ms to minimize.
[2024-05-31 17:57:57] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 2 ms to minimize.
[2024-05-31 17:57:57] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 3 ms to minimize.
[2024-05-31 17:57:57] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 3 ms to minimize.
[2024-05-31 17:57:57] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 3 ms to minimize.
[2024-05-31 17:57:57] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 3 ms to minimize.
[2024-05-31 17:57:58] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 3 ms to minimize.
[2024-05-31 17:57:58] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 2 ms to minimize.
[2024-05-31 17:57:58] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 3 ms to minimize.
[2024-05-31 17:57:58] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 3 ms to minimize.
[2024-05-31 17:57:58] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 3 ms to minimize.
[2024-05-31 17:57:58] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 2 ms to minimize.
[2024-05-31 17:57:58] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 3 ms to minimize.
[2024-05-31 17:57:58] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 3 ms to minimize.
[2024-05-31 17:57:59] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 2 ms to minimize.
[2024-05-31 17:57:59] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/531 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 916 unsolved
[2024-05-31 17:58:06] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 2 ms to minimize.
[2024-05-31 17:58:06] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 3 ms to minimize.
[2024-05-31 17:58:07] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 2 ms to minimize.
[2024-05-31 17:58:07] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2024-05-31 17:58:07] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2024-05-31 17:58:07] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 3 ms to minimize.
[2024-05-31 17:58:07] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
[2024-05-31 17:58:07] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
[2024-05-31 17:58:07] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 3 ms to minimize.
[2024-05-31 17:58:07] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2024-05-31 17:58:07] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 2 ms to minimize.
[2024-05-31 17:58:08] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2024-05-31 17:58:08] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 2 ms to minimize.
[2024-05-31 17:58:08] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2024-05-31 17:58:08] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
[2024-05-31 17:58:08] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 2 ms to minimize.
[2024-05-31 17:58:08] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 2 ms to minimize.
[2024-05-31 17:58:08] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 3 ms to minimize.
[2024-05-31 17:58:08] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
[2024-05-31 17:58:08] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 916 unsolved
[2024-05-31 17:58:09] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 2 ms to minimize.
[2024-05-31 17:58:09] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 3 ms to minimize.
[2024-05-31 17:58:09] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 3 ms to minimize.
[2024-05-31 17:58:09] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 2 ms to minimize.
[2024-05-31 17:58:09] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
[2024-05-31 17:58:10] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 2 ms to minimize.
[2024-05-31 17:58:10] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 3 ms to minimize.
[2024-05-31 17:58:10] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 2 ms to minimize.
[2024-05-31 17:58:10] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 2 ms to minimize.
[2024-05-31 17:58:10] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 2 ms to minimize.
[2024-05-31 17:58:10] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 2 ms to minimize.
[2024-05-31 17:58:10] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-05-31 17:58:10] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
[2024-05-31 17:58:10] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2024-05-31 17:58:11] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 3 ms to minimize.
[2024-05-31 17:58:11] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
[2024-05-31 17:58:11] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 3 ms to minimize.
[2024-05-31 17:58:11] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 3 ms to minimize.
[2024-05-31 17:58:11] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 3 ms to minimize.
[2024-05-31 17:58:11] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 916 unsolved
[2024-05-31 17:58:12] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 3 ms to minimize.
[2024-05-31 17:58:12] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 3 ms to minimize.
[2024-05-31 17:58:12] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
[2024-05-31 17:58:12] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-05-31 17:58:12] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-05-31 17:58:12] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2024-05-31 17:58:12] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 2 ms to minimize.
[2024-05-31 17:58:13] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
[2024-05-31 17:58:13] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-05-31 17:58:13] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2024-05-31 17:58:13] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
[2024-05-31 17:58:13] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
[2024-05-31 17:58:13] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-05-31 17:58:13] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 2 ms to minimize.
[2024-05-31 17:58:13] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
[2024-05-31 17:58:13] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 2 ms to minimize.
[2024-05-31 17:58:14] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 3 ms to minimize.
[2024-05-31 17:58:14] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 2 ms to minimize.
[2024-05-31 17:58:14] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 2 ms to minimize.
[2024-05-31 17:58:14] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 916 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/1468 variables, and 124 constraints, problems are : Problem set: 0 solved, 916 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/532 constraints, ReadFeed: 0/781 constraints, PredecessorRefiner: 916/916 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 916 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 916 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 916 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 100/124 constraints. Problems are: Problem set: 0 solved, 916 unsolved
[2024-05-31 17:58:17] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 2 ms to minimize.
[2024-05-31 17:58:17] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 3 ms to minimize.
[2024-05-31 17:58:17] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 3 ms to minimize.
[2024-05-31 17:58:17] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 2 ms to minimize.
[2024-05-31 17:58:18] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 3 ms to minimize.
[2024-05-31 17:58:18] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 4 ms to minimize.
[2024-05-31 17:58:18] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 3 ms to minimize.
[2024-05-31 17:58:18] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 3 ms to minimize.
[2024-05-31 17:58:18] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 3 ms to minimize.
[2024-05-31 17:58:18] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 2 ms to minimize.
[2024-05-31 17:58:18] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 2 ms to minimize.
[2024-05-31 17:58:18] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 3 ms to minimize.
[2024-05-31 17:58:19] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 2 ms to minimize.
[2024-05-31 17:58:19] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 3 ms to minimize.
[2024-05-31 17:58:19] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
[2024-05-31 17:58:19] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 3 ms to minimize.
[2024-05-31 17:58:19] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 3 ms to minimize.
[2024-05-31 17:58:19] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 3 ms to minimize.
[2024-05-31 17:58:19] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 3 ms to minimize.
[2024-05-31 17:58:19] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/531 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 916 unsolved
[2024-05-31 17:58:20] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 2 ms to minimize.
[2024-05-31 17:58:20] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 2 ms to minimize.
[2024-05-31 17:58:20] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
[2024-05-31 17:58:20] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 2 ms to minimize.
[2024-05-31 17:58:20] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
[2024-05-31 17:58:21] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-05-31 17:58:21] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-05-31 17:58:21] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-05-31 17:58:21] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 2 ms to minimize.
[2024-05-31 17:58:21] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-05-31 17:58:21] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
[2024-05-31 17:58:21] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-05-31 17:58:21] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-05-31 17:58:21] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-05-31 17:58:21] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 2 ms to minimize.
[2024-05-31 17:58:21] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 2 ms to minimize.
[2024-05-31 17:58:21] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
[2024-05-31 17:58:22] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 2 ms to minimize.
[2024-05-31 17:58:22] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 2 ms to minimize.
[2024-05-31 17:58:22] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 916 unsolved
[2024-05-31 17:58:23] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 3 ms to minimize.
[2024-05-31 17:58:23] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 3 ms to minimize.
[2024-05-31 17:58:23] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 3 ms to minimize.
[2024-05-31 17:58:23] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 2 ms to minimize.
[2024-05-31 17:58:23] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 3 ms to minimize.
[2024-05-31 17:58:24] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 3 ms to minimize.
[2024-05-31 17:58:24] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 2 ms to minimize.
[2024-05-31 17:58:24] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 3 ms to minimize.
[2024-05-31 17:58:24] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 3 ms to minimize.
[2024-05-31 17:58:24] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 2 ms to minimize.
[2024-05-31 17:58:24] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 2 ms to minimize.
[2024-05-31 17:58:24] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 2 ms to minimize.
[2024-05-31 17:58:25] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 2 ms to minimize.
[2024-05-31 17:58:25] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 2 ms to minimize.
[2024-05-31 17:58:25] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 3 ms to minimize.
[2024-05-31 17:58:25] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 3 ms to minimize.
[2024-05-31 17:58:25] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 3 ms to minimize.
[2024-05-31 17:58:25] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 3 ms to minimize.
[2024-05-31 17:58:25] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 3 ms to minimize.
[2024-05-31 17:58:26] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 20/184 constraints. Problems are: Problem set: 0 solved, 916 unsolved
[2024-05-31 17:58:27] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 2 ms to minimize.
[2024-05-31 17:58:27] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 3 ms to minimize.
[2024-05-31 17:58:27] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 3 ms to minimize.
[2024-05-31 17:58:27] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
[2024-05-31 17:58:27] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
[2024-05-31 17:58:27] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 2 ms to minimize.
[2024-05-31 17:58:27] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-05-31 17:58:27] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
[2024-05-31 17:58:27] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 2 ms to minimize.
[2024-05-31 17:58:28] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 2 ms to minimize.
[2024-05-31 17:58:28] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-05-31 17:58:28] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 2 ms to minimize.
[2024-05-31 17:58:28] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 2 ms to minimize.
[2024-05-31 17:58:28] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 2 ms to minimize.
[2024-05-31 17:58:28] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
[2024-05-31 17:58:28] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 2 ms to minimize.
[2024-05-31 17:58:28] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 2 ms to minimize.
[2024-05-31 17:58:28] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 2 ms to minimize.
[2024-05-31 17:58:28] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 2 ms to minimize.
[2024-05-31 17:58:28] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 916 unsolved
[2024-05-31 17:58:30] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 2 ms to minimize.
[2024-05-31 17:58:30] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 2 ms to minimize.
[2024-05-31 17:58:30] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 3 ms to minimize.
[2024-05-31 17:58:30] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2024-05-31 17:58:30] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 3 ms to minimize.
[2024-05-31 17:58:30] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 2 ms to minimize.
[2024-05-31 17:58:30] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 3 ms to minimize.
[2024-05-31 17:58:30] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 2 ms to minimize.
[2024-05-31 17:58:30] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
[2024-05-31 17:58:31] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2024-05-31 17:58:31] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
[2024-05-31 17:58:31] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2024-05-31 17:58:31] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 2 ms to minimize.
[2024-05-31 17:58:31] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 2 ms to minimize.
[2024-05-31 17:58:31] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 2 ms to minimize.
[2024-05-31 17:58:31] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
[2024-05-31 17:58:31] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
[2024-05-31 17:58:31] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 2 ms to minimize.
[2024-05-31 17:58:32] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
[2024-05-31 17:58:32] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 20/224 constraints. Problems are: Problem set: 0 solved, 916 unsolved
[2024-05-31 17:58:33] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 3 ms to minimize.
[2024-05-31 17:58:33] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 2 ms to minimize.
[2024-05-31 17:58:33] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 3 ms to minimize.
[2024-05-31 17:58:33] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 2 ms to minimize.
[2024-05-31 17:58:33] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 2 ms to minimize.
[2024-05-31 17:58:33] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 3 ms to minimize.
[2024-05-31 17:58:34] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 3 ms to minimize.
[2024-05-31 17:58:34] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 3 ms to minimize.
[2024-05-31 17:58:34] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 2 ms to minimize.
[2024-05-31 17:58:34] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 3 ms to minimize.
[2024-05-31 17:58:34] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2024-05-31 17:58:34] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 2 ms to minimize.
[2024-05-31 17:58:34] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 2 ms to minimize.
[2024-05-31 17:58:34] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 2 ms to minimize.
[2024-05-31 17:58:35] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 2 ms to minimize.
[2024-05-31 17:58:35] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
[2024-05-31 17:58:35] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 3 ms to minimize.
[2024-05-31 17:58:35] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 2 ms to minimize.
[2024-05-31 17:58:35] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 2 ms to minimize.
[2024-05-31 17:58:35] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 20/244 constraints. Problems are: Problem set: 0 solved, 916 unsolved
[2024-05-31 17:58:36] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 2 ms to minimize.
[2024-05-31 17:58:36] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 3 ms to minimize.
[2024-05-31 17:58:37] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 2 ms to minimize.
[2024-05-31 17:58:37] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 4 ms to minimize.
[2024-05-31 17:58:37] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 2 ms to minimize.
[2024-05-31 17:58:37] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
[2024-05-31 17:58:37] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 2 ms to minimize.
[2024-05-31 17:58:37] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 2 ms to minimize.
[2024-05-31 17:58:37] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
[2024-05-31 17:58:37] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 2 ms to minimize.
[2024-05-31 17:58:37] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 3 ms to minimize.
[2024-05-31 17:58:38] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 2 ms to minimize.
[2024-05-31 17:58:38] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 3 ms to minimize.
[2024-05-31 17:58:38] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 2 ms to minimize.
[2024-05-31 17:58:38] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 2 ms to minimize.
[2024-05-31 17:58:38] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 2 ms to minimize.
[2024-05-31 17:58:38] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2024-05-31 17:58:38] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-05-31 17:58:38] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 2 ms to minimize.
[2024-05-31 17:58:38] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 20/264 constraints. Problems are: Problem set: 0 solved, 916 unsolved
[2024-05-31 17:58:40] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 1 ms to minimize.
[2024-05-31 17:58:40] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 2 ms to minimize.
[2024-05-31 17:58:40] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
[2024-05-31 17:58:40] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 2 ms to minimize.
[2024-05-31 17:58:40] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-31 17:58:40] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 2 ms to minimize.
[2024-05-31 17:58:40] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-31 17:58:40] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 2 ms to minimize.
[2024-05-31 17:58:40] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
[2024-05-31 17:58:41] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 2 ms to minimize.
[2024-05-31 17:58:41] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-05-31 17:58:41] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 2 ms to minimize.
[2024-05-31 17:58:41] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-31 17:58:41] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-05-31 17:58:41] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-31 17:58:41] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-05-31 17:58:41] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-31 17:58:41] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 2 ms to minimize.
[2024-05-31 17:58:41] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2024-05-31 17:58:41] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 20/284 constraints. Problems are: Problem set: 0 solved, 916 unsolved
[2024-05-31 17:58:43] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
[2024-05-31 17:58:43] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
[2024-05-31 17:58:43] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 2 ms to minimize.
[2024-05-31 17:58:43] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 2 ms to minimize.
[2024-05-31 17:58:43] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 2 ms to minimize.
[2024-05-31 17:58:43] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 2 ms to minimize.
[2024-05-31 17:58:43] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2024-05-31 17:58:44] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 2 ms to minimize.
[2024-05-31 17:58:44] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 2 ms to minimize.
[2024-05-31 17:58:44] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 2 ms to minimize.
[2024-05-31 17:58:44] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
[2024-05-31 17:58:44] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 2 ms to minimize.
[2024-05-31 17:58:44] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 2 ms to minimize.
[2024-05-31 17:58:44] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-05-31 17:58:44] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2024-05-31 17:58:44] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-05-31 17:58:44] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-05-31 17:58:45] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2024-05-31 17:58:45] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 2 ms to minimize.
[2024-05-31 17:58:45] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/531 variables, 20/304 constraints. Problems are: Problem set: 0 solved, 916 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/1468 variables, and 304 constraints, problems are : Problem set: 0 solved, 916 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/532 constraints, ReadFeed: 0/781 constraints, PredecessorRefiner: 0/916 constraints, Known Traps: 280/280 constraints]
After SMT, in 60424ms problems are : Problem set: 0 solved, 916 unsolved
Search for dead transitions found 0 dead transitions in 60442ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62358 ms. Remains : 532/532 places, 936/936 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 592 edges and 532 vertex of which 187 / 532 are part of one of the 10 SCC in 3 ms
Free SCC test removed 177 places
Drop transitions (Empty/Sink Transition effects.) removed 344 transitions
Reduce isomorphic transitions removed 344 transitions.
Graph (complete) has 665 edges and 355 vertex of which 347 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 37 place count 347 transition count 557
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 139
Iterating post reduction 1 with 207 rules applied. Total rules applied 244 place count 312 transition count 385
Reduce places removed 139 places and 0 transitions.
Ensure Unique test removed 131 transitions
Reduce isomorphic transitions removed 131 transitions.
Iterating post reduction 2 with 270 rules applied. Total rules applied 514 place count 173 transition count 254
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 514 place count 173 transition count 253
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 516 place count 172 transition count 253
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 524 place count 164 transition count 245
Iterating global reduction 3 with 8 rules applied. Total rules applied 532 place count 164 transition count 245
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 536 place count 162 transition count 243
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 539 place count 162 transition count 240
Free-agglomeration rule applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 559 place count 162 transition count 220
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 579 place count 142 transition count 220
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 585 place count 142 transition count 220
Applied a total of 585 rules in 58 ms. Remains 142 /532 variables (removed 390) and now considering 220/936 (removed 716) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 142 cols
[2024-05-31 17:58:46] [INFO ] Computed 16 invariants in 4 ms
[2024-05-31 17:58:46] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-31 17:58:46] [INFO ] [Real]Absence check using 14 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 17:58:46] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 17:58:46] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-31 17:58:46] [INFO ] [Nat]Absence check using 14 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 17:58:46] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 17:58:46] [INFO ] After 186ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 17:58:46] [INFO ] After 300ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 441 ms.
[2024-05-31 17:58:46] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-05-31 17:58:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 532 places, 936 transitions and 3506 arcs took 7 ms.
[2024-05-31 17:58:46] [INFO ] Flatten gal took : 81 ms
Total runtime 101629 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : CANConstruction-PT-020-ReachabilityFireability-2024-03

BK_STOP 1717178327212

--------------------
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
mcc2024
rfs formula name CANConstruction-PT-020-ReachabilityFireability-2024-03
rfs formula type EF
rfs formula formula --invariant=/tmp/1840/inv_0_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is CANConstruction-PT-020, 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 r476-tall-171620505000023"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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