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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 18:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 12 18:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 18:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 18:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 1.4M 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-030-ReachabilityCardinality-2024-00
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-2024-01
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-2024-02
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-2024-03
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-2024-04
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-2024-05
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-2024-06
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-2024-07
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-2024-08
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-2024-09
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-2024-10
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-2024-11
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-2024-12
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-2024-13
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-2024-14
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716363737256

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-030
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 07:42:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 07:42:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 07:42:18] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2024-05-22 07:42:18] [INFO ] Transformed 2162 places.
[2024-05-22 07:42:18] [INFO ] Transformed 3840 transitions.
[2024-05-22 07:42:18] [INFO ] Parsed PT model containing 2162 places and 3840 transitions and 11400 arcs in 291 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (73 resets) in 2042 ms. (19 steps per ms) remains 11/16 properties
FORMULA CANConstruction-PT-030-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 429 ms. (93 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 436 ms. (91 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 528 ms. (75 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 69 ms. (571 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 338 ms. (118 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 11/11 properties
// Phase 1: matrix 3840 rows 2162 cols
[2024-05-22 07:42:20] [INFO ] Computed 61 invariants in 54 ms
[2024-05-22 07:42:20] [INFO ] State equation strengthened by 1770 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem CANConstruction-PT-030-ReachabilityCardinality-2024-01 is UNSAT
FORMULA CANConstruction-PT-030-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-030-ReachabilityCardinality-2024-02 is UNSAT
FORMULA CANConstruction-PT-030-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-030-ReachabilityCardinality-2024-04 is UNSAT
FORMULA CANConstruction-PT-030-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-030-ReachabilityCardinality-2024-05 is UNSAT
FORMULA CANConstruction-PT-030-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-030-ReachabilityCardinality-2024-10 is UNSAT
FORMULA CANConstruction-PT-030-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 2008/2136 variables, 31/31 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2136 variables, 5/36 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2136 variables, 0/36 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 25/2161 variables, 25/61 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2161 variables, 0/61 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 3840/6001 variables, 2161/2222 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6001 variables, 1770/3992 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6001 variables, 0/3992 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1/6002 variables, 1/3993 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/6002 variables, 0/3993 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/6002 variables, 0/3993 constraints. Problems are: Problem set: 5 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6002/6002 variables, and 3993 constraints, problems are : Problem set: 5 solved, 6 unsolved in 4106 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 2162/2162 constraints, ReadFeed: 1770/1770 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 2037/2136 variables, 31/31 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2136 variables, 5/36 constraints. Problems are: Problem set: 5 solved, 6 unsolved
[2024-05-22 07:42:25] [INFO ] Deduced a trap composed of 56 places in 1009 ms of which 86 ms to minimize.
[2024-05-22 07:42:26] [INFO ] Deduced a trap composed of 55 places in 939 ms of which 12 ms to minimize.
[2024-05-22 07:42:27] [INFO ] Deduced a trap composed of 57 places in 922 ms of which 11 ms to minimize.
[2024-05-22 07:42:28] [INFO ] Deduced a trap composed of 55 places in 907 ms of which 11 ms to minimize.
[2024-05-22 07:42:29] [INFO ] Deduced a trap composed of 67 places in 847 ms of which 9 ms to minimize.
SMT process timed out in 9446ms, After SMT, problems are : Problem set: 5 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 99 out of 2162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2162/2162 places, 3840/3840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 179 transitions
Trivial Post-agglo rules discarded 179 transitions
Performed 179 trivial Post agglomeration. Transition count delta: 179
Iterating post reduction 0 with 179 rules applied. Total rules applied 179 place count 2162 transition count 3661
Reduce places removed 179 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 189 rules applied. Total rules applied 368 place count 1983 transition count 3651
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 378 place count 1973 transition count 3651
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 378 place count 1973 transition count 3644
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 392 place count 1966 transition count 3644
Discarding 798 places :
Symmetric choice reduction at 3 with 798 rule applications. Total rules 1190 place count 1168 transition count 2048
Iterating global reduction 3 with 798 rules applied. Total rules applied 1988 place count 1168 transition count 2048
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 2032 place count 1146 transition count 2026
Free-agglomeration rule applied 14 times.
Iterating global reduction 3 with 14 rules applied. Total rules applied 2046 place count 1146 transition count 2012
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 2060 place count 1132 transition count 2012
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2064 place count 1132 transition count 2008
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 2068 place count 1128 transition count 2008
Partial Free-agglomeration rule applied 46 times.
Drop transitions (Partial Free agglomeration) removed 46 transitions
Iterating global reduction 5 with 46 rules applied. Total rules applied 2114 place count 1128 transition count 2008
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2115 place count 1128 transition count 2008
Applied a total of 2115 rules in 1123 ms. Remains 1128 /2162 variables (removed 1034) and now considering 2008/3840 (removed 1832) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1135 ms. Remains : 1128/2162 places, 2008/3840 transitions.
RANDOM walk for 40000 steps (174 resets) in 550 ms. (72 steps per ms) remains 5/6 properties
FORMULA CANConstruction-PT-030-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 5/5 properties
// Phase 1: matrix 2008 rows 1128 cols
[2024-05-22 07:42:31] [INFO ] Computed 61 invariants in 10 ms
[2024-05-22 07:42:31] [INFO ] State equation strengthened by 1809 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, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1005/1102 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1102 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1102 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 25/1127 variables, 25/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1127 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2008/3135 variables, 1127/1188 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3135 variables, 1809/2997 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3135 variables, 0/2997 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/3136 variables, 1/2998 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3136 variables, 0/2998 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/3136 variables, 0/2998 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3136/3136 variables, and 2998 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1692 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 1128/1128 constraints, ReadFeed: 1809/1809 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1005/1102 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1102 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 07:42:33] [INFO ] Deduced a trap composed of 35 places in 394 ms of which 6 ms to minimize.
[2024-05-22 07:42:33] [INFO ] Deduced a trap composed of 34 places in 375 ms of which 6 ms to minimize.
[2024-05-22 07:42:34] [INFO ] Deduced a trap composed of 33 places in 383 ms of which 5 ms to minimize.
[2024-05-22 07:42:34] [INFO ] Deduced a trap composed of 33 places in 426 ms of which 6 ms to minimize.
[2024-05-22 07:42:35] [INFO ] Deduced a trap composed of 44 places in 413 ms of which 6 ms to minimize.
[2024-05-22 07:42:35] [INFO ] Deduced a trap composed of 36 places in 372 ms of which 6 ms to minimize.
[2024-05-22 07:42:36] [INFO ] Deduced a trap composed of 36 places in 357 ms of which 7 ms to minimize.
[2024-05-22 07:42:36] [INFO ] Deduced a trap composed of 33 places in 363 ms of which 5 ms to minimize.
[2024-05-22 07:42:36] [INFO ] Deduced a trap composed of 35 places in 333 ms of which 5 ms to minimize.
[2024-05-22 07:42:37] [INFO ] Deduced a trap composed of 42 places in 354 ms of which 6 ms to minimize.
[2024-05-22 07:42:37] [INFO ] Deduced a trap composed of 33 places in 310 ms of which 5 ms to minimize.
[2024-05-22 07:42:37] [INFO ] Deduced a trap composed of 38 places in 337 ms of which 5 ms to minimize.
[2024-05-22 07:42:38] [INFO ] Deduced a trap composed of 34 places in 338 ms of which 5 ms to minimize.
[2024-05-22 07:42:38] [INFO ] Deduced a trap composed of 37 places in 339 ms of which 6 ms to minimize.
[2024-05-22 07:42:38] [INFO ] Deduced a trap composed of 33 places in 361 ms of which 5 ms to minimize.
[2024-05-22 07:42:39] [INFO ] Deduced a trap composed of 34 places in 337 ms of which 5 ms to minimize.
[2024-05-22 07:42:39] [INFO ] Deduced a trap composed of 36 places in 344 ms of which 5 ms to minimize.
[2024-05-22 07:42:39] [INFO ] Deduced a trap composed of 35 places in 345 ms of which 5 ms to minimize.
[2024-05-22 07:42:40] [INFO ] Deduced a trap composed of 34 places in 332 ms of which 5 ms to minimize.
[2024-05-22 07:42:40] [INFO ] Deduced a trap composed of 34 places in 344 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1102 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 07:42:41] [INFO ] Deduced a trap composed of 37 places in 331 ms of which 5 ms to minimize.
[2024-05-22 07:42:41] [INFO ] Deduced a trap composed of 33 places in 334 ms of which 5 ms to minimize.
[2024-05-22 07:42:41] [INFO ] Deduced a trap composed of 37 places in 321 ms of which 5 ms to minimize.
[2024-05-22 07:42:42] [INFO ] Deduced a trap composed of 34 places in 307 ms of which 5 ms to minimize.
[2024-05-22 07:42:42] [INFO ] Deduced a trap composed of 34 places in 299 ms of which 5 ms to minimize.
[2024-05-22 07:42:42] [INFO ] Deduced a trap composed of 34 places in 324 ms of which 5 ms to minimize.
[2024-05-22 07:42:43] [INFO ] Deduced a trap composed of 37 places in 308 ms of which 5 ms to minimize.
[2024-05-22 07:42:43] [INFO ] Deduced a trap composed of 33 places in 318 ms of which 5 ms to minimize.
[2024-05-22 07:42:43] [INFO ] Deduced a trap composed of 34 places in 278 ms of which 5 ms to minimize.
[2024-05-22 07:42:44] [INFO ] Deduced a trap composed of 36 places in 268 ms of which 7 ms to minimize.
[2024-05-22 07:42:44] [INFO ] Deduced a trap composed of 37 places in 277 ms of which 5 ms to minimize.
[2024-05-22 07:42:44] [INFO ] Deduced a trap composed of 38 places in 283 ms of which 4 ms to minimize.
[2024-05-22 07:42:44] [INFO ] Deduced a trap composed of 39 places in 276 ms of which 4 ms to minimize.
[2024-05-22 07:42:45] [INFO ] Deduced a trap composed of 37 places in 266 ms of which 5 ms to minimize.
[2024-05-22 07:42:45] [INFO ] Deduced a trap composed of 37 places in 277 ms of which 4 ms to minimize.
[2024-05-22 07:42:45] [INFO ] Deduced a trap composed of 36 places in 261 ms of which 4 ms to minimize.
[2024-05-22 07:42:46] [INFO ] Deduced a trap composed of 36 places in 284 ms of which 4 ms to minimize.
[2024-05-22 07:42:46] [INFO ] Deduced a trap composed of 33 places in 284 ms of which 5 ms to minimize.
[2024-05-22 07:42:46] [INFO ] Deduced a trap composed of 34 places in 274 ms of which 5 ms to minimize.
[2024-05-22 07:42:46] [INFO ] Deduced a trap composed of 36 places in 259 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1102 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 07:42:47] [INFO ] Deduced a trap composed of 38 places in 272 ms of which 5 ms to minimize.
[2024-05-22 07:42:47] [INFO ] Deduced a trap composed of 36 places in 253 ms of which 4 ms to minimize.
[2024-05-22 07:42:47] [INFO ] Deduced a trap composed of 33 places in 243 ms of which 4 ms to minimize.
[2024-05-22 07:42:48] [INFO ] Deduced a trap composed of 33 places in 242 ms of which 4 ms to minimize.
[2024-05-22 07:42:48] [INFO ] Deduced a trap composed of 37 places in 284 ms of which 5 ms to minimize.
[2024-05-22 07:42:48] [INFO ] Deduced a trap composed of 37 places in 270 ms of which 5 ms to minimize.
[2024-05-22 07:42:48] [INFO ] Deduced a trap composed of 34 places in 246 ms of which 4 ms to minimize.
[2024-05-22 07:42:49] [INFO ] Deduced a trap composed of 40 places in 238 ms of which 4 ms to minimize.
[2024-05-22 07:42:49] [INFO ] Deduced a trap composed of 37 places in 276 ms of which 4 ms to minimize.
[2024-05-22 07:42:49] [INFO ] Deduced a trap composed of 34 places in 241 ms of which 4 ms to minimize.
[2024-05-22 07:42:50] [INFO ] Deduced a trap composed of 34 places in 239 ms of which 6 ms to minimize.
[2024-05-22 07:42:50] [INFO ] Deduced a trap composed of 35 places in 272 ms of which 5 ms to minimize.
[2024-05-22 07:42:50] [INFO ] Deduced a trap composed of 38 places in 233 ms of which 4 ms to minimize.
[2024-05-22 07:42:50] [INFO ] Deduced a trap composed of 34 places in 236 ms of which 4 ms to minimize.
[2024-05-22 07:42:51] [INFO ] Deduced a trap composed of 36 places in 222 ms of which 4 ms to minimize.
[2024-05-22 07:42:51] [INFO ] Deduced a trap composed of 37 places in 252 ms of which 4 ms to minimize.
[2024-05-22 07:42:51] [INFO ] Deduced a trap composed of 36 places in 226 ms of which 4 ms to minimize.
[2024-05-22 07:42:51] [INFO ] Deduced a trap composed of 36 places in 233 ms of which 4 ms to minimize.
[2024-05-22 07:42:52] [INFO ] Deduced a trap composed of 38 places in 207 ms of which 4 ms to minimize.
[2024-05-22 07:42:52] [INFO ] Deduced a trap composed of 37 places in 198 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1102 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 07:42:52] [INFO ] Deduced a trap composed of 34 places in 237 ms of which 5 ms to minimize.
[2024-05-22 07:42:52] [INFO ] Deduced a trap composed of 37 places in 239 ms of which 4 ms to minimize.
[2024-05-22 07:42:53] [INFO ] Deduced a trap composed of 34 places in 212 ms of which 4 ms to minimize.
[2024-05-22 07:42:53] [INFO ] Deduced a trap composed of 38 places in 214 ms of which 4 ms to minimize.
[2024-05-22 07:42:53] [INFO ] Deduced a trap composed of 36 places in 204 ms of which 4 ms to minimize.
[2024-05-22 07:42:53] [INFO ] Deduced a trap composed of 36 places in 181 ms of which 4 ms to minimize.
[2024-05-22 07:42:53] [INFO ] Deduced a trap composed of 36 places in 172 ms of which 4 ms to minimize.
[2024-05-22 07:42:54] [INFO ] Deduced a trap composed of 36 places in 181 ms of which 3 ms to minimize.
[2024-05-22 07:42:54] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 3 ms to minimize.
[2024-05-22 07:42:54] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 4 ms to minimize.
[2024-05-22 07:42:54] [INFO ] Deduced a trap composed of 38 places in 163 ms of which 4 ms to minimize.
[2024-05-22 07:42:54] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 4 ms to minimize.
[2024-05-22 07:42:55] [INFO ] Deduced a trap composed of 37 places in 146 ms of which 3 ms to minimize.
[2024-05-22 07:42:55] [INFO ] Deduced a trap composed of 38 places in 158 ms of which 3 ms to minimize.
[2024-05-22 07:42:55] [INFO ] Deduced a trap composed of 36 places in 169 ms of which 3 ms to minimize.
[2024-05-22 07:42:55] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 3 ms to minimize.
[2024-05-22 07:42:55] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 2 ms to minimize.
[2024-05-22 07:42:55] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 3 ms to minimize.
[2024-05-22 07:42:55] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 3 ms to minimize.
[2024-05-22 07:42:56] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1102 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 07:42:56] [INFO ] Deduced a trap composed of 37 places in 233 ms of which 4 ms to minimize.
[2024-05-22 07:42:56] [INFO ] Deduced a trap composed of 37 places in 202 ms of which 4 ms to minimize.
[2024-05-22 07:42:56] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 3 ms to minimize.
[2024-05-22 07:42:57] [INFO ] Deduced a trap composed of 37 places in 175 ms of which 4 ms to minimize.
[2024-05-22 07:42:57] [INFO ] Deduced a trap composed of 38 places in 153 ms of which 3 ms to minimize.
[2024-05-22 07:42:57] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 3 ms to minimize.
[2024-05-22 07:42:57] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 3 ms to minimize.
[2024-05-22 07:42:57] [INFO ] Deduced a trap composed of 41 places in 199 ms of which 4 ms to minimize.
[2024-05-22 07:42:57] [INFO ] Deduced a trap composed of 39 places in 183 ms of which 3 ms to minimize.
[2024-05-22 07:42:58] [INFO ] Deduced a trap composed of 36 places in 187 ms of which 3 ms to minimize.
[2024-05-22 07:42:58] [INFO ] Deduced a trap composed of 36 places in 182 ms of which 3 ms to minimize.
[2024-05-22 07:42:58] [INFO ] Deduced a trap composed of 34 places in 173 ms of which 4 ms to minimize.
[2024-05-22 07:42:58] [INFO ] Deduced a trap composed of 38 places in 153 ms of which 3 ms to minimize.
[2024-05-22 07:42:58] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 4 ms to minimize.
[2024-05-22 07:42:59] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 4 ms to minimize.
[2024-05-22 07:42:59] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 3 ms to minimize.
[2024-05-22 07:42:59] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 2 ms to minimize.
[2024-05-22 07:42:59] [INFO ] Deduced a trap composed of 36 places in 160 ms of which 3 ms to minimize.
[2024-05-22 07:42:59] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 2 ms to minimize.
[2024-05-22 07:42:59] [INFO ] Deduced a trap composed of 34 places in 146 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1102 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 07:43:00] [INFO ] Deduced a trap composed of 33 places in 224 ms of which 4 ms to minimize.
[2024-05-22 07:43:00] [INFO ] Deduced a trap composed of 38 places in 232 ms of which 4 ms to minimize.
[2024-05-22 07:43:00] [INFO ] Deduced a trap composed of 38 places in 237 ms of which 4 ms to minimize.
[2024-05-22 07:43:00] [INFO ] Deduced a trap composed of 37 places in 239 ms of which 4 ms to minimize.
[2024-05-22 07:43:01] [INFO ] Deduced a trap composed of 34 places in 194 ms of which 3 ms to minimize.
[2024-05-22 07:43:01] [INFO ] Deduced a trap composed of 36 places in 194 ms of which 3 ms to minimize.
[2024-05-22 07:43:01] [INFO ] Deduced a trap composed of 38 places in 177 ms of which 3 ms to minimize.
[2024-05-22 07:43:01] [INFO ] Deduced a trap composed of 34 places in 181 ms of which 3 ms to minimize.
[2024-05-22 07:43:01] [INFO ] Deduced a trap composed of 33 places in 163 ms of which 3 ms to minimize.
[2024-05-22 07:43:02] [INFO ] Deduced a trap composed of 36 places in 212 ms of which 4 ms to minimize.
[2024-05-22 07:43:02] [INFO ] Deduced a trap composed of 34 places in 186 ms of which 3 ms to minimize.
[2024-05-22 07:43:02] [INFO ] Deduced a trap composed of 36 places in 179 ms of which 3 ms to minimize.
[2024-05-22 07:43:02] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 3 ms to minimize.
[2024-05-22 07:43:02] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 3 ms to minimize.
[2024-05-22 07:43:03] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 3 ms to minimize.
[2024-05-22 07:43:03] [INFO ] Deduced a trap composed of 35 places in 155 ms of which 4 ms to minimize.
[2024-05-22 07:43:03] [INFO ] Deduced a trap composed of 36 places in 170 ms of which 3 ms to minimize.
[2024-05-22 07:43:03] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 3 ms to minimize.
[2024-05-22 07:43:03] [INFO ] Deduced a trap composed of 36 places in 187 ms of which 3 ms to minimize.
[2024-05-22 07:43:03] [INFO ] Deduced a trap composed of 34 places in 181 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1102 variables, 20/156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 07:43:04] [INFO ] Deduced a trap composed of 34 places in 243 ms of which 4 ms to minimize.
[2024-05-22 07:43:04] [INFO ] Deduced a trap composed of 33 places in 222 ms of which 5 ms to minimize.
[2024-05-22 07:43:04] [INFO ] Deduced a trap composed of 34 places in 225 ms of which 4 ms to minimize.
[2024-05-22 07:43:05] [INFO ] Deduced a trap composed of 34 places in 206 ms of which 4 ms to minimize.
[2024-05-22 07:43:05] [INFO ] Deduced a trap composed of 33 places in 217 ms of which 4 ms to minimize.
[2024-05-22 07:43:05] [INFO ] Deduced a trap composed of 33 places in 221 ms of which 4 ms to minimize.
[2024-05-22 07:43:05] [INFO ] Deduced a trap composed of 33 places in 224 ms of which 4 ms to minimize.
[2024-05-22 07:43:05] [INFO ] Deduced a trap composed of 33 places in 211 ms of which 4 ms to minimize.
[2024-05-22 07:43:06] [INFO ] Deduced a trap composed of 37 places in 205 ms of which 3 ms to minimize.
[2024-05-22 07:43:06] [INFO ] Deduced a trap composed of 36 places in 205 ms of which 4 ms to minimize.
[2024-05-22 07:43:06] [INFO ] Deduced a trap composed of 38 places in 184 ms of which 4 ms to minimize.
[2024-05-22 07:43:06] [INFO ] Deduced a trap composed of 38 places in 187 ms of which 4 ms to minimize.
[2024-05-22 07:43:07] [INFO ] Deduced a trap composed of 33 places in 183 ms of which 3 ms to minimize.
[2024-05-22 07:43:07] [INFO ] Deduced a trap composed of 34 places in 180 ms of which 4 ms to minimize.
[2024-05-22 07:43:07] [INFO ] Deduced a trap composed of 38 places in 175 ms of which 4 ms to minimize.
[2024-05-22 07:43:07] [INFO ] Deduced a trap composed of 39 places in 164 ms of which 4 ms to minimize.
[2024-05-22 07:43:07] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 3 ms to minimize.
[2024-05-22 07:43:07] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 4 ms to minimize.
[2024-05-22 07:43:08] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 3 ms to minimize.
[2024-05-22 07:43:08] [INFO ] Deduced a trap composed of 34 places in 131 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1102 variables, 20/176 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 07:43:08] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 3 ms to minimize.
[2024-05-22 07:43:08] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 3 ms to minimize.
[2024-05-22 07:43:08] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 3 ms to minimize.
[2024-05-22 07:43:08] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 2 ms to minimize.
[2024-05-22 07:43:09] [INFO ] Deduced a trap composed of 36 places in 224 ms of which 4 ms to minimize.
[2024-05-22 07:43:09] [INFO ] Deduced a trap composed of 33 places in 215 ms of which 4 ms to minimize.
[2024-05-22 07:43:09] [INFO ] Deduced a trap composed of 36 places in 211 ms of which 3 ms to minimize.
[2024-05-22 07:43:09] [INFO ] Deduced a trap composed of 36 places in 204 ms of which 4 ms to minimize.
[2024-05-22 07:43:10] [INFO ] Deduced a trap composed of 41 places in 195 ms of which 4 ms to minimize.
[2024-05-22 07:43:10] [INFO ] Deduced a trap composed of 33 places in 194 ms of which 4 ms to minimize.
[2024-05-22 07:43:10] [INFO ] Deduced a trap composed of 33 places in 189 ms of which 4 ms to minimize.
[2024-05-22 07:43:10] [INFO ] Deduced a trap composed of 33 places in 188 ms of which 4 ms to minimize.
[2024-05-22 07:43:10] [INFO ] Deduced a trap composed of 33 places in 177 ms of which 3 ms to minimize.
[2024-05-22 07:43:11] [INFO ] Deduced a trap composed of 33 places in 164 ms of which 3 ms to minimize.
[2024-05-22 07:43:11] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 4 ms to minimize.
[2024-05-22 07:43:11] [INFO ] Deduced a trap composed of 33 places in 150 ms of which 3 ms to minimize.
[2024-05-22 07:43:11] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 3 ms to minimize.
[2024-05-22 07:43:11] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 3 ms to minimize.
[2024-05-22 07:43:11] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 4 ms to minimize.
[2024-05-22 07:43:12] [INFO ] Deduced a trap composed of 40 places in 157 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1102 variables, 20/196 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 07:43:12] [INFO ] Deduced a trap composed of 36 places in 186 ms of which 3 ms to minimize.
[2024-05-22 07:43:12] [INFO ] Deduced a trap composed of 39 places in 179 ms of which 3 ms to minimize.
[2024-05-22 07:43:12] [INFO ] Deduced a trap composed of 33 places in 168 ms of which 3 ms to minimize.
[2024-05-22 07:43:12] [INFO ] Deduced a trap composed of 36 places in 157 ms of which 3 ms to minimize.
[2024-05-22 07:43:13] [INFO ] Deduced a trap composed of 36 places in 153 ms of which 3 ms to minimize.
[2024-05-22 07:43:13] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 3 ms to minimize.
[2024-05-22 07:43:13] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 3 ms to minimize.
[2024-05-22 07:43:13] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 3 ms to minimize.
[2024-05-22 07:43:13] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 3 ms to minimize.
[2024-05-22 07:43:13] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 3 ms to minimize.
[2024-05-22 07:43:13] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 3 ms to minimize.
[2024-05-22 07:43:14] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 3 ms to minimize.
[2024-05-22 07:43:14] [INFO ] Deduced a trap composed of 36 places in 154 ms of which 3 ms to minimize.
[2024-05-22 07:43:14] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 3 ms to minimize.
[2024-05-22 07:43:14] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 3 ms to minimize.
[2024-05-22 07:43:14] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 2 ms to minimize.
[2024-05-22 07:43:14] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 3 ms to minimize.
[2024-05-22 07:43:15] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 3 ms to minimize.
[2024-05-22 07:43:15] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 3 ms to minimize.
[2024-05-22 07:43:15] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1102 variables, 20/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 07:43:15] [INFO ] Deduced a trap composed of 36 places in 196 ms of which 4 ms to minimize.
[2024-05-22 07:43:15] [INFO ] Deduced a trap composed of 39 places in 201 ms of which 3 ms to minimize.
[2024-05-22 07:43:16] [INFO ] Deduced a trap composed of 33 places in 191 ms of which 3 ms to minimize.
[2024-05-22 07:43:16] [INFO ] Deduced a trap composed of 33 places in 180 ms of which 4 ms to minimize.
[2024-05-22 07:43:16] [INFO ] Deduced a trap composed of 36 places in 171 ms of which 3 ms to minimize.
[2024-05-22 07:43:16] [INFO ] Deduced a trap composed of 33 places in 161 ms of which 3 ms to minimize.
[2024-05-22 07:43:16] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 3 ms to minimize.
[2024-05-22 07:43:17] [INFO ] Deduced a trap composed of 39 places in 180 ms of which 4 ms to minimize.
[2024-05-22 07:43:17] [INFO ] Deduced a trap composed of 34 places in 181 ms of which 4 ms to minimize.
[2024-05-22 07:43:17] [INFO ] Deduced a trap composed of 36 places in 158 ms of which 3 ms to minimize.
[2024-05-22 07:43:17] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 3 ms to minimize.
[2024-05-22 07:43:17] [INFO ] Deduced a trap composed of 40 places in 157 ms of which 3 ms to minimize.
[2024-05-22 07:43:18] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 3 ms to minimize.
SMT process timed out in 46789ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 97 out of 1128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1128/1128 places, 2008/2008 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 1126 transition count 2006
Applied a total of 4 rules in 92 ms. Remains 1126 /1128 variables (removed 2) and now considering 2006/2008 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 1126/1128 places, 2006/2008 transitions.
RANDOM walk for 40000 steps (173 resets) in 646 ms. (61 steps per ms) remains 3/5 properties
FORMULA CANConstruction-PT-030-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 116 ms. (341 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 3/3 properties
// Phase 1: matrix 2006 rows 1126 cols
[2024-05-22 07:43:18] [INFO ] Computed 61 invariants in 7 ms
[2024-05-22 07:43:18] [INFO ] State equation strengthened by 1811 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1015/1100 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1100 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1100 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 25/1125 variables, 25/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1125 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2006/3131 variables, 1125/1186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3131 variables, 1811/2997 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3131 variables, 0/2997 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/3132 variables, 1/2998 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3132 variables, 0/2998 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/3132 variables, 0/2998 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3132/3132 variables, and 2998 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1279 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 1126/1126 constraints, ReadFeed: 1811/1811 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1015/1100 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1100 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:43:20] [INFO ] Deduced a trap composed of 36 places in 341 ms of which 5 ms to minimize.
[2024-05-22 07:43:20] [INFO ] Deduced a trap composed of 36 places in 348 ms of which 6 ms to minimize.
[2024-05-22 07:43:20] [INFO ] Deduced a trap composed of 43 places in 330 ms of which 5 ms to minimize.
[2024-05-22 07:43:21] [INFO ] Deduced a trap composed of 33 places in 345 ms of which 5 ms to minimize.
[2024-05-22 07:43:21] [INFO ] Deduced a trap composed of 39 places in 314 ms of which 5 ms to minimize.
[2024-05-22 07:43:22] [INFO ] Deduced a trap composed of 34 places in 299 ms of which 5 ms to minimize.
[2024-05-22 07:43:22] [INFO ] Deduced a trap composed of 36 places in 291 ms of which 5 ms to minimize.
[2024-05-22 07:43:22] [INFO ] Deduced a trap composed of 34 places in 262 ms of which 5 ms to minimize.
[2024-05-22 07:43:22] [INFO ] Deduced a trap composed of 33 places in 248 ms of which 5 ms to minimize.
[2024-05-22 07:43:23] [INFO ] Deduced a trap composed of 35 places in 258 ms of which 5 ms to minimize.
[2024-05-22 07:43:23] [INFO ] Deduced a trap composed of 36 places in 255 ms of which 4 ms to minimize.
[2024-05-22 07:43:23] [INFO ] Deduced a trap composed of 33 places in 229 ms of which 4 ms to minimize.
[2024-05-22 07:43:23] [INFO ] Deduced a trap composed of 36 places in 235 ms of which 4 ms to minimize.
[2024-05-22 07:43:24] [INFO ] Deduced a trap composed of 36 places in 234 ms of which 4 ms to minimize.
[2024-05-22 07:43:24] [INFO ] Deduced a trap composed of 34 places in 218 ms of which 4 ms to minimize.
[2024-05-22 07:43:24] [INFO ] Deduced a trap composed of 42 places in 203 ms of which 4 ms to minimize.
[2024-05-22 07:43:24] [INFO ] Deduced a trap composed of 36 places in 245 ms of which 4 ms to minimize.
[2024-05-22 07:43:25] [INFO ] Deduced a trap composed of 38 places in 210 ms of which 4 ms to minimize.
[2024-05-22 07:43:25] [INFO ] Deduced a trap composed of 34 places in 220 ms of which 4 ms to minimize.
[2024-05-22 07:43:25] [INFO ] Deduced a trap composed of 34 places in 203 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1100 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:43:25] [INFO ] Deduced a trap composed of 36 places in 257 ms of which 4 ms to minimize.
[2024-05-22 07:43:26] [INFO ] Deduced a trap composed of 35 places in 252 ms of which 4 ms to minimize.
[2024-05-22 07:43:26] [INFO ] Deduced a trap composed of 34 places in 248 ms of which 4 ms to minimize.
[2024-05-22 07:43:26] [INFO ] Deduced a trap composed of 34 places in 230 ms of which 4 ms to minimize.
[2024-05-22 07:43:26] [INFO ] Deduced a trap composed of 39 places in 224 ms of which 4 ms to minimize.
[2024-05-22 07:43:27] [INFO ] Deduced a trap composed of 37 places in 215 ms of which 4 ms to minimize.
[2024-05-22 07:43:27] [INFO ] Deduced a trap composed of 34 places in 203 ms of which 4 ms to minimize.
[2024-05-22 07:43:27] [INFO ] Deduced a trap composed of 34 places in 218 ms of which 4 ms to minimize.
[2024-05-22 07:43:27] [INFO ] Deduced a trap composed of 37 places in 190 ms of which 3 ms to minimize.
[2024-05-22 07:43:27] [INFO ] Deduced a trap composed of 34 places in 190 ms of which 3 ms to minimize.
[2024-05-22 07:43:28] [INFO ] Deduced a trap composed of 34 places in 214 ms of which 4 ms to minimize.
[2024-05-22 07:43:28] [INFO ] Deduced a trap composed of 33 places in 209 ms of which 3 ms to minimize.
[2024-05-22 07:43:28] [INFO ] Deduced a trap composed of 38 places in 197 ms of which 4 ms to minimize.
[2024-05-22 07:43:28] [INFO ] Deduced a trap composed of 34 places in 189 ms of which 4 ms to minimize.
[2024-05-22 07:43:29] [INFO ] Deduced a trap composed of 40 places in 195 ms of which 4 ms to minimize.
[2024-05-22 07:43:29] [INFO ] Deduced a trap composed of 34 places in 181 ms of which 4 ms to minimize.
[2024-05-22 07:43:29] [INFO ] Deduced a trap composed of 34 places in 189 ms of which 4 ms to minimize.
[2024-05-22 07:43:29] [INFO ] Deduced a trap composed of 34 places in 183 ms of which 3 ms to minimize.
[2024-05-22 07:43:29] [INFO ] Deduced a trap composed of 36 places in 192 ms of which 4 ms to minimize.
[2024-05-22 07:43:30] [INFO ] Deduced a trap composed of 33 places in 179 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1100 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:43:30] [INFO ] Deduced a trap composed of 33 places in 231 ms of which 4 ms to minimize.
[2024-05-22 07:43:30] [INFO ] Deduced a trap composed of 33 places in 194 ms of which 4 ms to minimize.
[2024-05-22 07:43:30] [INFO ] Deduced a trap composed of 39 places in 192 ms of which 4 ms to minimize.
[2024-05-22 07:43:30] [INFO ] Deduced a trap composed of 37 places in 200 ms of which 4 ms to minimize.
[2024-05-22 07:43:31] [INFO ] Deduced a trap composed of 35 places in 190 ms of which 3 ms to minimize.
[2024-05-22 07:43:31] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 4 ms to minimize.
[2024-05-22 07:43:31] [INFO ] Deduced a trap composed of 37 places in 216 ms of which 3 ms to minimize.
[2024-05-22 07:43:31] [INFO ] Deduced a trap composed of 36 places in 191 ms of which 3 ms to minimize.
[2024-05-22 07:43:32] [INFO ] Deduced a trap composed of 40 places in 227 ms of which 4 ms to minimize.
[2024-05-22 07:43:32] [INFO ] Deduced a trap composed of 37 places in 236 ms of which 4 ms to minimize.
[2024-05-22 07:43:32] [INFO ] Deduced a trap composed of 33 places in 178 ms of which 4 ms to minimize.
[2024-05-22 07:43:32] [INFO ] Deduced a trap composed of 33 places in 216 ms of which 4 ms to minimize.
[2024-05-22 07:43:32] [INFO ] Deduced a trap composed of 33 places in 206 ms of which 4 ms to minimize.
[2024-05-22 07:43:33] [INFO ] Deduced a trap composed of 33 places in 194 ms of which 3 ms to minimize.
[2024-05-22 07:43:33] [INFO ] Deduced a trap composed of 35 places in 188 ms of which 4 ms to minimize.
[2024-05-22 07:43:33] [INFO ] Deduced a trap composed of 33 places in 173 ms of which 4 ms to minimize.
[2024-05-22 07:43:33] [INFO ] Deduced a trap composed of 33 places in 185 ms of which 7 ms to minimize.
[2024-05-22 07:43:33] [INFO ] Deduced a trap composed of 33 places in 149 ms of which 4 ms to minimize.
[2024-05-22 07:43:34] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 3 ms to minimize.
[2024-05-22 07:43:34] [INFO ] Deduced a trap composed of 33 places in 185 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1100 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:43:34] [INFO ] Deduced a trap composed of 38 places in 239 ms of which 5 ms to minimize.
[2024-05-22 07:43:34] [INFO ] Deduced a trap composed of 36 places in 230 ms of which 4 ms to minimize.
[2024-05-22 07:43:35] [INFO ] Deduced a trap composed of 37 places in 209 ms of which 4 ms to minimize.
[2024-05-22 07:43:35] [INFO ] Deduced a trap composed of 36 places in 219 ms of which 4 ms to minimize.
[2024-05-22 07:43:35] [INFO ] Deduced a trap composed of 33 places in 217 ms of which 4 ms to minimize.
[2024-05-22 07:43:35] [INFO ] Deduced a trap composed of 33 places in 193 ms of which 4 ms to minimize.
[2024-05-22 07:43:35] [INFO ] Deduced a trap composed of 36 places in 180 ms of which 3 ms to minimize.
[2024-05-22 07:43:36] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 3 ms to minimize.
[2024-05-22 07:43:36] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 3 ms to minimize.
[2024-05-22 07:43:36] [INFO ] Deduced a trap composed of 39 places in 203 ms of which 4 ms to minimize.
[2024-05-22 07:43:36] [INFO ] Deduced a trap composed of 33 places in 179 ms of which 3 ms to minimize.
[2024-05-22 07:43:36] [INFO ] Deduced a trap composed of 37 places in 172 ms of which 3 ms to minimize.
[2024-05-22 07:43:37] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 3 ms to minimize.
[2024-05-22 07:43:37] [INFO ] Deduced a trap composed of 33 places in 158 ms of which 4 ms to minimize.
[2024-05-22 07:43:37] [INFO ] Deduced a trap composed of 36 places in 147 ms of which 3 ms to minimize.
[2024-05-22 07:43:37] [INFO ] Deduced a trap composed of 36 places in 152 ms of which 3 ms to minimize.
[2024-05-22 07:43:37] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 3 ms to minimize.
[2024-05-22 07:43:37] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 3 ms to minimize.
[2024-05-22 07:43:38] [INFO ] Deduced a trap composed of 36 places in 149 ms of which 3 ms to minimize.
[2024-05-22 07:43:38] [INFO ] Deduced a trap composed of 33 places in 153 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1100 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:43:38] [INFO ] Deduced a trap composed of 38 places in 220 ms of which 4 ms to minimize.
[2024-05-22 07:43:38] [INFO ] Deduced a trap composed of 38 places in 225 ms of which 4 ms to minimize.
[2024-05-22 07:43:39] [INFO ] Deduced a trap composed of 36 places in 224 ms of which 5 ms to minimize.
[2024-05-22 07:43:39] [INFO ] Deduced a trap composed of 40 places in 246 ms of which 5 ms to minimize.
[2024-05-22 07:43:39] [INFO ] Deduced a trap composed of 33 places in 211 ms of which 4 ms to minimize.
[2024-05-22 07:43:39] [INFO ] Deduced a trap composed of 33 places in 197 ms of which 4 ms to minimize.
[2024-05-22 07:43:39] [INFO ] Deduced a trap composed of 36 places in 202 ms of which 3 ms to minimize.
[2024-05-22 07:43:40] [INFO ] Deduced a trap composed of 36 places in 201 ms of which 4 ms to minimize.
[2024-05-22 07:43:40] [INFO ] Deduced a trap composed of 33 places in 186 ms of which 3 ms to minimize.
[2024-05-22 07:43:40] [INFO ] Deduced a trap composed of 33 places in 188 ms of which 4 ms to minimize.
[2024-05-22 07:43:40] [INFO ] Deduced a trap composed of 33 places in 184 ms of which 3 ms to minimize.
[2024-05-22 07:43:40] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 3 ms to minimize.
[2024-05-22 07:43:41] [INFO ] Deduced a trap composed of 33 places in 163 ms of which 4 ms to minimize.
[2024-05-22 07:43:41] [INFO ] Deduced a trap composed of 33 places in 164 ms of which 3 ms to minimize.
[2024-05-22 07:43:41] [INFO ] Deduced a trap composed of 33 places in 202 ms of which 3 ms to minimize.
[2024-05-22 07:43:41] [INFO ] Deduced a trap composed of 39 places in 185 ms of which 3 ms to minimize.
[2024-05-22 07:43:41] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 3 ms to minimize.
[2024-05-22 07:43:42] [INFO ] Deduced a trap composed of 37 places in 187 ms of which 4 ms to minimize.
[2024-05-22 07:43:42] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 3 ms to minimize.
[2024-05-22 07:43:42] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1100 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:43:42] [INFO ] Deduced a trap composed of 37 places in 190 ms of which 4 ms to minimize.
[2024-05-22 07:43:42] [INFO ] Deduced a trap composed of 33 places in 175 ms of which 4 ms to minimize.
[2024-05-22 07:43:43] [INFO ] Deduced a trap composed of 33 places in 191 ms of which 3 ms to minimize.
[2024-05-22 07:43:43] [INFO ] Deduced a trap composed of 36 places in 206 ms of which 4 ms to minimize.
[2024-05-22 07:43:43] [INFO ] Deduced a trap composed of 37 places in 201 ms of which 4 ms to minimize.
[2024-05-22 07:43:43] [INFO ] Deduced a trap composed of 33 places in 186 ms of which 4 ms to minimize.
[2024-05-22 07:43:44] [INFO ] Deduced a trap composed of 36 places in 169 ms of which 3 ms to minimize.
[2024-05-22 07:43:44] [INFO ] Deduced a trap composed of 36 places in 190 ms of which 4 ms to minimize.
[2024-05-22 07:43:44] [INFO ] Deduced a trap composed of 36 places in 165 ms of which 3 ms to minimize.
[2024-05-22 07:43:44] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 3 ms to minimize.
[2024-05-22 07:43:44] [INFO ] Deduced a trap composed of 36 places in 165 ms of which 4 ms to minimize.
[2024-05-22 07:43:44] [INFO ] Deduced a trap composed of 34 places in 178 ms of which 3 ms to minimize.
[2024-05-22 07:43:45] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 3 ms to minimize.
[2024-05-22 07:43:45] [INFO ] Deduced a trap composed of 33 places in 164 ms of which 4 ms to minimize.
[2024-05-22 07:43:45] [INFO ] Deduced a trap composed of 33 places in 150 ms of which 3 ms to minimize.
[2024-05-22 07:43:45] [INFO ] Deduced a trap composed of 36 places in 154 ms of which 4 ms to minimize.
[2024-05-22 07:43:45] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 3 ms to minimize.
[2024-05-22 07:43:46] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 3 ms to minimize.
[2024-05-22 07:43:46] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 3 ms to minimize.
[2024-05-22 07:43:46] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1100 variables, 20/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:43:46] [INFO ] Deduced a trap composed of 37 places in 185 ms of which 3 ms to minimize.
[2024-05-22 07:43:46] [INFO ] Deduced a trap composed of 33 places in 185 ms of which 4 ms to minimize.
[2024-05-22 07:43:46] [INFO ] Deduced a trap composed of 33 places in 168 ms of which 3 ms to minimize.
[2024-05-22 07:43:47] [INFO ] Deduced a trap composed of 36 places in 166 ms of which 4 ms to minimize.
[2024-05-22 07:43:47] [INFO ] Deduced a trap composed of 33 places in 169 ms of which 4 ms to minimize.
[2024-05-22 07:43:47] [INFO ] Deduced a trap composed of 33 places in 161 ms of which 3 ms to minimize.
[2024-05-22 07:43:47] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 3 ms to minimize.
[2024-05-22 07:43:47] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 3 ms to minimize.
[2024-05-22 07:43:47] [INFO ] Deduced a trap composed of 36 places in 159 ms of which 3 ms to minimize.
[2024-05-22 07:43:48] [INFO ] Deduced a trap composed of 36 places in 141 ms of which 3 ms to minimize.
[2024-05-22 07:43:48] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 2 ms to minimize.
[2024-05-22 07:43:48] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 3 ms to minimize.
[2024-05-22 07:43:48] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 3 ms to minimize.
[2024-05-22 07:43:48] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 3 ms to minimize.
[2024-05-22 07:43:48] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 3 ms to minimize.
[2024-05-22 07:43:48] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 2 ms to minimize.
[2024-05-22 07:43:49] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 2 ms to minimize.
[2024-05-22 07:43:49] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 2 ms to minimize.
[2024-05-22 07:43:49] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 2 ms to minimize.
[2024-05-22 07:43:49] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1100 variables, 20/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:43:49] [INFO ] Deduced a trap composed of 33 places in 137 ms of which 3 ms to minimize.
[2024-05-22 07:43:49] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 2 ms to minimize.
[2024-05-22 07:43:49] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 2 ms to minimize.
[2024-05-22 07:43:50] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 3 ms to minimize.
[2024-05-22 07:43:50] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 2 ms to minimize.
[2024-05-22 07:43:50] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 2 ms to minimize.
[2024-05-22 07:43:50] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 2 ms to minimize.
[2024-05-22 07:43:50] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 2 ms to minimize.
[2024-05-22 07:43:50] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 2 ms to minimize.
[2024-05-22 07:43:50] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 2 ms to minimize.
[2024-05-22 07:43:50] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 2 ms to minimize.
[2024-05-22 07:43:50] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 2 ms to minimize.
[2024-05-22 07:43:51] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 2 ms to minimize.
[2024-05-22 07:43:51] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 1 ms to minimize.
[2024-05-22 07:43:51] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 2 ms to minimize.
[2024-05-22 07:43:51] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 2 ms to minimize.
[2024-05-22 07:43:51] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
[2024-05-22 07:43:51] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 2 ms to minimize.
[2024-05-22 07:43:51] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 3 ms to minimize.
[2024-05-22 07:43:51] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1100 variables, 20/196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:43:52] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 3 ms to minimize.
[2024-05-22 07:43:52] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 2 ms to minimize.
[2024-05-22 07:43:52] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 3 ms to minimize.
[2024-05-22 07:43:52] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 3 ms to minimize.
[2024-05-22 07:43:52] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 2 ms to minimize.
[2024-05-22 07:43:52] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 2 ms to minimize.
[2024-05-22 07:43:52] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 2 ms to minimize.
[2024-05-22 07:43:52] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 2 ms to minimize.
[2024-05-22 07:43:52] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 2 ms to minimize.
[2024-05-22 07:43:53] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 2 ms to minimize.
[2024-05-22 07:43:53] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 2 ms to minimize.
[2024-05-22 07:43:53] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 2 ms to minimize.
[2024-05-22 07:43:53] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 2 ms to minimize.
[2024-05-22 07:43:53] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 3 ms to minimize.
[2024-05-22 07:43:53] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 2 ms to minimize.
[2024-05-22 07:43:53] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 3 ms to minimize.
[2024-05-22 07:43:54] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 2 ms to minimize.
[2024-05-22 07:43:54] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1100 variables, 18/214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:43:54] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1100 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1100 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 25/1125 variables, 25/240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:43:54] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 3 ms to minimize.
[2024-05-22 07:43:54] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 3 ms to minimize.
[2024-05-22 07:43:55] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 3 ms to minimize.
[2024-05-22 07:43:55] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 3 ms to minimize.
[2024-05-22 07:43:55] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 3 ms to minimize.
[2024-05-22 07:43:55] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 3 ms to minimize.
[2024-05-22 07:43:55] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 3 ms to minimize.
[2024-05-22 07:43:55] [INFO ] Deduced a trap composed of 36 places in 137 ms of which 3 ms to minimize.
[2024-05-22 07:43:55] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1125 variables, 9/249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:43:56] [INFO ] Deduced a trap composed of 38 places in 147 ms of which 3 ms to minimize.
[2024-05-22 07:43:56] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 3 ms to minimize.
[2024-05-22 07:43:56] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1125 variables, 3/252 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:43:56] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 3 ms to minimize.
[2024-05-22 07:43:56] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 3 ms to minimize.
[2024-05-22 07:43:56] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 2 ms to minimize.
[2024-05-22 07:43:57] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 3 ms to minimize.
[2024-05-22 07:43:57] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 3 ms to minimize.
[2024-05-22 07:43:57] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 3 ms to minimize.
[2024-05-22 07:43:57] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 3 ms to minimize.
[2024-05-22 07:43:57] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1125 variables, 8/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:43:57] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 2 ms to minimize.
[2024-05-22 07:43:58] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 3 ms to minimize.
[2024-05-22 07:43:58] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1125 variables, 3/263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:43:58] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1125 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:43:58] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1125 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1125 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 2006/3131 variables, 1125/1390 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3131 variables, 1811/3201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3131 variables, 3/3204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3131 variables, 0/3204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 1/3132 variables, 1/3205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3132 variables, 0/3205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 0/3132 variables, 0/3205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3132/3132 variables, and 3205 constraints, problems are : Problem set: 0 solved, 3 unsolved in 41338 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 1126/1126 constraints, ReadFeed: 1811/1811 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 204/204 constraints]
After SMT, in 42671ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA CANConstruction-PT-030-ReachabilityCardinality-2024-06 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 461 ms.
Support contains 55 out of 1126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1126/1126 places, 2006/2006 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1126 transition count 2002
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 1122 transition count 2002
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 1121 transition count 2000
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 1121 transition count 2000
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 46 place count 1103 transition count 1982
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 1102 transition count 1982
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 1102 transition count 1981
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 1101 transition count 1981
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 1101 transition count 1981
Applied a total of 51 rules in 404 ms. Remains 1101 /1126 variables (removed 25) and now considering 1981/2006 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 404 ms. Remains : 1101/1126 places, 1981/2006 transitions.
RANDOM walk for 40000 steps (186 resets) in 585 ms. (68 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 192831 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :0 out of 2
Probabilistic random walk after 192831 steps, saw 65868 distinct states, run finished after 3007 ms. (steps per millisecond=64 ) properties seen :0
// Phase 1: matrix 1981 rows 1101 cols
[2024-05-22 07:44:05] [INFO ] Computed 61 invariants in 6 ms
[2024-05-22 07:44:05] [INFO ] State equation strengthened by 1831 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1013/1068 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1068 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1068 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 5/1073 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1073 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 27/1100 variables, 27/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1100 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1981/3081 variables, 1100/1161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3081 variables, 1831/2992 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3081 variables, 0/2992 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/3082 variables, 1/2993 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3082 variables, 0/2993 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/3082 variables, 0/2993 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3082/3082 variables, and 2993 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1081 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 1101/1101 constraints, ReadFeed: 1831/1831 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1013/1068 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1068 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 07:44:07] [INFO ] Deduced a trap composed of 3 places in 442 ms of which 5 ms to minimize.
[2024-05-22 07:44:07] [INFO ] Deduced a trap composed of 35 places in 267 ms of which 4 ms to minimize.
[2024-05-22 07:44:07] [INFO ] Deduced a trap composed of 40 places in 250 ms of which 4 ms to minimize.
[2024-05-22 07:44:07] [INFO ] Deduced a trap composed of 36 places in 293 ms of which 4 ms to minimize.
[2024-05-22 07:44:08] [INFO ] Deduced a trap composed of 42 places in 248 ms of which 4 ms to minimize.
[2024-05-22 07:44:08] [INFO ] Deduced a trap composed of 43 places in 241 ms of which 4 ms to minimize.
[2024-05-22 07:44:08] [INFO ] Deduced a trap composed of 41 places in 218 ms of which 4 ms to minimize.
[2024-05-22 07:44:08] [INFO ] Deduced a trap composed of 35 places in 239 ms of which 4 ms to minimize.
[2024-05-22 07:44:09] [INFO ] Deduced a trap composed of 33 places in 232 ms of which 4 ms to minimize.
[2024-05-22 07:44:09] [INFO ] Deduced a trap composed of 36 places in 239 ms of which 4 ms to minimize.
[2024-05-22 07:44:09] [INFO ] Deduced a trap composed of 33 places in 236 ms of which 5 ms to minimize.
[2024-05-22 07:44:09] [INFO ] Deduced a trap composed of 42 places in 225 ms of which 4 ms to minimize.
[2024-05-22 07:44:10] [INFO ] Deduced a trap composed of 33 places in 232 ms of which 4 ms to minimize.
[2024-05-22 07:44:10] [INFO ] Deduced a trap composed of 33 places in 231 ms of which 4 ms to minimize.
[2024-05-22 07:44:10] [INFO ] Deduced a trap composed of 33 places in 223 ms of which 4 ms to minimize.
[2024-05-22 07:44:10] [INFO ] Deduced a trap composed of 36 places in 216 ms of which 4 ms to minimize.
[2024-05-22 07:44:11] [INFO ] Deduced a trap composed of 33 places in 220 ms of which 4 ms to minimize.
[2024-05-22 07:44:11] [INFO ] Deduced a trap composed of 38 places in 209 ms of which 4 ms to minimize.
[2024-05-22 07:44:11] [INFO ] Deduced a trap composed of 43 places in 230 ms of which 4 ms to minimize.
[2024-05-22 07:44:11] [INFO ] Deduced a trap composed of 35 places in 217 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1068 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 07:44:12] [INFO ] Deduced a trap composed of 33 places in 220 ms of which 3 ms to minimize.
[2024-05-22 07:44:12] [INFO ] Deduced a trap composed of 39 places in 215 ms of which 4 ms to minimize.
[2024-05-22 07:44:12] [INFO ] Deduced a trap composed of 38 places in 205 ms of which 4 ms to minimize.
[2024-05-22 07:44:12] [INFO ] Deduced a trap composed of 39 places in 185 ms of which 3 ms to minimize.
[2024-05-22 07:44:12] [INFO ] Deduced a trap composed of 38 places in 201 ms of which 4 ms to minimize.
[2024-05-22 07:44:13] [INFO ] Deduced a trap composed of 36 places in 207 ms of which 4 ms to minimize.
[2024-05-22 07:44:13] [INFO ] Deduced a trap composed of 38 places in 183 ms of which 3 ms to minimize.
[2024-05-22 07:44:13] [INFO ] Deduced a trap composed of 40 places in 192 ms of which 4 ms to minimize.
[2024-05-22 07:44:13] [INFO ] Deduced a trap composed of 36 places in 181 ms of which 4 ms to minimize.
[2024-05-22 07:44:13] [INFO ] Deduced a trap composed of 44 places in 211 ms of which 3 ms to minimize.
[2024-05-22 07:44:14] [INFO ] Deduced a trap composed of 36 places in 191 ms of which 4 ms to minimize.
[2024-05-22 07:44:14] [INFO ] Deduced a trap composed of 36 places in 183 ms of which 4 ms to minimize.
[2024-05-22 07:44:14] [INFO ] Deduced a trap composed of 40 places in 210 ms of which 4 ms to minimize.
[2024-05-22 07:44:14] [INFO ] Deduced a trap composed of 36 places in 188 ms of which 3 ms to minimize.
[2024-05-22 07:44:15] [INFO ] Deduced a trap composed of 38 places in 190 ms of which 4 ms to minimize.
[2024-05-22 07:44:15] [INFO ] Deduced a trap composed of 35 places in 159 ms of which 3 ms to minimize.
[2024-05-22 07:44:15] [INFO ] Deduced a trap composed of 35 places in 172 ms of which 3 ms to minimize.
[2024-05-22 07:44:15] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 3 ms to minimize.
[2024-05-22 07:44:15] [INFO ] Deduced a trap composed of 38 places in 142 ms of which 3 ms to minimize.
[2024-05-22 07:44:15] [INFO ] Deduced a trap composed of 36 places in 165 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1068 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 07:44:16] [INFO ] Deduced a trap composed of 41 places in 188 ms of which 3 ms to minimize.
[2024-05-22 07:44:16] [INFO ] Deduced a trap composed of 41 places in 204 ms of which 4 ms to minimize.
[2024-05-22 07:44:16] [INFO ] Deduced a trap composed of 38 places in 195 ms of which 3 ms to minimize.
[2024-05-22 07:44:16] [INFO ] Deduced a trap composed of 36 places in 185 ms of which 4 ms to minimize.
[2024-05-22 07:44:16] [INFO ] Deduced a trap composed of 38 places in 179 ms of which 3 ms to minimize.
[2024-05-22 07:44:17] [INFO ] Deduced a trap composed of 33 places in 174 ms of which 4 ms to minimize.
[2024-05-22 07:44:17] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 3 ms to minimize.
[2024-05-22 07:44:17] [INFO ] Deduced a trap composed of 38 places in 174 ms of which 3 ms to minimize.
[2024-05-22 07:44:17] [INFO ] Deduced a trap composed of 36 places in 160 ms of which 3 ms to minimize.
[2024-05-22 07:44:17] [INFO ] Deduced a trap composed of 36 places in 152 ms of which 3 ms to minimize.
[2024-05-22 07:44:18] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 3 ms to minimize.
[2024-05-22 07:44:18] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 3 ms to minimize.
[2024-05-22 07:44:18] [INFO ] Deduced a trap composed of 33 places in 152 ms of which 3 ms to minimize.
[2024-05-22 07:44:18] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 3 ms to minimize.
[2024-05-22 07:44:18] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 3 ms to minimize.
[2024-05-22 07:44:18] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 3 ms to minimize.
[2024-05-22 07:44:19] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 2 ms to minimize.
[2024-05-22 07:44:19] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 2 ms to minimize.
[2024-05-22 07:44:19] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 3 ms to minimize.
[2024-05-22 07:44:19] [INFO ] Deduced a trap composed of 2 places in 417 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1068 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 07:44:19] [INFO ] Deduced a trap composed of 35 places in 140 ms of which 3 ms to minimize.
[2024-05-22 07:44:20] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 3 ms to minimize.
[2024-05-22 07:44:20] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 2 ms to minimize.
[2024-05-22 07:44:20] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 2 ms to minimize.
[2024-05-22 07:44:20] [INFO ] Deduced a trap composed of 2 places in 397 ms of which 5 ms to minimize.
[2024-05-22 07:44:20] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 3 ms to minimize.
[2024-05-22 07:44:20] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 2 ms to minimize.
[2024-05-22 07:44:21] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 2 ms to minimize.
[2024-05-22 07:44:21] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 3 ms to minimize.
[2024-05-22 07:44:21] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 2 ms to minimize.
[2024-05-22 07:44:21] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 2 ms to minimize.
[2024-05-22 07:44:21] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 2 ms to minimize.
[2024-05-22 07:44:21] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 2 ms to minimize.
[2024-05-22 07:44:21] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 2 ms to minimize.
[2024-05-22 07:44:21] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 2 ms to minimize.
[2024-05-22 07:44:21] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 2 ms to minimize.
[2024-05-22 07:44:22] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 1 ms to minimize.
[2024-05-22 07:44:22] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 2 ms to minimize.
[2024-05-22 07:44:22] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 3 ms to minimize.
[2024-05-22 07:44:22] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1068 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 07:44:22] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 2 ms to minimize.
[2024-05-22 07:44:22] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 3 ms to minimize.
[2024-05-22 07:44:22] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 2 ms to minimize.
[2024-05-22 07:44:22] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 3 ms to minimize.
[2024-05-22 07:44:23] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 3 ms to minimize.
[2024-05-22 07:44:23] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 3 ms to minimize.
[2024-05-22 07:44:23] [INFO ] Deduced a trap composed of 33 places in 149 ms of which 3 ms to minimize.
[2024-05-22 07:44:23] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 3 ms to minimize.
[2024-05-22 07:44:23] [INFO ] Deduced a trap composed of 33 places in 111 ms of which 2 ms to minimize.
[2024-05-22 07:44:23] [INFO ] Deduced a trap composed of 35 places in 157 ms of which 3 ms to minimize.
[2024-05-22 07:44:24] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 3 ms to minimize.
[2024-05-22 07:44:24] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 2 ms to minimize.
[2024-05-22 07:44:24] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 2 ms to minimize.
[2024-05-22 07:44:24] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 3 ms to minimize.
[2024-05-22 07:44:24] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 3 ms to minimize.
[2024-05-22 07:44:24] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 2 ms to minimize.
[2024-05-22 07:44:24] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 2 ms to minimize.
[2024-05-22 07:44:24] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 2 ms to minimize.
[2024-05-22 07:44:25] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1068 variables, 19/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 07:44:25] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 3 ms to minimize.
[2024-05-22 07:44:25] [INFO ] Deduced a trap composed of 35 places in 133 ms of which 3 ms to minimize.
[2024-05-22 07:44:25] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 3 ms to minimize.
[2024-05-22 07:44:25] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 3 ms to minimize.
[2024-05-22 07:44:25] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1068 variables, 5/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1068 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/1073 variables, 5/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 07:44:26] [INFO ] Deduced a trap composed of 36 places in 227 ms of which 5 ms to minimize.
[2024-05-22 07:44:26] [INFO ] Deduced a trap composed of 38 places in 210 ms of which 4 ms to minimize.
[2024-05-22 07:44:26] [INFO ] Deduced a trap composed of 33 places in 201 ms of which 4 ms to minimize.
[2024-05-22 07:44:26] [INFO ] Deduced a trap composed of 34 places in 190 ms of which 4 ms to minimize.
[2024-05-22 07:44:26] [INFO ] Deduced a trap composed of 34 places in 193 ms of which 4 ms to minimize.
[2024-05-22 07:44:27] [INFO ] Deduced a trap composed of 34 places in 212 ms of which 19 ms to minimize.
[2024-05-22 07:44:27] [INFO ] Deduced a trap composed of 34 places in 196 ms of which 4 ms to minimize.
[2024-05-22 07:44:27] [INFO ] Deduced a trap composed of 33 places in 183 ms of which 3 ms to minimize.
[2024-05-22 07:44:27] [INFO ] Deduced a trap composed of 37 places in 177 ms of which 4 ms to minimize.
[2024-05-22 07:44:27] [INFO ] Deduced a trap composed of 38 places in 177 ms of which 3 ms to minimize.
[2024-05-22 07:44:28] [INFO ] Deduced a trap composed of 34 places in 218 ms of which 4 ms to minimize.
[2024-05-22 07:44:28] [INFO ] Deduced a trap composed of 34 places in 203 ms of which 4 ms to minimize.
[2024-05-22 07:44:28] [INFO ] Deduced a trap composed of 34 places in 210 ms of which 4 ms to minimize.
[2024-05-22 07:44:28] [INFO ] Deduced a trap composed of 33 places in 198 ms of which 4 ms to minimize.
[2024-05-22 07:44:29] [INFO ] Deduced a trap composed of 33 places in 197 ms of which 4 ms to minimize.
[2024-05-22 07:44:29] [INFO ] Deduced a trap composed of 33 places in 202 ms of which 4 ms to minimize.
[2024-05-22 07:44:29] [INFO ] Deduced a trap composed of 33 places in 192 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1073 variables, 17/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1073 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 27/1100 variables, 27/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 07:44:29] [INFO ] Deduced a trap composed of 38 places in 172 ms of which 4 ms to minimize.
[2024-05-22 07:44:30] [INFO ] Deduced a trap composed of 39 places in 176 ms of which 4 ms to minimize.
[2024-05-22 07:44:30] [INFO ] Deduced a trap composed of 33 places in 184 ms of which 4 ms to minimize.
[2024-05-22 07:44:30] [INFO ] Deduced a trap composed of 33 places in 176 ms of which 4 ms to minimize.
[2024-05-22 07:44:30] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 4 ms to minimize.
[2024-05-22 07:44:30] [INFO ] Deduced a trap composed of 38 places in 142 ms of which 3 ms to minimize.
[2024-05-22 07:44:30] [INFO ] Deduced a trap composed of 38 places in 153 ms of which 3 ms to minimize.
[2024-05-22 07:44:31] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 3 ms to minimize.
[2024-05-22 07:44:31] [INFO ] Deduced a trap composed of 38 places in 147 ms of which 3 ms to minimize.
[2024-05-22 07:44:31] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 3 ms to minimize.
[2024-05-22 07:44:31] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 3 ms to minimize.
[2024-05-22 07:44:31] [INFO ] Deduced a trap composed of 36 places in 206 ms of which 4 ms to minimize.
[2024-05-22 07:44:31] [INFO ] Deduced a trap composed of 38 places in 192 ms of which 4 ms to minimize.
[2024-05-22 07:44:32] [INFO ] Deduced a trap composed of 36 places in 196 ms of which 4 ms to minimize.
[2024-05-22 07:44:32] [INFO ] Deduced a trap composed of 36 places in 190 ms of which 3 ms to minimize.
[2024-05-22 07:44:32] [INFO ] Deduced a trap composed of 36 places in 194 ms of which 3 ms to minimize.
[2024-05-22 07:44:32] [INFO ] Deduced a trap composed of 36 places in 180 ms of which 3 ms to minimize.
[2024-05-22 07:44:33] [INFO ] Deduced a trap composed of 36 places in 182 ms of which 4 ms to minimize.
[2024-05-22 07:44:33] [INFO ] Deduced a trap composed of 36 places in 186 ms of which 4 ms to minimize.
[2024-05-22 07:44:33] [INFO ] Deduced a trap composed of 36 places in 184 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1100 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 07:44:33] [INFO ] Deduced a trap composed of 38 places in 188 ms of which 4 ms to minimize.
[2024-05-22 07:44:33] [INFO ] Deduced a trap composed of 36 places in 159 ms of which 3 ms to minimize.
[2024-05-22 07:44:33] [INFO ] Deduced a trap composed of 33 places in 152 ms of which 3 ms to minimize.
[2024-05-22 07:44:34] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 3 ms to minimize.
[2024-05-22 07:44:34] [INFO ] Deduced a trap composed of 33 places in 208 ms of which 4 ms to minimize.
[2024-05-22 07:44:34] [INFO ] Deduced a trap composed of 33 places in 172 ms of which 4 ms to minimize.
[2024-05-22 07:44:34] [INFO ] Deduced a trap composed of 33 places in 181 ms of which 4 ms to minimize.
[2024-05-22 07:44:34] [INFO ] Deduced a trap composed of 33 places in 175 ms of which 4 ms to minimize.
[2024-05-22 07:44:35] [INFO ] Deduced a trap composed of 33 places in 172 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1100 variables, 9/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 07:44:35] [INFO ] Deduced a trap composed of 33 places in 171 ms of which 4 ms to minimize.
[2024-05-22 07:44:35] [INFO ] Deduced a trap composed of 33 places in 175 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1100 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1100 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1981/3081 variables, 1100/1313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3081 variables, 1831/3144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3081 variables, 2/3146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3081 variables, 0/3146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 1/3082 variables, 1/3147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3082 variables, 0/3147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/3082 variables, 0/3147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3082/3082 variables, and 3147 constraints, problems are : Problem set: 0 solved, 2 unsolved in 30717 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 1101/1101 constraints, ReadFeed: 1831/1831 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 152/152 constraints]
After SMT, in 31842ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA CANConstruction-PT-030-ReachabilityCardinality-2024-14 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 75 ms.
Support contains 33 out of 1101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1101/1101 places, 1981/1981 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 26 place count 1088 transition count 1968
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 27 place count 1088 transition count 1967
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 28 place count 1087 transition count 1967
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 1087 transition count 1967
Applied a total of 29 rules in 181 ms. Remains 1087 /1101 variables (removed 14) and now considering 1967/1981 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 1087/1101 places, 1967/1981 transitions.
RANDOM walk for 40000 steps (189 resets) in 692 ms. (57 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 225069 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 1
Probabilistic random walk after 225069 steps, saw 59948 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
// Phase 1: matrix 1967 rows 1087 cols
[2024-05-22 07:44:40] [INFO ] Computed 61 invariants in 13 ms
[2024-05-22 07:44:40] [INFO ] State equation strengthened by 1846 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1015/1048 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1048 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1048 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/1057 variables, 9/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1057 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 29/1086 variables, 29/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1086 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1967/3053 variables, 1086/1147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3053 variables, 1846/2993 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3053 variables, 0/2993 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/3054 variables, 1/2994 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3054 variables, 0/2994 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/3054 variables, 0/2994 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3054/3054 variables, and 2994 constraints, problems are : Problem set: 0 solved, 1 unsolved in 767 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 1087/1087 constraints, ReadFeed: 1846/1846 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/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1015/1048 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1048 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:44:41] [INFO ] Deduced a trap composed of 2 places in 401 ms of which 6 ms to minimize.
[2024-05-22 07:44:42] [INFO ] Deduced a trap composed of 33 places in 160 ms of which 3 ms to minimize.
[2024-05-22 07:44:42] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 3 ms to minimize.
[2024-05-22 07:44:42] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 3 ms to minimize.
[2024-05-22 07:44:42] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 2 ms to minimize.
[2024-05-22 07:44:42] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 2 ms to minimize.
[2024-05-22 07:44:42] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 3 ms to minimize.
[2024-05-22 07:44:42] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 2 ms to minimize.
[2024-05-22 07:44:43] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 2 ms to minimize.
[2024-05-22 07:44:43] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 2 ms to minimize.
[2024-05-22 07:44:43] [INFO ] Deduced a trap composed of 38 places in 159 ms of which 2 ms to minimize.
[2024-05-22 07:44:43] [INFO ] Deduced a trap composed of 36 places in 135 ms of which 3 ms to minimize.
[2024-05-22 07:44:43] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 2 ms to minimize.
[2024-05-22 07:44:43] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 2 ms to minimize.
[2024-05-22 07:44:43] [INFO ] Deduced a trap composed of 36 places in 135 ms of which 3 ms to minimize.
[2024-05-22 07:44:44] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 3 ms to minimize.
[2024-05-22 07:44:44] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 3 ms to minimize.
[2024-05-22 07:44:44] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 2 ms to minimize.
[2024-05-22 07:44:44] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 3 ms to minimize.
[2024-05-22 07:44:44] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1048 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:44:44] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 2 ms to minimize.
[2024-05-22 07:44:44] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2024-05-22 07:44:44] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1048 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1048 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/1057 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:44:45] [INFO ] Deduced a trap composed of 38 places in 282 ms of which 5 ms to minimize.
[2024-05-22 07:44:45] [INFO ] Deduced a trap composed of 38 places in 283 ms of which 5 ms to minimize.
[2024-05-22 07:44:45] [INFO ] Deduced a trap composed of 35 places in 282 ms of which 4 ms to minimize.
[2024-05-22 07:44:46] [INFO ] Deduced a trap composed of 37 places in 269 ms of which 5 ms to minimize.
[2024-05-22 07:44:46] [INFO ] Deduced a trap composed of 35 places in 247 ms of which 5 ms to minimize.
[2024-05-22 07:44:46] [INFO ] Deduced a trap composed of 35 places in 251 ms of which 4 ms to minimize.
[2024-05-22 07:44:46] [INFO ] Deduced a trap composed of 38 places in 252 ms of which 5 ms to minimize.
[2024-05-22 07:44:47] [INFO ] Deduced a trap composed of 33 places in 246 ms of which 4 ms to minimize.
[2024-05-22 07:44:47] [INFO ] Deduced a trap composed of 33 places in 232 ms of which 4 ms to minimize.
[2024-05-22 07:44:47] [INFO ] Deduced a trap composed of 35 places in 217 ms of which 4 ms to minimize.
[2024-05-22 07:44:47] [INFO ] Deduced a trap composed of 35 places in 221 ms of which 4 ms to minimize.
[2024-05-22 07:44:48] [INFO ] Deduced a trap composed of 35 places in 226 ms of which 4 ms to minimize.
[2024-05-22 07:44:48] [INFO ] Deduced a trap composed of 33 places in 230 ms of which 4 ms to minimize.
[2024-05-22 07:44:48] [INFO ] Deduced a trap composed of 33 places in 214 ms of which 4 ms to minimize.
[2024-05-22 07:44:48] [INFO ] Deduced a trap composed of 36 places in 208 ms of which 4 ms to minimize.
[2024-05-22 07:44:48] [INFO ] Deduced a trap composed of 33 places in 203 ms of which 4 ms to minimize.
[2024-05-22 07:44:49] [INFO ] Deduced a trap composed of 33 places in 206 ms of which 4 ms to minimize.
[2024-05-22 07:44:49] [INFO ] Deduced a trap composed of 39 places in 209 ms of which 4 ms to minimize.
[2024-05-22 07:44:49] [INFO ] Deduced a trap composed of 39 places in 207 ms of which 4 ms to minimize.
[2024-05-22 07:44:49] [INFO ] Deduced a trap composed of 33 places in 197 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1057 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:44:50] [INFO ] Deduced a trap composed of 33 places in 195 ms of which 4 ms to minimize.
[2024-05-22 07:44:50] [INFO ] Deduced a trap composed of 33 places in 205 ms of which 4 ms to minimize.
[2024-05-22 07:44:50] [INFO ] Deduced a trap composed of 33 places in 184 ms of which 3 ms to minimize.
[2024-05-22 07:44:50] [INFO ] Deduced a trap composed of 33 places in 213 ms of which 5 ms to minimize.
[2024-05-22 07:44:50] [INFO ] Deduced a trap composed of 33 places in 211 ms of which 4 ms to minimize.
[2024-05-22 07:44:51] [INFO ] Deduced a trap composed of 33 places in 205 ms of which 4 ms to minimize.
[2024-05-22 07:44:51] [INFO ] Deduced a trap composed of 33 places in 204 ms of which 4 ms to minimize.
[2024-05-22 07:44:51] [INFO ] Deduced a trap composed of 33 places in 194 ms of which 4 ms to minimize.
[2024-05-22 07:44:51] [INFO ] Deduced a trap composed of 33 places in 189 ms of which 3 ms to minimize.
[2024-05-22 07:44:52] [INFO ] Deduced a trap composed of 35 places in 212 ms of which 4 ms to minimize.
[2024-05-22 07:44:52] [INFO ] Deduced a trap composed of 38 places in 207 ms of which 4 ms to minimize.
[2024-05-22 07:44:52] [INFO ] Deduced a trap composed of 33 places in 186 ms of which 3 ms to minimize.
[2024-05-22 07:44:52] [INFO ] Deduced a trap composed of 33 places in 216 ms of which 4 ms to minimize.
[2024-05-22 07:44:52] [INFO ] Deduced a trap composed of 33 places in 196 ms of which 4 ms to minimize.
[2024-05-22 07:44:53] [INFO ] Deduced a trap composed of 33 places in 196 ms of which 3 ms to minimize.
[2024-05-22 07:44:53] [INFO ] Deduced a trap composed of 33 places in 211 ms of which 4 ms to minimize.
[2024-05-22 07:44:53] [INFO ] Deduced a trap composed of 37 places in 186 ms of which 4 ms to minimize.
[2024-05-22 07:44:53] [INFO ] Deduced a trap composed of 35 places in 190 ms of which 3 ms to minimize.
[2024-05-22 07:44:53] [INFO ] Deduced a trap composed of 34 places in 187 ms of which 4 ms to minimize.
[2024-05-22 07:44:54] [INFO ] Deduced a trap composed of 36 places in 186 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1057 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:44:54] [INFO ] Deduced a trap composed of 36 places in 171 ms of which 4 ms to minimize.
[2024-05-22 07:44:54] [INFO ] Deduced a trap composed of 36 places in 171 ms of which 3 ms to minimize.
[2024-05-22 07:44:54] [INFO ] Deduced a trap composed of 36 places in 193 ms of which 4 ms to minimize.
[2024-05-22 07:44:54] [INFO ] Deduced a trap composed of 34 places in 175 ms of which 3 ms to minimize.
[2024-05-22 07:44:55] [INFO ] Deduced a trap composed of 34 places in 180 ms of which 4 ms to minimize.
[2024-05-22 07:44:55] [INFO ] Deduced a trap composed of 33 places in 186 ms of which 4 ms to minimize.
[2024-05-22 07:44:55] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 3 ms to minimize.
[2024-05-22 07:44:55] [INFO ] Deduced a trap composed of 33 places in 161 ms of which 3 ms to minimize.
[2024-05-22 07:44:55] [INFO ] Deduced a trap composed of 35 places in 167 ms of which 3 ms to minimize.
[2024-05-22 07:44:56] [INFO ] Deduced a trap composed of 33 places in 167 ms of which 3 ms to minimize.
[2024-05-22 07:44:56] [INFO ] Deduced a trap composed of 35 places in 152 ms of which 4 ms to minimize.
[2024-05-22 07:44:56] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 4 ms to minimize.
[2024-05-22 07:44:56] [INFO ] Deduced a trap composed of 35 places in 152 ms of which 4 ms to minimize.
[2024-05-22 07:44:56] [INFO ] Deduced a trap composed of 35 places in 151 ms of which 4 ms to minimize.
[2024-05-22 07:44:56] [INFO ] Deduced a trap composed of 33 places in 158 ms of which 3 ms to minimize.
[2024-05-22 07:44:57] [INFO ] Deduced a trap composed of 34 places in 176 ms of which 3 ms to minimize.
[2024-05-22 07:44:57] [INFO ] Deduced a trap composed of 33 places in 166 ms of which 3 ms to minimize.
[2024-05-22 07:44:57] [INFO ] Deduced a trap composed of 36 places in 164 ms of which 4 ms to minimize.
[2024-05-22 07:44:57] [INFO ] Deduced a trap composed of 35 places in 153 ms of which 4 ms to minimize.
[2024-05-22 07:44:57] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1057 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:44:57] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 3 ms to minimize.
[2024-05-22 07:44:58] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 3 ms to minimize.
[2024-05-22 07:44:58] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 4 ms to minimize.
[2024-05-22 07:44:58] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 4 ms to minimize.
[2024-05-22 07:44:58] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 3 ms to minimize.
[2024-05-22 07:44:58] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 3 ms to minimize.
[2024-05-22 07:44:58] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 3 ms to minimize.
[2024-05-22 07:44:59] [INFO ] Deduced a trap composed of 33 places in 127 ms of which 3 ms to minimize.
[2024-05-22 07:44:59] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 3 ms to minimize.
[2024-05-22 07:44:59] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 3 ms to minimize.
[2024-05-22 07:44:59] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1057 variables, 11/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1057 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 29/1086 variables, 29/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1086 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1967/3053 variables, 1086/1241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3053 variables, 1846/3087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3053 variables, 1/3088 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3053 variables, 0/3088 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/3054 variables, 1/3089 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3054 variables, 0/3089 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/3054 variables, 0/3089 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3054/3054 variables, and 3089 constraints, problems are : Problem set: 0 solved, 1 unsolved in 19133 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 1087/1087 constraints, ReadFeed: 1846/1846 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 94/94 constraints]
After SMT, in 19957ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 68 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=34 )
FORMULA CANConstruction-PT-030-ReachabilityCardinality-2024-13 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 8 ms.
All properties solved without resorting to model-checking.
Total runtime 162236 ms.
ITS solved all properties within timeout

BK_STOP 1716363900649

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML

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-030"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is CANConstruction-PT-030, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r069-tall-171620503600030"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-030.tgz
mv CANConstruction-PT-030 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;